%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : COM004-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n016.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 12:48:20 EDT 2022
% Result : Unsatisfiable 1.66s 1.89s
% Output : Refutation 1.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 13 ( 12 unt; 0 nHn; 11 RR)
% Number of literals : 17 ( 4 equ; 5 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 9 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( failure_node(parent_of(A,B),or(C,D))
| ~ failure_node(A,or(C,E))
| ~ failure_node(B,or(D,F))
| ~ contradictory(E,F)
| ~ siblings(A,B) ),
file('COM004-1.p',unknown),
[] ).
cnf(2,axiom,
~ failure_node(A,or(empty,empty)),
file('COM004-1.p',unknown),
[] ).
cnf(5,axiom,
contradictory(A,negate(A)),
file('COM004-1.p',unknown),
[] ).
cnf(6,axiom,
siblings(left_child_of(A),right_child_of(A)),
file('COM004-1.p',unknown),
[] ).
cnf(7,axiom,
failure_node(n_left,or(empty,atom)),
file('COM004-1.p',unknown),
[] ).
cnf(8,axiom,
failure_node(n_right,or(empty,negate(atom))),
file('COM004-1.p',unknown),
[] ).
cnf(9,axiom,
n_left = left_child_of(n),
file('COM004-1.p',unknown),
[] ).
cnf(10,plain,
left_child_of(n) = n_left,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[9])]),
[iquote('copy,9,flip.1')] ).
cnf(12,axiom,
n_right = right_child_of(n),
file('COM004-1.p',unknown),
[] ).
cnf(14,plain,
right_child_of(n) = n_right,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[12])]),
[iquote('copy,12,flip.1')] ).
cnf(15,plain,
siblings(n_left,n_right),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[6,10]),14]),
[iquote('para_into,6.1.1,10.1.1,demod,14')] ).
cnf(16,plain,
failure_node(parent_of(n_left,n_right),or(empty,empty)),
inference(hyper,[status(thm)],[8,1,7,5,15]),
[iquote('hyper,8,1,7,5,15')] ).
cnf(17,plain,
$false,
inference(binary,[status(thm)],[16,2]),
[iquote('binary,16.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : COM004-1 : TPTP v8.1.0. Released v1.1.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.11/0.33 % Computer : n016.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Wed Jul 27 06:58:22 EDT 2022
% 0.11/0.33 % CPUTime :
% 1.66/1.89 ----- Otter 3.3f, August 2004 -----
% 1.66/1.89 The process was started by sandbox2 on n016.cluster.edu,
% 1.66/1.89 Wed Jul 27 06:58:22 2022
% 1.66/1.89 The command was "./otter". The process ID is 25085.
% 1.66/1.89
% 1.66/1.89 set(prolog_style_variables).
% 1.66/1.89 set(auto).
% 1.66/1.89 dependent: set(auto1).
% 1.66/1.89 dependent: set(process_input).
% 1.66/1.89 dependent: clear(print_kept).
% 1.66/1.89 dependent: clear(print_new_demod).
% 1.66/1.89 dependent: clear(print_back_demod).
% 1.66/1.89 dependent: clear(print_back_sub).
% 1.66/1.89 dependent: set(control_memory).
% 1.66/1.89 dependent: assign(max_mem, 12000).
% 1.66/1.89 dependent: assign(pick_given_ratio, 4).
% 1.66/1.89 dependent: assign(stats_level, 1).
% 1.66/1.89 dependent: assign(max_seconds, 10800).
% 1.66/1.89 clear(print_given).
% 1.66/1.89
% 1.66/1.89 list(usable).
% 1.66/1.89 0 [] A=A.
% 1.66/1.89 0 [] failure_node(parent_of(X,Y),or(C,D))| -failure_node(X,or(C,P))| -failure_node(Y,or(D,Q))| -contradictory(P,Q)| -siblings(X,Y).
% 1.66/1.89 0 [] contradictory(negate(X),X).
% 1.66/1.89 0 [] contradictory(X,negate(X)).
% 1.66/1.89 0 [] siblings(left_child_of(X),right_child_of(X)).
% 1.66/1.89 0 [] failure_node(n_left,or(empty,atom)).
% 1.66/1.89 0 [] failure_node(n_right,or(empty,negate(atom))).
% 1.66/1.89 0 [] n_left=left_child_of(n).
% 1.66/1.89 0 [] n_right=right_child_of(n).
% 1.66/1.89 0 [] -failure_node(Z,or(empty,empty)).
% 1.66/1.89 end_of_list.
% 1.66/1.89
% 1.66/1.89 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=5.
% 1.66/1.89
% 1.66/1.89 This is a Horn set with equality. The strategy will be
% 1.66/1.89 Knuth-Bendix and hyper_res, with positive clauses in
% 1.66/1.89 sos and nonpositive clauses in usable.
% 1.66/1.89
% 1.66/1.89 dependent: set(knuth_bendix).
% 1.66/1.89 dependent: set(anl_eq).
% 1.66/1.89 dependent: set(para_from).
% 1.66/1.89 dependent: set(para_into).
% 1.66/1.89 dependent: clear(para_from_right).
% 1.66/1.89 dependent: clear(para_into_right).
% 1.66/1.89 dependent: set(para_from_vars).
% 1.66/1.89 dependent: set(eq_units_both_ways).
% 1.66/1.89 dependent: set(dynamic_demod_all).
% 1.66/1.89 dependent: set(dynamic_demod).
% 1.66/1.89 dependent: set(order_eq).
% 1.66/1.89 dependent: set(back_demod).
% 1.66/1.89 dependent: set(lrpo).
% 1.66/1.89 dependent: set(hyper_res).
% 1.66/1.89 dependent: clear(order_hyper).
% 1.66/1.89
% 1.66/1.89 ------------> process usable:
% 1.66/1.89 ** KEPT (pick-wt=23): 1 [] failure_node(parent_of(A,B),or(C,D))| -failure_node(A,or(C,E))| -failure_node(B,or(D,F))| -contradictory(E,F)| -siblings(A,B).
% 1.66/1.89 ** KEPT (pick-wt=5): 2 [] -failure_node(A,or(empty,empty)).
% 1.66/1.89
% 1.66/1.89 ------------> process sos:
% 1.66/1.89 ** KEPT (pick-wt=3): 3 [] A=A.
% 1.66/1.89 ** KEPT (pick-wt=4): 4 [] contradictory(negate(A),A).
% 1.66/1.89 ** KEPT (pick-wt=4): 5 [] contradictory(A,negate(A)).
% 1.66/1.89 ** KEPT (pick-wt=5): 6 [] siblings(left_child_of(A),right_child_of(A)).
% 1.66/1.89 ** KEPT (pick-wt=5): 7 [] failure_node(n_left,or(empty,atom)).
% 1.66/1.89 ** KEPT (pick-wt=6): 8 [] failure_node(n_right,or(empty,negate(atom))).
% 1.66/1.89 ** KEPT (pick-wt=4): 10 [copy,9,flip.1] left_child_of(n)=n_left.
% 1.66/1.89 ---> New Demodulator: 11 [new_demod,10] left_child_of(n)=n_left.
% 1.66/1.89 ** KEPT (pick-wt=4): 13 [copy,12,flip.1] right_child_of(n)=n_right.
% 1.66/1.89 ---> New Demodulator: 14 [new_demod,13] right_child_of(n)=n_right.
% 1.66/1.89 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.66/1.89 >>>> Starting back demodulation with 11.
% 1.66/1.89 >>>> Starting back demodulation with 14.
% 1.66/1.89
% 1.66/1.89 ======= end of input processing =======
% 1.66/1.89
% 1.66/1.89 =========== start of search ===========
% 1.66/1.89
% 1.66/1.89 -------- PROOF --------
% 1.66/1.89
% 1.66/1.89 ----> UNIT CONFLICT at 0.00 sec ----> 17 [binary,16.1,2.1] $F.
% 1.66/1.89
% 1.66/1.89 Length of proof is 4. Level of proof is 3.
% 1.66/1.89
% 1.66/1.89 ---------------- PROOF ----------------
% 1.66/1.89 % SZS status Unsatisfiable
% 1.66/1.89 % SZS output start Refutation
% See solution above
% 1.66/1.89 ------------ end of proof -------------
% 1.66/1.89
% 1.66/1.89
% 1.66/1.89 Search stopped by max_proofs option.
% 1.66/1.89
% 1.66/1.89
% 1.66/1.89 Search stopped by max_proofs option.
% 1.66/1.89
% 1.66/1.89 ============ end of search ============
% 1.66/1.89
% 1.66/1.89 -------------- statistics -------------
% 1.66/1.89 clauses given 9
% 1.66/1.89 clauses generated 7
% 1.66/1.89 clauses kept 12
% 1.66/1.89 clauses forward subsumed 6
% 1.66/1.89 clauses back subsumed 0
% 1.66/1.89 Kbytes malloced 976
% 1.66/1.89
% 1.66/1.89 ----------- times (seconds) -----------
% 1.66/1.89 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.66/1.89 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.66/1.89 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.66/1.89
% 1.66/1.89 That finishes the proof of the theorem.
% 1.66/1.89
% 1.66/1.89 Process 25085 finished Wed Jul 27 06:58:23 2022
% 1.66/1.89 Otter interrupted
% 1.66/1.89 PROOF FOUND
%------------------------------------------------------------------------------