TSTP Solution File: SYN367+1 by Otter---3.3

View Problem - Process Solution

```%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SYN367+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n017.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Jul 27 13:24:22 EDT 2022

% Result   : Theorem 1.66s 1.88s
% Output   : Refutation 1.66s
% Verified :
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of clauses     :    7 (   5 unt;   1 nHn;   4 RR)
%            Number of literals    :    9 (   0 equ;   3 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   2 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :    3 (   3 sgn)

%------------------------------------------------------------------------------
cnf(1,axiom,
( big_q(A)
| ~ p ),
file('SYN367+1.p',unknown),
[] ).

cnf(2,axiom,
~ big_q(dollar_c1),
file('SYN367+1.p',unknown),
[] ).

cnf(3,axiom,
~ big_r(dollar_c2),
file('SYN367+1.p',unknown),
[] ).

cnf(4,axiom,
( p
| big_r(A) ),
file('SYN367+1.p',unknown),
[] ).

cnf(6,plain,
p,
inference(hyper,[status(thm)],[4,3]),
[iquote('hyper,4,3')] ).

cnf(7,plain,
big_q(A),
inference(hyper,[status(thm)],[6,1]),
[iquote('hyper,6,1')] ).

cnf(8,plain,
\$false,
inference(binary,[status(thm)],[7,2]),
[iquote('binary,7.1,2.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SYN367+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n017.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Wed Jul 27 10:23:48 EDT 2022
% 0.12/0.33  % CPUTime  :
% 1.66/1.88  ----- Otter 3.3f, August 2004 -----
% 1.66/1.88  The process was started by sandbox2 on n017.cluster.edu,
% 1.66/1.88  Wed Jul 27 10:23:48 2022
% 1.66/1.88  The command was "./otter".  The process ID is 4491.
% 1.66/1.88
% 1.66/1.88  set(prolog_style_variables).
% 1.66/1.88  set(auto).
% 1.66/1.88     dependent: set(auto1).
% 1.66/1.88     dependent: set(process_input).
% 1.66/1.88     dependent: clear(print_kept).
% 1.66/1.88     dependent: clear(print_new_demod).
% 1.66/1.88     dependent: clear(print_back_demod).
% 1.66/1.88     dependent: clear(print_back_sub).
% 1.66/1.88     dependent: set(control_memory).
% 1.66/1.88     dependent: assign(max_mem, 12000).
% 1.66/1.88     dependent: assign(pick_given_ratio, 4).
% 1.66/1.88     dependent: assign(stats_level, 1).
% 1.66/1.88     dependent: assign(max_seconds, 10800).
% 1.66/1.88  clear(print_given).
% 1.66/1.88
% 1.66/1.88  formula_list(usable).
% 1.66/1.88  -((all X (p&big_q(X)| -p&big_r(X)))-> (all X big_q(X))| (all X big_r(X))).
% 1.66/1.88  end_of_list.
% 1.66/1.88
% 1.66/1.88  -------> usable clausifies to:
% 1.66/1.88
% 1.66/1.88  list(usable).
% 1.66/1.88  0 [] p|big_r(X).
% 1.66/1.88  0 [] big_q(X)| -p.
% 1.66/1.88  0 [] big_q(X)|big_r(X).
% 1.66/1.88  0 [] -big_q(\$c1).
% 1.66/1.88  0 [] -big_r(\$c2).
% 1.66/1.88  end_of_list.
% 1.66/1.88
% 1.66/1.88  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=2.
% 1.66/1.88
% 1.66/1.88  This is a non-Horn set without equality.  The strategy will
% 1.66/1.88  be ordered hyper_res, unit deletion, and factoring, with
% 1.66/1.88  satellites in sos and with nuclei in usable.
% 1.66/1.88
% 1.66/1.88     dependent: set(hyper_res).
% 1.66/1.88     dependent: set(factor).
% 1.66/1.88     dependent: set(unit_deletion).
% 1.66/1.88
% 1.66/1.88  ------------> process usable:
% 1.66/1.88  ** KEPT (pick-wt=3): 1 [] big_q(A)| -p.
% 1.66/1.88  ** KEPT (pick-wt=2): 2 [] -big_q(\$c1).
% 1.66/1.88  ** KEPT (pick-wt=2): 3 [] -big_r(\$c2).
% 1.66/1.88
% 1.66/1.88  ------------> process sos:
% 1.66/1.88  ** KEPT (pick-wt=3): 4 [] p|big_r(A).
% 1.66/1.88  ** KEPT (pick-wt=4): 5 [] big_q(A)|big_r(A).
% 1.66/1.88
% 1.66/1.88  ======= end of input processing =======
% 1.66/1.88
% 1.66/1.88  =========== start of search ===========
% 1.66/1.88
% 1.66/1.88  -------- PROOF --------
% 1.66/1.88
% 1.66/1.88  ----> UNIT CONFLICT at   0.00 sec ----> 8 [binary,7.1,2.1] \$F.
% 1.66/1.88
% 1.66/1.88  Length of proof is 2.  Level of proof is 2.
% 1.66/1.88
% 1.66/1.88  ---------------- PROOF ----------------
% 1.66/1.88  % SZS status Theorem
% 1.66/1.88  % SZS output start Refutation
% See solution above
% 1.66/1.88  ------------ end of proof -------------
% 1.66/1.88
% 1.66/1.88
% 1.66/1.88  Search stopped by max_proofs option.
% 1.66/1.88
% 1.66/1.88
% 1.66/1.88  Search stopped by max_proofs option.
% 1.66/1.88
% 1.66/1.88  ============ end of search ============
% 1.66/1.88
% 1.66/1.88  -------------- statistics -------------
% 1.66/1.88  clauses given                  2
% 1.66/1.88  clauses generated              2
% 1.66/1.88  clauses kept                   7
% 1.66/1.88  clauses forward subsumed       0
% 1.66/1.88  clauses back subsumed          1
% 1.66/1.88  Kbytes malloced              976
% 1.66/1.88
% 1.66/1.88  ----------- times (seconds) -----------
% 1.66/1.88  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.66/1.88  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.66/1.88  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.66/1.88
% 1.66/1.88  That finishes the proof of the theorem.
% 1.66/1.88
% 1.66/1.88  Process 4491 finished Wed Jul 27 10:23:49 2022
% 1.66/1.88  Otter interrupted
% 1.66/1.88  PROOF FOUND
%------------------------------------------------------------------------------
```