TSTP Solution File: LCL153-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : LCL153-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n011.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 : 600s
% DateTime : Sun Jul 17 09:41:21 EDT 2022
% Result : Unsatisfiable 0.73s 1.14s
% Output : Refutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 12
% Syntax : Number of clauses : 64 ( 64 unt; 0 nHn; 12 RR)
% Number of literals : 64 ( 0 equ; 6 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 79 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(implies(truth,A),A),
file('LCL153-1.p',unknown),
[] ).
cnf(2,plain,
equal(implies(implies(A,B),implies(implies(B,C),implies(A,C))),truth),
file('LCL153-1.p',unknown),
[] ).
cnf(3,plain,
equal(implies(implies(A,B),B),implies(implies(B,A),A)),
file('LCL153-1.p',unknown),
[] ).
cnf(4,plain,
equal(implies(implies(not(A),not(B)),implies(B,A)),truth),
file('LCL153-1.p',unknown),
[] ).
cnf(5,plain,
equal(or(A,B),implies(not(A),B)),
file('LCL153-1.p',unknown),
[] ).
cnf(6,plain,
equal(implies(not(A),B),or(A,B)),
inference(flip,[status(thm),theory(equality)],[5]),
[iquote('flip(5)')] ).
cnf(8,plain,
equal(or(A,B),or(B,A)),
file('LCL153-1.p',unknown),
[] ).
cnf(9,plain,
equal(not(or(not(A),not(B))),and(A,B)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(10,plain,
equal(and(and(A,B),C),and(A,and(B,C))),
file('LCL153-1.p',unknown),
[] ).
cnf(11,plain,
equal(and(A,B),and(B,A)),
file('LCL153-1.p',unknown),
[] ).
cnf(12,plain,
equal(xor(A,B),or(and(A,not(B)),and(not(A),B))),
file('LCL153-1.p',unknown),
[] ).
cnf(13,plain,
equal(or(and(A,not(B)),and(not(A),B)),xor(A,B)),
inference(flip,[status(thm),theory(equality)],[12]),
[iquote('flip(12)')] ).
cnf(14,plain,
equal(xor(A,B),xor(B,A)),
file('LCL153-1.p',unknown),
[] ).
cnf(16,plain,
equal(not(truth),falsehood),
file('LCL153-1.p',unknown),
[] ).
cnf(17,plain,
~ equal(not(x),xor(x,truth)),
file('LCL153-1.p',unknown),
[] ).
cnf(18,plain,
equal(implies(A,implies(implies(A,B),B)),truth),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,2]),1]),
[iquote('para(1,2),demod([1])')] ).
cnf(25,plain,
equal(or(truth,A),implies(falsehood,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,6]),1]),
[iquote('para(16,6),flip(1)')] ).
cnf(32,plain,
equal(implies(implies(not(A),falsehood),A),truth),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,4]),16]),
[iquote('para(1,4),demod([16])')] ).
cnf(42,plain,
equal(or(A,truth),implies(falsehood,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[25,8]),1]),
[iquote('para(25,8),flip(1)')] ).
cnf(50,plain,
equal(implies(A,A),truth),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,18]),1]),
[iquote('para(1,18),demod([1])')] ).
cnf(52,plain,
equal(or(A,not(A)),truth),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[50,6]),1]),
[iquote('para(50,6),flip(1)')] ).
cnf(57,plain,
equal(or(A,B),implies(not(B),A)),
inference(para,[status(thm),theory(equality)],[8,5]),
[iquote('para(8,5)')] ).
cnf(62,plain,
equal(implies(not(not(A)),A),truth),
inference(para,[status(thm),theory(equality)],[57,52]),
[iquote('para(57,52)')] ).
cnf(65,plain,
equal(not(implies(not(not(A)),not(B))),and(A,B)),
inference(para,[status(thm),theory(equality)],[5,9]),
[iquote('para(5,9)')] ).
cnf(67,plain,
equal(not(or(falsehood,not(A))),and(truth,A)),
inference(para,[status(thm),theory(equality)],[16,9]),
[iquote('para(16,9)')] ).
cnf(69,plain,
equal(not(or(falsehood,falsehood)),and(truth,truth)),
inference(para,[status(thm),theory(equality)],[16,67]),
[iquote('para(16,67)')] ).
cnf(72,plain,
equal(implies(not(A),truth),implies(falsehood,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[42,5]),1]),
[iquote('para(42,5),flip(1)')] ).
cnf(74,plain,
equal(not(falsehood),truth),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[62,32]),1]),
[iquote('para(62,32),demod([1])')] ).
cnf(78,plain,
equal(or(falsehood,A),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[74,6]),1]),1]),
[iquote('para(74,6),demod([1]),flip(1)')] ).
cnf(79,plain,
equal(and(truth,truth),truth),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[69]),78,74]),1]),
[iquote('back_demod(69),demod([78,74]),flip(1)')] ).
cnf(80,plain,
equal(not(not(A)),and(truth,A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[67]),78]),
[iquote('back_demod(67),demod([78])')] ).
cnf(81,plain,
equal(not(implies(and(truth,A),not(B))),and(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[65]),80]),
[iquote('back_demod(65),demod([80])')] ).
cnf(82,plain,
equal(implies(and(truth,A),A),truth),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[62]),80]),
[iquote('back_demod(62),demod([80])')] ).
cnf(85,plain,
equal(and(truth,falsehood),falsehood),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[74,80]),16]),1]),
[iquote('para(74,80),demod([16]),flip(1)')] ).
cnf(87,plain,
equal(implies(not(and(A,not(B))),and(not(A),B)),xor(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,5]),1]),
[iquote('para(13,5),flip(1)')] ).
cnf(103,plain,
equal(xor(A,B),or(and(B,not(A)),and(not(B),A))),
inference(para,[status(thm),theory(equality)],[14,12]),
[iquote('para(14,12)')] ).
cnf(104,plain,
equal(or(and(A,not(B)),and(not(A),B)),xor(B,A)),
inference(flip,[status(thm),theory(equality)],[103]),
[iquote('flip(103)')] ).
cnf(105,plain,
equal(implies(not(A),falsehood),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[78,57]),1]),
[iquote('para(78,57),flip(1)')] ).
cnf(106,plain,
equal(not(A),implies(and(truth,A),falsehood)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[80,105]),1]),
[iquote('para(80,105),flip(1)')] ).
cnf(107,plain,
equal(implies(implies(and(truth,A),falsehood),falsehood),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[105]),106]),
[iquote('back_demod(105),demod([106])')] ).
cnf(108,plain,
equal(xor(A,B),or(and(B,implies(and(truth,A),falsehood)),and(implies(and(truth,B),falsehood),A))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[104]),106,106]),1]),
[iquote('back_demod(104),demod([106,106]),flip(1)')] ).
cnf(122,plain,
equal(or(and(A,implies(and(truth,B),falsehood)),and(implies(and(truth,A),falsehood),B)),implies(implies(and(truth,and(B,implies(and(truth,A),falsehood))),falsehood),and(implies(and(truth,B),falsehood),A))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[87]),106,106,106,108]),1]),
[iquote('back_demod(87),demod([106,106,106,108]),flip(1)')] ).
cnf(129,plain,
equal(xor(A,B),implies(implies(and(truth,and(A,implies(and(truth,B),falsehood))),falsehood),and(implies(and(truth,A),falsehood),B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[108]),122]),
[iquote('back_demod(108),demod([122])')] ).
cnf(130,plain,
~ equal(implies(implies(and(truth,and(x,falsehood)),falsehood),and(implies(and(truth,x),falsehood),truth)),implies(and(truth,x),falsehood)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[17]),106,129,79,1]),1]),
[iquote('back_demod(17),demod([106,129,79,1]),flip(1)')] ).
cnf(133,plain,
equal(implies(and(truth,implies(and(truth,A),implies(and(truth,B),falsehood))),falsehood),and(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[81]),106,106]),
[iquote('back_demod(81),demod([106,106])')] ).
cnf(135,plain,
equal(implies(implies(and(truth,A),falsehood),truth),implies(falsehood,A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[72]),106]),
[iquote('back_demod(72),demod([106])')] ).
cnf(194,plain,
equal(implies(A,implies(implies(B,A),A)),truth),
inference(para,[status(thm),theory(equality)],[3,18]),
[iquote('para(3,18)')] ).
cnf(199,plain,
equal(implies(A,truth),truth),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,194]),50]),
[iquote('para(1,194),demod([50])')] ).
cnf(202,plain,
equal(implies(falsehood,A),truth),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[135]),199]),1]),
[iquote('back_demod(135),demod([199]),flip(1)')] ).
cnf(227,plain,
equal(implies(implies(and(A,truth),falsehood),falsehood),A),
inference(para,[status(thm),theory(equality)],[11,107]),
[iquote('para(11,107)')] ).
cnf(252,plain,
equal(and(truth,and(falsehood,A)),and(falsehood,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[85,10]),1]),
[iquote('para(85,10),flip(1)')] ).
cnf(254,plain,
equal(and(truth,and(A,falsehood)),and(falsehood,A)),
inference(para,[status(thm),theory(equality)],[11,252]),
[iquote('para(11,252)')] ).
cnf(255,plain,
~ equal(implies(implies(and(falsehood,x),falsehood),and(implies(and(truth,x),falsehood),truth)),implies(and(truth,x),falsehood)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[130]),254]),
[iquote('back_demod(130),demod([254])')] ).
cnf(272,plain,
equal(implies(and(falsehood,A),and(A,falsehood)),truth),
inference(para,[status(thm),theory(equality)],[254,82]),
[iquote('para(254,82)')] ).
cnf(316,plain,
equal(implies(implies(A,falsehood),falsehood),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[202,3]),1]),1]),
[iquote('para(202,3),demod([1]),flip(1)')] ).
cnf(317,plain,
equal(and(A,truth),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[227]),316]),
[iquote('back_demod(227),demod([316])')] ).
cnf(318,plain,
~ equal(implies(implies(and(falsehood,x),falsehood),implies(and(truth,x),falsehood)),implies(and(truth,x),falsehood)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[255]),317]),
[iquote('back_demod(255),demod([317])')] ).
cnf(319,plain,
equal(and(truth,A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[107]),316]),
[iquote('back_demod(107),demod([316])')] ).
cnf(320,plain,
~ equal(implies(implies(and(falsehood,x),falsehood),implies(x,falsehood)),implies(x,falsehood)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[318]),319,319]),
[iquote('back_demod(318),demod([319,319])')] ).
cnf(352,plain,
equal(implies(implies(A,implies(B,falsehood)),falsehood),and(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[133]),319,319,319]),
[iquote('back_demod(133),demod([319,319,319])')] ).
cnf(361,plain,
equal(and(A,falsehood),falsehood),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[50,352]),199,1]),1]),
[iquote('para(50,352),demod([199,1]),flip(1)')] ).
cnf(362,plain,
equal(implies(and(falsehood,A),falsehood),truth),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[272]),361]),
[iquote('back_demod(272),demod([361])')] ).
cnf(363,plain,
~ equal(implies(x,falsehood),implies(x,falsehood)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[320]),362,1]),
[iquote('back_demod(320),demod([362,1])')] ).
cnf(364,plain,
$false,
inference(conflict,[status(thm)],[363]),
[iquote('xx_conflict(363)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL153-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.12/0.34 % Computer : n011.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 3 21:11:21 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.73/1.14 ----- EQP 0.9e, May 2009 -----
% 0.73/1.14 The job began on n011.cluster.edu, Sun Jul 3 21:11:21 2022
% 0.73/1.14 The command was "./eqp09e".
% 0.73/1.14
% 0.73/1.14 set(prolog_style_variables).
% 0.73/1.14 set(lrpo).
% 0.73/1.14 set(basic_paramod).
% 0.73/1.14 set(functional_subsume).
% 0.73/1.14 set(ordered_paramod).
% 0.73/1.14 set(prime_paramod).
% 0.73/1.14 set(para_pairs).
% 0.73/1.14 assign(pick_given_ratio,4).
% 0.73/1.14 clear(print_kept).
% 0.73/1.14 clear(print_new_demod).
% 0.73/1.14 clear(print_back_demod).
% 0.73/1.14 clear(print_given).
% 0.73/1.14 assign(max_mem,64000).
% 0.73/1.14 end_of_commands.
% 0.73/1.14
% 0.73/1.14 Usable:
% 0.73/1.14 end_of_list.
% 0.73/1.14
% 0.73/1.14 Sos:
% 0.73/1.14 0 (wt=-1) [] implies(truth,A) = A.
% 0.73/1.14 0 (wt=-1) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.73/1.14 0 (wt=-1) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.73/1.14 0 (wt=-1) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.73/1.14 0 (wt=-1) [] or(A,B) = implies(not(A),B).
% 0.73/1.14 0 (wt=-1) [] or(or(A,B),C) = or(A,or(B,C)).
% 0.73/1.14 0 (wt=-1) [] or(A,B) = or(B,A).
% 0.73/1.14 0 (wt=-1) [] and(A,B) = not(or(not(A),not(B))).
% 0.73/1.14 0 (wt=-1) [] and(and(A,B),C) = and(A,and(B,C)).
% 0.73/1.14 0 (wt=-1) [] and(A,B) = and(B,A).
% 0.73/1.14 0 (wt=-1) [] xor(A,B) = or(and(A,not(B)),and(not(A),B)).
% 0.73/1.14 0 (wt=-1) [] xor(A,B) = xor(B,A).
% 0.73/1.14 0 (wt=-1) [] and_star(A,B) = not(or(not(A),not(B))).
% 0.73/1.14 0 (wt=-1) [] and_star(and_star(A,B),C) = and_star(A,and_star(B,C)).
% 0.73/1.14 0 (wt=-1) [] and_star(A,B) = and_star(B,A).
% 0.73/1.14 0 (wt=-1) [] not(truth) = falsehood.
% 0.73/1.14 0 (wt=-1) [] -(not(x) = xor(x,truth)).
% 0.73/1.14 end_of_list.
% 0.73/1.14
% 0.73/1.14 Demodulators:
% 0.73/1.14 end_of_list.
% 0.73/1.14
% 0.73/1.14 Passive:
% 0.73/1.14 end_of_list.
% 0.73/1.14
% 0.73/1.14 Starting to process input.
% 0.73/1.14
% 0.73/1.14 ** KEPT: 1 (wt=5) [] implies(truth,A) = A.
% 0.73/1.14 1 is a new demodulator.
% 0.73/1.14
% 0.73/1.14 ** KEPT: 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.73/1.14 2 is a new demodulator.
% 0.73/1.14
% 0.73/1.14 ** KEPT: 3 (wt=11) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.73/1.14 clause forward subsumed: 0 (wt=11) [flip(3)] implies(implies(B,A),A) = implies(implies(A,B),B).
% 0.73/1.14
% 0.73/1.14 ** KEPT: 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.73/1.14 4 is a new demodulator.
% 0.73/1.14
% 0.73/1.14 ** KEPT: 5 (wt=8) [] or(A,B) = implies(not(A),B).
% 0.73/1.14
% 0.73/1.14 ** KEPT: 6 (wt=8) [flip(5)] implies(not(A),B) = or(A,B).
% 0.73/1.14 clause forward subsumed: 0 (wt=8) [flip(6)] or(A,B) = implies(not(A),B).
% 0.73/1.14
% 0.73/1.14 ** KEPT: 7 (wt=11) [] or(or(A,B),C) = or(A,or(B,C)).
% 0.73/1.14 7 is a new demodulator.
% 0.73/1.14
% 0.73/1.14 ** KEPT: 8 (wt=7) [] or(A,B) = or(B,A).
% 0.73/1.14 clause forward subsumed: 0 (wt=7) [flip(8)] or(B,A) = or(A,B).
% 0.73/1.14
% 0.73/1.14 ** KEPT: 9 (wt=10) [flip(1)] not(or(not(A),not(B))) = and(A,B).
% 0.73/1.14 9 is a new demodulator.
% 0.73/1.14
% 0.73/1.14 ** KEPT: 10 (wt=11) [] and(and(A,B),C) = and(A,and(B,C)).
% 0.73/1.14 10 is a new demodulator.
% 0.73/1.14
% 0.73/1.14 ** KEPT: 11 (wt=7) [] and(A,B) = and(B,A).
% 0.73/1.14 clause forward subsumed: 0 (wt=7) [flip(11)] and(B,A) = and(A,B).
% 0.73/1.14
% 0.73/1.14 ** KEPT: 12 (wt=13) [] xor(A,B) = or(and(A,not(B)),and(not(A),B)).
% 0.73/1.14
% 0.73/1.14 ** KEPT: 13 (wt=13) [flip(12)] or(and(A,not(B)),and(not(A),B)) = xor(A,B).
% 0.73/1.14 clause forward subsumed: 0 (wt=13) [flip(13)] xor(A,B) = or(and(A,not(B)),and(not(A),B)).
% 0.73/1.14
% 0.73/1.14 ** KEPT: 14 (wt=7) [] xor(A,B) = xor(B,A).
% 0.73/1.14 clause forward subsumed: 0 (wt=7) [flip(14)] xor(B,A) = xor(A,B).
% 0.73/1.14
% 0.73/1.14 ** KEPT: 15 (wt=7) [demod([9])] and_star(A,B) = and(A,B).
% 0.73/1.14 15 is a new demodulator.
% 0.73/1.14 clause forward subsumed: 0 (wt=11) [demod([15,15,10,15,15])] and(A,and(B,C)) = and(A,and(B,C)).
% 0.73/1.14 clause forward subsumed: 0 (wt=7) [demod([15,15])] and(A,B) = and(B,A).
% 0.73/1.14
% 0.73/1.14 ** KEPT: 16 (wt=4) [] not(truth) = falsehood.
% 0.73/1.14 16 is a new demodulator.
% 0.73/1.14
% 0.73/1.14 ** KEPT: 17 (wt=6) [] -(not(x) = xor(x,truth)).
% 0.73/1.14 ---------------- PROOF FOUND ----------------
% 0.73/1.14 % SZS status Unsatisfiable
% 0.73/1.14
% 0.73/1.14
% 0.73/1.14 After processing input:
% 0.73/1.14
% 0.73/1.14 Usable:
% 0.73/1.14 end_of_list.
% 0.73/1.14
% 0.73/1.14 Sos:
% 0.73/1.14 16 (wt=4) [] not(truth) = falsehood.
% 0.73/1.14 1 (wt=5) [] implies(truth,A) = A.
% 0.73/1.14 17 (wt=6) [] -(not(x) = xor(x,truth)).
% 0.73/1.14 8 (wt=7) [] or(A,B) = or(B,A).
% 0.73/1.14 11 (wt=7) [] and(A,B) = and(B,A).
% 0.73/1.14 14 (wt=7) [] xor(A,B) = xor(B,A).
% 0.73/1.14 15 (wt=7) [demod([9])] and_star(A,B) = and(A,B).
% 0.73/1.14 5 (wt=8) [] or(A,B) = implies(not(A),B).
% 0.73/1.14 6 (wt=8) [flip(5)] implies(not(A),B) = or(A,B).
% 0.73/1.14 9 (wt=10) [flip(1)] not(or(not(A),not(B))) = and(A,B).
% 0.73/1.14 3 (wt=11) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.73/1.14 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.73/1.14 7 (wt=11) [] or(or(A,B),C) = or(A,or(B,C)).
% 0.73/1.14 10 (wt=11) [] and(and(A,B),C) = and(A,and(B,C)).
% 0.73/1.14 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.73/1.14 12 (wt=13) [] xor(A,B) = or(and(A,not(B)),and(not(A),B)).
% 0.73/1.14 13 (wt=13) [flip(12)] or(and(A,not(B)),and(not(A),B)) = xor(A,B).
% 0.73/1.14 end_of_list.
% 0.73/1.14
% 0.73/1.14 Demodulators:
% 0.73/1.14 1 (wt=5) [] implies(truth,A) = A.
% 0.73/1.14 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.73/1.14 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.73/1.14 7 (wt=11) [] or(or(A,B),C) = or(A,or(B,C)).
% 0.73/1.14 9 (wt=10) [flip(1)] not(or(not(A),not(B))) = and(A,B).
% 0.73/1.14 10 (wt=11) [] and(and(A,B),C) = and(A,and(B,C)).
% 0.73/1.14 15 (wt=7) [demod([9])] and_star(A,B) = and(A,B).
% 0.73/1.14 16 (wt=4) [] not(truth) = falsehood.
% 0.73/1.14 end_of_list.
% 0.73/1.14
% 0.73/1.14 Passive:
% 0.73/1.14 end_of_list.
% 0.73/1.14
% 0.73/1.14 UNIT CONFLICT from 363 and x=x at 0.03 seconds.
% 0.73/1.14
% 0.73/1.14 ---------------- PROOF ----------------
% 0.73/1.14 % SZS output start Refutation
% See solution above
% 0.73/1.14 ------------ end of proof -------------
% 0.73/1.14
% 0.73/1.14
% 0.73/1.14 ------------- memory usage ------------
% 0.73/1.14 Memory dynamically allocated (tp_alloc): 976.
% 0.73/1.14 type (bytes each) gets frees in use avail bytes
% 0.73/1.14 sym_ent ( 96) 60 0 60 0 5.6 K
% 0.73/1.14 term ( 16) 29231 21862 7369 39 143.3 K
% 0.73/1.14 gen_ptr ( 8) 41999 8997 33002 63 258.3 K
% 0.73/1.14 context ( 808) 22210 22208 2 3 3.9 K
% 0.73/1.14 trail ( 12) 2584 2584 0 6 0.1 K
% 0.73/1.14 bt_node ( 68) 6457 6454 3 14 1.1 K
% 0.73/1.14 ac_position (285432) 0 0 0 0 0.0 K
% 0.73/1.14 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.73/1.14 ac_match_free_vars_pos (4020)
% 0.73/1.14 0 0 0 0 0.0 K
% 0.73/1.14 discrim ( 12) 7190 3394 3796 511 50.5 K
% 0.73/1.14 flat ( 40) 57452 57452 0 59 2.3 K
% 0.73/1.14 discrim_pos ( 12) 1518 1518 0 1 0.0 K
% 0.73/1.14 fpa_head ( 12) 2398 0 2398 0 28.1 K
% 0.73/1.14 fpa_tree ( 28) 1659 1659 0 39 1.1 K
% 0.73/1.14 fpa_pos ( 36) 617 617 0 1 0.0 K
% 0.73/1.14 literal ( 12) 1412 1049 363 0 4.3 K
% 0.73/1.14 clause ( 24) 1412 1049 363 0 8.5 K
% 0.73/1.14 list ( 12) 314 256 58 2 0.7 K
% 0.73/1.14 list_pos ( 20) 1804 985 819 32 16.6 K
% 0.73/1.14 pair_index ( 40) 2 0 2 0 0.1 K
% 0.73/1.14
% 0.73/1.14 -------------- statistics -------------
% 0.73/1.14 Clauses input 17
% 0.73/1.14 Usable input 0
% 0.73/1.14 Sos input 17
% 0.73/1.14 Demodulators input 0
% 0.73/1.14 Passive input 0
% 0.73/1.14
% 0.73/1.14 Processed BS (before search) 25
% 0.73/1.14 Forward subsumed BS 8
% 0.73/1.14 Kept BS 17
% 0.73/1.14 New demodulators BS 8
% 0.73/1.14 Back demodulated BS 0
% 0.73/1.14
% 0.73/1.14 Clauses or pairs given 1003
% 0.73/1.14 Clauses generated 904
% 0.73/1.14 Forward subsumed 558
% 0.73/1.14 Deleted by weight 0
% 0.73/1.14 Deleted by variable count 0
% 0.73/1.14 Kept 346
% 0.73/1.14 New demodulators 247
% 0.73/1.14 Back demodulated 200
% 0.73/1.14 Ordered paramod prunes 0
% 0.73/1.14 Basic paramod prunes 1269
% 0.73/1.14 Prime paramod prunes 49
% 0.73/1.14 Semantic prunes 0
% 0.73/1.14
% 0.73/1.14 Rewrite attmepts 12560
% 0.73/1.14 Rewrites 1355
% 0.73/1.14
% 0.73/1.14 FPA overloads 0
% 0.73/1.14 FPA underloads 0
% 0.73/1.14
% 0.73/1.14 Usable size 0
% 0.73/1.14 Sos size 162
% 0.73/1.14 Demodulators size 133
% 0.73/1.14 Passive size 0
% 0.73/1.14 Disabled size 200
% 0.73/1.14
% 0.73/1.14 Proofs found 1
% 0.73/1.14
% 0.73/1.14 ----------- times (seconds) ----------- Sun Jul 3 21:11:21 2022
% 0.73/1.14
% 0.73/1.14 user CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.73/1.14 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.73/1.14 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.73/1.14 input time 0.00
% 0.73/1.14 paramodulation time 0.01
% 0.73/1.14 demodulation time 0.01
% 0.73/1.14 orient time 0.00
% 0.73/1.14 weigh time 0.00
% 0.73/1.14 forward subsume time 0.00
% 0.73/1.14 back demod find time 0.00
% 0.73/1.14 conflict time 0.00
% 0.73/1.14 LRPO time 0.00
% 0.73/1.14 store clause time 0.00
% 0.73/1.14 disable clause time 0.00
% 0.73/1.14 prime paramod time 0.00
% 0.73/1.14 semantics time 0.00
% 0.73/1.14
% 0.73/1.14 EQP interrupted
%------------------------------------------------------------------------------