%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN924+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n012.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:25:30 EDT 2022
% Result : Theorem 1.67s 1.86s
% Output : Refutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 6 ( 3 unt; 1 nHn; 6 RR)
% Number of literals : 11 ( 0 equ; 6 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 6 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ p(A)
| ~ p(B) ),
file('SYN924+1.p',unknown),
[] ).
cnf(2,plain,
~ p(A),
inference(factor_simp,[status(thm)],[inference(copy,[status(thm)],[1])]),
[iquote('copy,1,factor_simp')] ).
cnf(3,axiom,
( ~ q(A)
| ~ q(B) ),
file('SYN924+1.p',unknown),
[] ).
cnf(4,plain,
~ q(A),
inference(factor_simp,[status(thm)],[inference(copy,[status(thm)],[3])]),
[iquote('copy,3,factor_simp')] ).
cnf(5,axiom,
( p(dollar_c1)
| q(dollar_c1)
| p(dollar_c2)
| q(dollar_c3) ),
file('SYN924+1.p',unknown),
[] ).
cnf(6,plain,
$false,
inference(unit_del,[status(thm)],[inference(copy,[status(thm)],[5]),2,4,2,4]),
[iquote('copy,5,unit_del,2,4,2,4')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN924+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n012.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:59:50 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.67/1.86
% 1.67/1.86 -------- PROOF --------
% 1.67/1.86 ----- Otter 3.3f, August 2004 -----
% 1.67/1.86 The process was started by sandbox2 on n012.cluster.edu,
% 1.67/1.86 Wed Jul 27 10:59:50 2022
% 1.67/1.86 The command was "./otter". The process ID is 23319.
% 1.67/1.86
% 1.67/1.86 set(prolog_style_variables).
% 1.67/1.86 set(auto).
% 1.67/1.86 dependent: set(auto1).
% 1.67/1.86 dependent: set(process_input).
% 1.67/1.86 dependent: clear(print_kept).
% 1.67/1.86 dependent: clear(print_new_demod).
% 1.67/1.86 dependent: clear(print_back_demod).
% 1.67/1.86 dependent: clear(print_back_sub).
% 1.67/1.86 dependent: set(control_memory).
% 1.67/1.86 dependent: assign(max_mem, 12000).
% 1.67/1.86 dependent: assign(pick_given_ratio, 4).
% 1.67/1.86 dependent: assign(stats_level, 1).
% 1.67/1.86 dependent: assign(max_seconds, 10800).
% 1.67/1.86 clear(print_given).
% 1.67/1.86
% 1.67/1.86 formula_list(usable).
% 1.67/1.86 -((exists X (p(X)|q(X)))<-> (exists X p(X))| (exists X q(X))).
% 1.67/1.86 end_of_list.
% 1.67/1.86
% 1.67/1.86 -------> usable clausifies to:
% 1.67/1.86
% 1.67/1.86 list(usable).
% 1.67/1.86 0 [] p($c1)|q($c1)|p($c2)|q($c3).
% 1.67/1.86 0 [] -p(X)| -p(X1).
% 1.67/1.86 0 [] -p(X)| -q(X2).
% 1.67/1.86 0 [] -q(X)| -p(X1).
% 1.67/1.86 0 [] -q(X)| -q(X2).
% 1.67/1.86 end_of_list.
% 1.67/1.86
% 1.67/1.86 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 1.67/1.86
% 1.67/1.86 This is a non-Horn set without equality. The strategy will
% 1.67/1.86 be ordered hyper_res, unit deletion, and factoring, with
% 1.67/1.86 satellites in sos and with nuclei in usable.
% 1.67/1.86
% 1.67/1.86 dependent: set(hyper_res).
% 1.67/1.86 dependent: set(factor).
% 1.67/1.86 dependent: set(unit_deletion).
% 1.67/1.86
% 1.67/1.86 ------------> process usable:
% 1.67/1.86 ** KEPT (pick-wt=2): 2 [copy,1,factor_simp] -p(A).
% 1.67/1.86 Following clause subsumed by 2 during input processing: 0 [] -p(A)| -q(B).
% 1.67/1.86 Following clause subsumed by 2 during input processing: 0 [] -q(A)| -p(B).
% 1.67/1.86 ** KEPT (pick-wt=2): 4 [copy,3,factor_simp] -q(A).
% 1.67/1.86
% 1.67/1.86 ------------> process sos:
% 1.67/1.86 ** KEPT (pick-wt=0): 6 [copy,5,unit_del,2,4,2,4] $F.
% 1.67/1.86
% 1.67/1.86 -----> EMPTY CLAUSE at 0.00 sec ----> 6 [copy,5,unit_del,2,4,2,4] $F.
% 1.67/1.86
% 1.67/1.86 Length of proof is 2. Level of proof is 1.
% 1.67/1.86
% 1.67/1.86 ---------------- PROOF ----------------
% 1.67/1.86 % SZS status Theorem
% 1.67/1.86 % SZS output start Refutation
% See solution above
% 1.67/1.86 ------------ end of proof -------------
% 1.67/1.86
% 1.67/1.86
% 1.67/1.86 Search stopped by max_proofs option.
% 1.67/1.86
% 1.67/1.86
% 1.67/1.86 Search stopped by max_proofs option.
% 1.67/1.86
% 1.67/1.86 ============ end of search ============
% 1.67/1.86
% 1.67/1.86 -------------- statistics -------------
% 1.67/1.86 clauses given 0
% 1.67/1.86 clauses generated 0
% 1.67/1.86 clauses kept 2
% 1.67/1.86 clauses forward subsumed 2
% 1.67/1.86 clauses back subsumed 0
% 1.67/1.86 Kbytes malloced 976
% 1.67/1.86
% 1.67/1.86 ----------- times (seconds) -----------
% 1.67/1.86 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.67/1.86 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.67/1.86 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.67/1.86
% 1.67/1.86 That finishes the proof of the theorem.
% 1.67/1.86
% 1.67/1.86 Process 23319 finished Wed Jul 27 10:59:52 2022
% 1.67/1.86 Otter interrupted
% 1.67/1.86 PROOF FOUND
%------------------------------------------------------------------------------