TSTP Solution File: LCL159-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL159-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n006.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:03:43 EDT 2022
% Result : Unsatisfiable 1.96s 2.17s
% Output : Refutation 1.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of clauses : 62 ( 62 unt; 0 nHn; 10 RR)
% Number of literals : 62 ( 61 equ; 6 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 79 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
xor(x,xor(truth,y)) != xor(xor(x,truth),y),
file('LCL159-1.p',unknown),
[] ).
cnf(2,plain,
xor(xor(x,truth),y) != xor(x,xor(truth,y)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1])]),
[iquote('copy,1,flip.1')] ).
cnf(3,axiom,
A = A,
file('LCL159-1.p',unknown),
[] ).
cnf(5,axiom,
implies(truth,A) = A,
file('LCL159-1.p',unknown),
[] ).
cnf(6,axiom,
implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth,
file('LCL159-1.p',unknown),
[] ).
cnf(8,axiom,
implies(implies(A,B),B) = implies(implies(B,A),A),
file('LCL159-1.p',unknown),
[] ).
cnf(9,axiom,
implies(implies(not(A),not(B)),implies(B,A)) = truth,
file('LCL159-1.p',unknown),
[] ).
cnf(11,axiom,
or(A,B) = implies(not(A),B),
file('LCL159-1.p',unknown),
[] ).
cnf(14,axiom,
or(A,B) = or(B,A),
file('LCL159-1.p',unknown),
[] ).
cnf(15,axiom,
and(A,B) = not(or(not(A),not(B))),
file('LCL159-1.p',unknown),
[] ).
cnf(16,plain,
not(or(not(A),not(B))) = and(A,B),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[15])]),
[iquote('copy,15,flip.1')] ).
cnf(19,axiom,
and(and(A,B),C) = and(A,and(B,C)),
file('LCL159-1.p',unknown),
[] ).
cnf(21,axiom,
xor(A,B) = or(and(A,not(B)),and(not(A),B)),
file('LCL159-1.p',unknown),
[] ).
cnf(27,axiom,
not(truth) = falsehood,
file('LCL159-1.p',unknown),
[] ).
cnf(28,plain,
implies(not(A),B) = or(A,B),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[11])]),
[iquote('copy,11,flip.1')] ).
cnf(29,plain,
or(and(A,not(B)),and(not(A),B)) = xor(A,B),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[21])]),
[iquote('copy,21,flip.1')] ).
cnf(32,plain,
implies(A,implies(implies(A,B),B)) = truth,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[6,5]),5]),
[iquote('para_into,6.1.1.1,4.1.1,demod,5')] ).
cnf(36,plain,
implies(implies(A,truth),implies(B,implies(A,B))) = truth,
inference(para_into,[status(thm),theory(equality)],[6,5]),
[iquote('para_into,6.1.1.2.1,4.1.1')] ).
cnf(44,plain,
or(A,B) = implies(not(B),A),
inference(para_into,[status(thm),theory(equality)],[11,14]),
[iquote('para_into,11.1.1,14.1.1')] ).
cnf(45,plain,
implies(not(A),B) = or(B,A),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[44])]),
[iquote('copy,44,flip.1')] ).
cnf(46,plain,
or(truth,A) = implies(falsehood,A),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[28,27])]),
[iquote('para_into,28.1.1.1,26.1.1,flip.1')] ).
cnf(60,plain,
implies(implies(A,truth),truth) = implies(A,A),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[8,5])]),
[iquote('para_into,8.1.1.1,4.1.1,flip.1')] ).
cnf(70,plain,
or(A,truth) = implies(falsehood,A),
inference(para_into,[status(thm),theory(equality)],[46,14]),
[iquote('para_into,46.1.1,14.1.1')] ).
cnf(72,plain,
implies(not(A),truth) = implies(falsehood,A),
inference(para_into,[status(thm),theory(equality)],[70,11]),
[iquote('para_into,70.1.1,11.1.1')] ).
cnf(85,plain,
implies(implies(not(A),falsehood),A) = truth,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[9,27]),5]),
[iquote('para_into,9.1.1.1.2,26.1.1,demod,5')] ).
cnf(121,plain,
implies(implies(falsehood,falsehood),truth) = truth,
inference(para_into,[status(thm),theory(equality)],[85,27]),
[iquote('para_into,85.1.1.1.1,26.1.1')] ).
cnf(123,plain,
implies(or(falsehood,A),A) = truth,
inference(para_into,[status(thm),theory(equality)],[85,45]),
[iquote('para_into,85.1.1.1,45.1.1')] ).
cnf(141,plain,
implies(implies(implies(falsehood,falsehood),A),implies(A,A)) = truth,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[121,6]),60]),
[iquote('para_from,121.1.1,6.1.1.2.2,demod,60')] ).
cnf(149,plain,
implies(implies(not(falsehood),A),A) = truth,
inference(para_into,[status(thm),theory(equality)],[123,11]),
[iquote('para_into,123.1.1.1,11.1.1')] ).
cnf(196,plain,
implies(implies(A,implies(not(falsehood),A)),implies(not(falsehood),A)) = A,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[149,8]),5])]),
[iquote('para_from,149.1.1,8.1.1.1,demod,5,flip.1')] ).
cnf(209,plain,
implies(A,A) = truth,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[32,5]),5]),
[iquote('para_into,32.1.1.2.1,4.1.1,demod,5')] ).
cnf(217,plain,
implies(A,truth) = truth,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[141]),209,5,209]),
[iquote('back_demod,141,demod,209,5,209')] ).
cnf(221,plain,
implies(falsehood,A) = truth,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[72]),217])]),
[iquote('back_demod,72,demod,217,flip.1')] ).
cnf(223,plain,
implies(A,implies(B,A)) = truth,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[36]),217,5]),
[iquote('back_demod,36,demod,217,5')] ).
cnf(225,plain,
or(A,truth) = truth,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[70]),221]),
[iquote('back_demod,70,demod,221')] ).
cnf(227,plain,
or(truth,A) = truth,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[46]),221]),
[iquote('back_demod,46,demod,221')] ).
cnf(228,plain,
implies(not(falsehood),A) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[196]),223,5]),
[iquote('back_demod,196,demod,223,5')] ).
cnf(244,plain,
not(or(not(A),falsehood)) = and(A,truth),
inference(para_into,[status(thm),theory(equality)],[16,27]),
[iquote('para_into,16.1.1.1.2,26.1.1')] ).
cnf(263,plain,
implies(implies(A,falsehood),falsehood) = A,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[221,8]),5])]),
[iquote('para_from,220.1.1,8.1.1.1,demod,5,flip.1')] ).
cnf(267,plain,
not(falsehood) = truth,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[228,209])]),
[iquote('para_into,228.1.1,208.1.1,flip.1')] ).
cnf(270,plain,
or(A,falsehood) = A,
inference(para_into,[status(thm),theory(equality)],[228,45]),
[iquote('para_into,228.1.1,45.1.1')] ).
cnf(272,plain,
or(falsehood,A) = A,
inference(para_into,[status(thm),theory(equality)],[228,28]),
[iquote('para_into,228.1.1,28.1.1')] ).
cnf(273,plain,
not(not(A)) = and(A,truth),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[244]),270]),
[iquote('back_demod,244,demod,270')] ).
cnf(282,plain,
and(A,falsehood) = falsehood,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[267,16]),225,27])]),
[iquote('para_from,267.1.1,16.1.1.1.2,demod,225,27,flip.1')] ).
cnf(284,plain,
and(falsehood,A) = falsehood,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[267,16]),227,27])]),
[iquote('para_from,267.1.1,16.1.1.1.1,demod,227,27,flip.1')] ).
cnf(287,plain,
implies(not(A),falsehood) = A,
inference(para_into,[status(thm),theory(equality)],[270,11]),
[iquote('para_into,269.1.1,11.1.1')] ).
cnf(291,plain,
or(and(xor(x,truth),not(y)),and(not(xor(x,truth)),y)) != xor(x,xor(truth,y)),
inference(para_from,[status(thm),theory(equality)],[21,2]),
[iquote('para_from,21.1.1,2.1.1')] ).
cnf(320,plain,
or(and(not(A),B),and(A,not(B))) = xor(A,B),
inference(para_into,[status(thm),theory(equality)],[29,14]),
[iquote('para_into,29.1.1,14.1.1')] ).
cnf(321,plain,
implies(not(and(A,not(B))),and(not(A),B)) = xor(A,B),
inference(para_into,[status(thm),theory(equality)],[29,11]),
[iquote('para_into,29.1.1,11.1.1')] ).
cnf(328,plain,
xor(A,B) = or(and(not(A),B),and(A,not(B))),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[320])]),
[iquote('copy,320,flip.1')] ).
cnf(331,plain,
or(not(A),not(B)) = implies(and(A,B),falsehood),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[287,16])]),
[iquote('para_into,287.1.1.1,16.1.1,flip.1')] ).
cnf(354,plain,
not(A) = implies(A,falsehood),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[287,8]),221,5])]),
[iquote('para_from,287.1.1,8.1.1.1,demod,221,5,flip.1')] ).
cnf(373,plain,
or(implies(A,falsehood),implies(B,falsehood)) = implies(and(A,B),falsehood),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[331]),354,354]),
[iquote('back_demod,331,demod,354,354')] ).
cnf(378,plain,
xor(A,B) = or(and(implies(A,falsehood),B),and(A,implies(B,falsehood))),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[328]),354,354]),
[iquote('back_demod,328,demod,354,354')] ).
cnf(382,plain,
or(and(implies(A,falsehood),B),and(A,implies(B,falsehood))) = implies(implies(and(A,implies(B,falsehood)),falsehood),and(implies(A,falsehood),B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[321]),354,354,354,378])]),
[iquote('back_demod,321,demod,354,354,354,378,flip.1')] ).
cnf(398,plain,
or(and(implies(x,falsehood),and(truth,implies(y,falsehood))),and(implies(and(implies(x,falsehood),truth),falsehood),y)) != implies(implies(and(x,implies(and(truth,implies(y,falsehood)),falsehood)),falsehood),and(implies(x,falsehood),and(truth,implies(y,falsehood)))),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[291]),378,5,282,270,354,19,378,5,282,270,354,378,5,284,272,378,382]),
[iquote('back_demod,291,demod,378,5,282,270,354,19,378,5,282,270,354,378,5,284,272,378,382')] ).
cnf(408,plain,
and(A,truth) = A,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[273]),354,354,263])]),
[iquote('back_demod,273,demod,354,354,263,flip.1')] ).
cnf(458,plain,
or(A,B) = implies(implies(B,falsehood),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[45]),354])]),
[iquote('back_demod,45,demod,354,flip.1')] ).
cnf(474,plain,
implies(implies(and(x,implies(and(truth,implies(y,falsehood)),falsehood)),falsehood),and(implies(x,falsehood),and(truth,implies(y,falsehood)))) != implies(implies(and(x,y),falsehood),and(implies(x,falsehood),and(truth,implies(y,falsehood)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[398]),408,263,458])]),
[iquote('back_demod,398,demod,408,263,458,flip.1')] ).
cnf(503,plain,
implies(and(A,B),falsehood) = implies(B,implies(A,falsehood)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[373]),458,263])]),
[iquote('back_demod,373,demod,458,263,flip.1')] ).
cnf(519,plain,
implies(implies(y,implies(x,falsehood)),and(implies(x,falsehood),and(truth,implies(y,falsehood)))) != implies(implies(y,implies(x,falsehood)),and(implies(x,falsehood),and(truth,implies(y,falsehood)))),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[474]),503,5,263,503,503]),
[iquote('back_demod,474,demod,503,5,263,503,503')] ).
cnf(520,plain,
$false,
inference(binary,[status(thm)],[519,3]),
[iquote('binary,519.1,3.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL159-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n006.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 09:08:47 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.96/2.15 ----- Otter 3.3f, August 2004 -----
% 1.96/2.15 The process was started by sandbox2 on n006.cluster.edu,
% 1.96/2.15 Wed Jul 27 09:08:47 2022
% 1.96/2.15 The command was "./otter". The process ID is 24059.
% 1.96/2.15
% 1.96/2.15 set(prolog_style_variables).
% 1.96/2.15 set(auto).
% 1.96/2.15 dependent: set(auto1).
% 1.96/2.15 dependent: set(process_input).
% 1.96/2.15 dependent: clear(print_kept).
% 1.96/2.15 dependent: clear(print_new_demod).
% 1.96/2.15 dependent: clear(print_back_demod).
% 1.96/2.15 dependent: clear(print_back_sub).
% 1.96/2.15 dependent: set(control_memory).
% 1.96/2.15 dependent: assign(max_mem, 12000).
% 1.96/2.15 dependent: assign(pick_given_ratio, 4).
% 1.96/2.15 dependent: assign(stats_level, 1).
% 1.96/2.15 dependent: assign(max_seconds, 10800).
% 1.96/2.15 clear(print_given).
% 1.96/2.15
% 1.96/2.15 list(usable).
% 1.96/2.15 0 [] A=A.
% 1.96/2.15 0 [] implies(truth,X)=X.
% 1.96/2.15 0 [] implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))=truth.
% 1.96/2.15 0 [] implies(implies(X,Y),Y)=implies(implies(Y,X),X).
% 1.96/2.15 0 [] implies(implies(not(X),not(Y)),implies(Y,X))=truth.
% 1.96/2.15 0 [] or(X,Y)=implies(not(X),Y).
% 1.96/2.15 0 [] or(or(X,Y),Z)=or(X,or(Y,Z)).
% 1.96/2.15 0 [] or(X,Y)=or(Y,X).
% 1.96/2.15 0 [] and(X,Y)=not(or(not(X),not(Y))).
% 1.96/2.15 0 [] and(and(X,Y),Z)=and(X,and(Y,Z)).
% 1.96/2.15 0 [] and(X,Y)=and(Y,X).
% 1.96/2.15 0 [] xor(X,Y)=or(and(X,not(Y)),and(not(X),Y)).
% 1.96/2.15 0 [] xor(X,Y)=xor(Y,X).
% 1.96/2.15 0 [] and_star(X,Y)=not(or(not(X),not(Y))).
% 1.96/2.15 0 [] and_star(and_star(X,Y),Z)=and_star(X,and_star(Y,Z)).
% 1.96/2.15 0 [] and_star(X,Y)=and_star(Y,X).
% 1.96/2.15 0 [] not(truth)=falsehood.
% 1.96/2.15 0 [] xor(x,xor(truth,y))!=xor(xor(x,truth),y).
% 1.96/2.15 end_of_list.
% 1.96/2.15
% 1.96/2.15 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.96/2.15
% 1.96/2.15 All clauses are units, and equality is present; the
% 1.96/2.15 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.96/2.15
% 1.96/2.15 dependent: set(knuth_bendix).
% 1.96/2.15 dependent: set(anl_eq).
% 1.96/2.15 dependent: set(para_from).
% 1.96/2.15 dependent: set(para_into).
% 1.96/2.15 dependent: clear(para_from_right).
% 1.96/2.15 dependent: clear(para_into_right).
% 1.96/2.15 dependent: set(para_from_vars).
% 1.96/2.15 dependent: set(eq_units_both_ways).
% 1.96/2.15 dependent: set(dynamic_demod_all).
% 1.96/2.15 dependent: set(dynamic_demod).
% 1.96/2.15 dependent: set(order_eq).
% 1.96/2.15 dependent: set(back_demod).
% 1.96/2.15 dependent: set(lrpo).
% 1.96/2.15
% 1.96/2.15 ------------> process usable:
% 1.96/2.15 ** KEPT (pick-wt=11): 2 [copy,1,flip.1] xor(xor(x,truth),y)!=xor(x,xor(truth,y)).
% 1.96/2.15
% 1.96/2.15 ------------> process sos:
% 1.96/2.15 ** KEPT (pick-wt=3): 3 [] A=A.
% 1.96/2.15 ** KEPT (pick-wt=5): 4 [] implies(truth,A)=A.
% 1.96/2.15 ---> New Demodulator: 5 [new_demod,4] implies(truth,A)=A.
% 1.96/2.15 ** KEPT (pick-wt=13): 6 [] implies(implies(A,B),implies(implies(B,C),implies(A,C)))=truth.
% 1.96/2.15 ---> New Demodulator: 7 [new_demod,6] implies(implies(A,B),implies(implies(B,C),implies(A,C)))=truth.
% 1.96/2.15 ** KEPT (pick-wt=11): 8 [] implies(implies(A,B),B)=implies(implies(B,A),A).
% 1.96/2.15 ** KEPT (pick-wt=11): 9 [] implies(implies(not(A),not(B)),implies(B,A))=truth.
% 1.96/2.15 ---> New Demodulator: 10 [new_demod,9] implies(implies(not(A),not(B)),implies(B,A))=truth.
% 1.96/2.15 ** KEPT (pick-wt=8): 11 [] or(A,B)=implies(not(A),B).
% 1.96/2.15 ** KEPT (pick-wt=11): 12 [] or(or(A,B),C)=or(A,or(B,C)).
% 1.96/2.15 ---> New Demodulator: 13 [new_demod,12] or(or(A,B),C)=or(A,or(B,C)).
% 1.96/2.15 ** KEPT (pick-wt=7): 14 [] or(A,B)=or(B,A).
% 1.96/2.15 ** KEPT (pick-wt=10): 16 [copy,15,flip.1] not(or(not(A),not(B)))=and(A,B).
% 1.96/2.15 ---> New Demodulator: 17 [new_demod,16] not(or(not(A),not(B)))=and(A,B).
% 1.96/2.15 ** KEPT (pick-wt=11): 18 [] and(and(A,B),C)=and(A,and(B,C)).
% 1.96/2.15 ---> New Demodulator: 19 [new_demod,18] and(and(A,B),C)=and(A,and(B,C)).
% 1.96/2.15 ** KEPT (pick-wt=7): 20 [] and(A,B)=and(B,A).
% 1.96/2.15 ** KEPT (pick-wt=13): 21 [] xor(A,B)=or(and(A,not(B)),and(not(A),B)).
% 1.96/2.15 ** KEPT (pick-wt=7): 22 [] xor(A,B)=xor(B,A).
% 1.96/2.15 ** KEPT (pick-wt=7): 24 [copy,23,demod,17] and_star(A,B)=and(A,B).
% 1.96/2.15 ---> New Demodulator: 25 [new_demod,24] and_star(A,B)=and(A,B).
% 1.96/2.15 Following clause subsumed by 3 during input processing: 0 [demod,25,25,19,25,25] and(A,and(B,C))=and(A,and(B,C)).
% 1.96/2.15 Following clause subsumed by 20 during input processing: 0 [demod,25,25] and(A,B)=and(B,A).
% 1.96/2.15 ** KEPT (pick-wt=4): 26 [] not(truth)=falsehood.
% 1.96/2.15 ---> New Demodulator: 27 [new_demod,26] not(truth)=falsehood.
% 1.96/2.15 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.96/2.15 >>>> Starting back demodulation with 5.
% 1.96/2.15 >>>> Starting back demodulation with 7.
% 1.96/2.15 Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] implies(implies(A,B),B)=implies(implies(B,A),A).
% 1.96/2.15 >>>> Starting back demodulation with 10.
% 1.96/2.17 ** KEPT (pick-wt=8): 28 [copy,11,flip.1] implies(not(A),B)=or(A,B).
% 1.96/2.17 >>>> Starting back demodulation with 13.
% 1.96/2.17 Following clause subsumed by 14 during input processing: 0 [copy,14,flip.1] or(A,B)=or(B,A).
% 1.96/2.17 >>>> Starting back demodulation with 17.
% 1.96/2.17 >>>> Starting back demodulation with 19.
% 1.96/2.17 Following clause subsumed by 20 during input processing: 0 [copy,20,flip.1] and(A,B)=and(B,A).
% 1.96/2.17 ** KEPT (pick-wt=13): 29 [copy,21,flip.1] or(and(A,not(B)),and(not(A),B))=xor(A,B).
% 1.96/2.17 Following clause subsumed by 22 during input processing: 0 [copy,22,flip.1] xor(A,B)=xor(B,A).
% 1.96/2.17 >>>> Starting back demodulation with 25.
% 1.96/2.17 >>>> Starting back demodulation with 27.
% 1.96/2.17 Following clause subsumed by 11 during input processing: 0 [copy,28,flip.1] or(A,B)=implies(not(A),B).
% 1.96/2.17 Following clause subsumed by 21 during input processing: 0 [copy,29,flip.1] xor(A,B)=or(and(A,not(B)),and(not(A),B)).
% 1.96/2.17
% 1.96/2.17 ======= end of input processing =======
% 1.96/2.17
% 1.96/2.17 =========== start of search ===========
% 1.96/2.17
% 1.96/2.17 -------- PROOF --------
% 1.96/2.17
% 1.96/2.17 ----> UNIT CONFLICT at 0.01 sec ----> 520 [binary,519.1,3.1] $F.
% 1.96/2.17
% 1.96/2.17 Length of proof is 49. Level of proof is 14.
% 1.96/2.17
% 1.96/2.17 ---------------- PROOF ----------------
% 1.96/2.17 % SZS status Unsatisfiable
% 1.96/2.17 % SZS output start Refutation
% See solution above
% 1.96/2.17 ------------ end of proof -------------
% 1.96/2.17
% 1.96/2.17
% 1.96/2.17 Search stopped by max_proofs option.
% 1.96/2.17
% 1.96/2.17
% 1.96/2.17 Search stopped by max_proofs option.
% 1.96/2.17
% 1.96/2.17 ============ end of search ============
% 1.96/2.17
% 1.96/2.17 -------------- statistics -------------
% 1.96/2.17 clauses given 42
% 1.96/2.17 clauses generated 451
% 1.96/2.17 clauses kept 302
% 1.96/2.17 clauses forward subsumed 455
% 1.96/2.17 clauses back subsumed 3
% 1.96/2.17 Kbytes malloced 2929
% 1.96/2.17
% 1.96/2.17 ----------- times (seconds) -----------
% 1.96/2.17 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.96/2.17 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.96/2.17 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.96/2.17
% 1.96/2.17 That finishes the proof of the theorem.
% 1.96/2.17
% 1.96/2.17 Process 24059 finished Wed Jul 27 09:08:48 2022
% 1.96/2.17 Otter interrupted
% 1.96/2.17 PROOF FOUND
%------------------------------------------------------------------------------