TSTP Solution File: LCL158-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : LCL158-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n021.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:22 EDT 2022
% Result : Unsatisfiable 0.79s 1.17s
% Output : Refutation 0.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 11
% Syntax : Number of clauses : 59 ( 59 unt; 0 nHn; 11 RR)
% Number of literals : 59 ( 0 equ; 6 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 76 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(implies(truth,A),A),
file('LCL158-1.p',unknown),
[] ).
cnf(2,plain,
equal(implies(implies(A,B),implies(implies(B,C),implies(A,C))),truth),
file('LCL158-1.p',unknown),
[] ).
cnf(3,plain,
equal(implies(implies(A,B),B),implies(implies(B,A),A)),
file('LCL158-1.p',unknown),
[] ).
cnf(4,plain,
equal(implies(implies(not(A),not(B)),implies(B,A)),truth),
file('LCL158-1.p',unknown),
[] ).
cnf(5,plain,
equal(or(A,B),implies(not(A),B)),
file('LCL158-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('LCL158-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('LCL158-1.p',unknown),
[] ).
cnf(11,plain,
equal(and(A,B),and(B,A)),
file('LCL158-1.p',unknown),
[] ).
cnf(12,plain,
equal(xor(A,B),or(and(A,not(B)),and(not(A),B))),
file('LCL158-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('LCL158-1.p',unknown),
[] ).
cnf(15,plain,
equal(and_star(A,B),and(A,B)),
inference(demod,[status(thm),theory(equality)],[9]),
[iquote('demod([9])')] ).
cnf(16,plain,
equal(not(truth),falsehood),
file('LCL158-1.p',unknown),
[] ).
cnf(17,plain,
~ equal(and(xor(truth,x),x),falsehood),
inference(demod,[status(thm),theory(equality)],[15]),
[iquote('demod([15])')] ).
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(51,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(53,plain,
equal(or(A,not(A)),truth),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[51,6]),1]),
[iquote('para(51,6),flip(1)')] ).
cnf(58,plain,
equal(or(A,B),implies(not(B),A)),
inference(para,[status(thm),theory(equality)],[8,5]),
[iquote('para(8,5)')] ).
cnf(63,plain,
equal(implies(not(not(A)),A),truth),
inference(para,[status(thm),theory(equality)],[58,53]),
[iquote('para(58,53)')] ).
cnf(66,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(70,plain,
equal(not(or(falsehood,not(A))),and(truth,A)),
inference(para,[status(thm),theory(equality)],[16,9]),
[iquote('para(16,9)')] ).
cnf(72,plain,
equal(not(or(falsehood,falsehood)),and(truth,truth)),
inference(para,[status(thm),theory(equality)],[16,70]),
[iquote('para(16,70)')] ).
cnf(73,plain,
equal(implies(not(A),truth),implies(falsehood,A)),
inference(para,[status(thm),theory(equality)],[58,25]),
[iquote('para(58,25)')] ).
cnf(78,plain,
equal(not(falsehood),truth),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[63,32]),1]),
[iquote('para(63,32),demod([1])')] ).
cnf(79,plain,
equal(or(falsehood,A),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[78,6]),1]),1]),
[iquote('para(78,6),demod([1]),flip(1)')] ).
cnf(80,plain,
equal(and(truth,truth),truth),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[72]),79,78]),1]),
[iquote('back_demod(72),demod([79,78]),flip(1)')] ).
cnf(81,plain,
equal(not(not(A)),and(truth,A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[70]),79]),
[iquote('back_demod(70),demod([79])')] ).
cnf(82,plain,
equal(not(implies(and(truth,A),not(B))),and(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[66]),81]),
[iquote('back_demod(66),demod([81])')] ).
cnf(88,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(104,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(105,plain,
equal(or(and(A,not(B)),and(not(A),B)),xor(B,A)),
inference(flip,[status(thm),theory(equality)],[104]),
[iquote('flip(104)')] ).
cnf(106,plain,
equal(implies(not(A),falsehood),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[79,58]),1]),
[iquote('para(79,58),flip(1)')] ).
cnf(108,plain,
equal(not(A),implies(and(truth,A),falsehood)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[81,106]),1]),
[iquote('para(81,106),flip(1)')] ).
cnf(110,plain,
equal(implies(implies(and(truth,A),falsehood),falsehood),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[106]),108]),
[iquote('back_demod(106),demod([108])')] ).
cnf(111,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)],[105]),108,108]),1]),
[iquote('back_demod(105),demod([108,108]),flip(1)')] ).
cnf(125,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)],[88]),108,108,108,111]),1]),
[iquote('back_demod(88),demod([108,108,108,111]),flip(1)')] ).
cnf(132,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)],[111]),125]),
[iquote('back_demod(111),demod([125])')] ).
cnf(134,plain,
~ equal(and(implies(implies(and(truth,and(truth,implies(and(truth,x),falsehood))),falsehood),and(falsehood,x)),x),falsehood),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[17]),132,80,1]),
[iquote('back_demod(17),demod([132,80,1])')] ).
cnf(137,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)],[82]),108,108]),
[iquote('back_demod(82),demod([108,108])')] ).
cnf(138,plain,
equal(implies(and(truth,implies(and(truth,A),falsehood)),falsehood),and(truth,A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[81]),108,108]),
[iquote('back_demod(81),demod([108,108])')] ).
cnf(139,plain,
equal(implies(implies(and(truth,A),falsehood),truth),implies(falsehood,A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[73]),108]),
[iquote('back_demod(73),demod([108])')] ).
cnf(198,plain,
equal(implies(A,implies(implies(B,A),A)),truth),
inference(para,[status(thm),theory(equality)],[3,18]),
[iquote('para(3,18)')] ).
cnf(203,plain,
equal(implies(A,truth),truth),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,198]),51]),
[iquote('para(1,198),demod([51])')] ).
cnf(206,plain,
equal(implies(falsehood,A),truth),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[139]),203]),1]),
[iquote('back_demod(139),demod([203]),flip(1)')] ).
cnf(241,plain,
equal(and(truth,and(truth,A)),and(truth,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[80,10]),1]),
[iquote('para(80,10),flip(1)')] ).
cnf(242,plain,
~ equal(and(implies(and(truth,x),and(falsehood,x)),x),falsehood),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[134]),241,138]),
[iquote('back_demod(134),demod([241,138])')] ).
cnf(321,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)],[206,3]),1]),1]),
[iquote('para(206,3),demod([1]),flip(1)')] ).
cnf(324,plain,
equal(and(truth,A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[110]),321]),
[iquote('back_demod(110),demod([321])')] ).
cnf(326,plain,
~ equal(and(implies(x,and(falsehood,x)),x),falsehood),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[242]),324]),
[iquote('back_demod(242),demod([324])')] ).
cnf(358,plain,
equal(implies(implies(A,implies(B,falsehood)),falsehood),and(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[137]),324,324,324]),
[iquote('back_demod(137),demod([324,324,324])')] ).
cnf(365,plain,
~ equal(and(implies(x,and(x,falsehood)),x),falsehood),
inference(para,[status(thm),theory(equality)],[11,326]),
[iquote('para(11,326)')] ).
cnf(368,plain,
equal(and(A,falsehood),falsehood),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[51,358]),203,1]),1]),
[iquote('para(51,358),demod([203,1]),flip(1)')] ).
cnf(369,plain,
~ equal(and(implies(x,falsehood),x),falsehood),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[365]),368]),
[iquote('back_demod(365),demod([368])')] ).
cnf(371,plain,
equal(and(implies(A,falsehood),A),falsehood),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[51,358]),1]),1]),
[iquote('para(51,358),demod([1]),flip(1)')] ).
cnf(372,plain,
$false,
inference(conflict,[status(thm)],[371,369]),
[iquote('conflict(371,369)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : LCL158-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.14 % Command : tptp2X_and_run_eqp %s
% 0.14/0.35 % Computer : n021.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jul 2 19:31:45 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.79/1.17 ----- EQP 0.9e, May 2009 -----
% 0.79/1.17 The job began on n021.cluster.edu, Sat Jul 2 19:31:46 2022
% 0.79/1.17 The command was "./eqp09e".
% 0.79/1.17
% 0.79/1.17 set(prolog_style_variables).
% 0.79/1.17 set(lrpo).
% 0.79/1.17 set(basic_paramod).
% 0.79/1.17 set(functional_subsume).
% 0.79/1.17 set(ordered_paramod).
% 0.79/1.17 set(prime_paramod).
% 0.79/1.17 set(para_pairs).
% 0.79/1.17 assign(pick_given_ratio,4).
% 0.79/1.17 clear(print_kept).
% 0.79/1.17 clear(print_new_demod).
% 0.79/1.17 clear(print_back_demod).
% 0.79/1.17 clear(print_given).
% 0.79/1.17 assign(max_mem,64000).
% 0.79/1.17 end_of_commands.
% 0.79/1.17
% 0.79/1.17 Usable:
% 0.79/1.17 end_of_list.
% 0.79/1.17
% 0.79/1.17 Sos:
% 0.79/1.17 0 (wt=-1) [] implies(truth,A) = A.
% 0.79/1.17 0 (wt=-1) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.79/1.17 0 (wt=-1) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.79/1.17 0 (wt=-1) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.79/1.17 0 (wt=-1) [] or(A,B) = implies(not(A),B).
% 0.79/1.17 0 (wt=-1) [] or(or(A,B),C) = or(A,or(B,C)).
% 0.79/1.17 0 (wt=-1) [] or(A,B) = or(B,A).
% 0.79/1.17 0 (wt=-1) [] and(A,B) = not(or(not(A),not(B))).
% 0.79/1.17 0 (wt=-1) [] and(and(A,B),C) = and(A,and(B,C)).
% 0.79/1.17 0 (wt=-1) [] and(A,B) = and(B,A).
% 0.79/1.17 0 (wt=-1) [] xor(A,B) = or(and(A,not(B)),and(not(A),B)).
% 0.79/1.17 0 (wt=-1) [] xor(A,B) = xor(B,A).
% 0.79/1.17 0 (wt=-1) [] and_star(A,B) = not(or(not(A),not(B))).
% 0.79/1.17 0 (wt=-1) [] and_star(and_star(A,B),C) = and_star(A,and_star(B,C)).
% 0.79/1.17 0 (wt=-1) [] and_star(A,B) = and_star(B,A).
% 0.79/1.17 0 (wt=-1) [] not(truth) = falsehood.
% 0.79/1.17 0 (wt=-1) [] -(and_star(xor(truth,x),x) = falsehood).
% 0.79/1.17 end_of_list.
% 0.79/1.17
% 0.79/1.17 Demodulators:
% 0.79/1.17 end_of_list.
% 0.79/1.17
% 0.79/1.17 Passive:
% 0.79/1.17 end_of_list.
% 0.79/1.17
% 0.79/1.17 Starting to process input.
% 0.79/1.17
% 0.79/1.17 ** KEPT: 1 (wt=5) [] implies(truth,A) = A.
% 0.79/1.17 1 is a new demodulator.
% 0.79/1.17
% 0.79/1.17 ** KEPT: 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.79/1.17 2 is a new demodulator.
% 0.79/1.17
% 0.79/1.17 ** KEPT: 3 (wt=11) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.79/1.17 clause forward subsumed: 0 (wt=11) [flip(3)] implies(implies(B,A),A) = implies(implies(A,B),B).
% 0.79/1.17
% 0.79/1.17 ** KEPT: 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.79/1.17 4 is a new demodulator.
% 0.79/1.17
% 0.79/1.17 ** KEPT: 5 (wt=8) [] or(A,B) = implies(not(A),B).
% 0.79/1.17
% 0.79/1.17 ** KEPT: 6 (wt=8) [flip(5)] implies(not(A),B) = or(A,B).
% 0.79/1.17 clause forward subsumed: 0 (wt=8) [flip(6)] or(A,B) = implies(not(A),B).
% 0.79/1.17
% 0.79/1.17 ** KEPT: 7 (wt=11) [] or(or(A,B),C) = or(A,or(B,C)).
% 0.79/1.17 7 is a new demodulator.
% 0.79/1.17
% 0.79/1.17 ** KEPT: 8 (wt=7) [] or(A,B) = or(B,A).
% 0.79/1.17 clause forward subsumed: 0 (wt=7) [flip(8)] or(B,A) = or(A,B).
% 0.79/1.17
% 0.79/1.17 ** KEPT: 9 (wt=10) [flip(1)] not(or(not(A),not(B))) = and(A,B).
% 0.79/1.17 9 is a new demodulator.
% 0.79/1.17
% 0.79/1.17 ** KEPT: 10 (wt=11) [] and(and(A,B),C) = and(A,and(B,C)).
% 0.79/1.17 10 is a new demodulator.
% 0.79/1.17
% 0.79/1.17 ** KEPT: 11 (wt=7) [] and(A,B) = and(B,A).
% 0.79/1.17 clause forward subsumed: 0 (wt=7) [flip(11)] and(B,A) = and(A,B).
% 0.79/1.17
% 0.79/1.17 ** KEPT: 12 (wt=13) [] xor(A,B) = or(and(A,not(B)),and(not(A),B)).
% 0.79/1.17
% 0.79/1.17 ** KEPT: 13 (wt=13) [flip(12)] or(and(A,not(B)),and(not(A),B)) = xor(A,B).
% 0.79/1.17 clause forward subsumed: 0 (wt=13) [flip(13)] xor(A,B) = or(and(A,not(B)),and(not(A),B)).
% 0.79/1.17
% 0.79/1.17 ** KEPT: 14 (wt=7) [] xor(A,B) = xor(B,A).
% 0.79/1.17 clause forward subsumed: 0 (wt=7) [flip(14)] xor(B,A) = xor(A,B).
% 0.79/1.17
% 0.79/1.17 ** KEPT: 15 (wt=7) [demod([9])] and_star(A,B) = and(A,B).
% 0.79/1.17 15 is a new demodulator.
% 0.79/1.17 clause forward subsumed: 0 (wt=11) [demod([15,15,10,15,15])] and(A,and(B,C)) = and(A,and(B,C)).
% 0.79/1.17 clause forward subsumed: 0 (wt=7) [demod([15,15])] and(A,B) = and(B,A).
% 0.79/1.17
% 0.79/1.17 ** KEPT: 16 (wt=4) [] not(truth) = falsehood.
% 0.79/1.17 16 is a new demodulator.
% 0.79/1.17
% 0.79/1.17 ** KEPT: 17 (wt=7) [demod([15])] -(and(xor(truth,x),x) = falsehood).
% 0.79/1.17 ---------------- PROOF FOUND ----------------
% 0.79/1.17 % SZS status Unsatisfiable
% 0.79/1.17
% 0.79/1.17
% 0.79/1.17 After processing input:
% 0.79/1.17
% 0.79/1.17 Usable:
% 0.79/1.17 end_of_list.
% 0.79/1.17
% 0.79/1.17 Sos:
% 0.79/1.17 16 (wt=4) [] not(truth) = falsehood.
% 0.79/1.17 1 (wt=5) [] implies(truth,A) = A.
% 0.79/1.17 8 (wt=7) [] or(A,B) = or(B,A).
% 0.79/1.17 11 (wt=7) [] and(A,B) = and(B,A).
% 0.79/1.17 14 (wt=7) [] xor(A,B) = xor(B,A).
% 0.79/1.17 15 (wt=7) [demod([9])] and_star(A,B) = and(A,B).
% 0.79/1.17 17 (wt=7) [demod([15])] -(and(xor(truth,x),x) = falsehood).
% 0.79/1.17 5 (wt=8) [] or(A,B) = implies(not(A),B).
% 0.79/1.17 6 (wt=8) [flip(5)] implies(not(A),B) = or(A,B).
% 0.79/1.17 9 (wt=10) [flip(1)] not(or(not(A),not(B))) = and(A,B).
% 0.79/1.17 3 (wt=11) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.79/1.17 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.79/1.17 7 (wt=11) [] or(or(A,B),C) = or(A,or(B,C)).
% 0.79/1.17 10 (wt=11) [] and(and(A,B),C) = and(A,and(B,C)).
% 0.79/1.17 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.79/1.17 12 (wt=13) [] xor(A,B) = or(and(A,not(B)),and(not(A),B)).
% 0.79/1.17 13 (wt=13) [flip(12)] or(and(A,not(B)),and(not(A),B)) = xor(A,B).
% 0.79/1.17 end_of_list.
% 0.79/1.17
% 0.79/1.17 Demodulators:
% 0.79/1.17 1 (wt=5) [] implies(truth,A) = A.
% 0.79/1.17 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.79/1.17 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.79/1.17 7 (wt=11) [] or(or(A,B),C) = or(A,or(B,C)).
% 0.79/1.17 9 (wt=10) [flip(1)] not(or(not(A),not(B))) = and(A,B).
% 0.79/1.17 10 (wt=11) [] and(and(A,B),C) = and(A,and(B,C)).
% 0.79/1.17 15 (wt=7) [demod([9])] and_star(A,B) = and(A,B).
% 0.79/1.17 16 (wt=4) [] not(truth) = falsehood.
% 0.79/1.17 end_of_list.
% 0.79/1.17
% 0.79/1.17 Passive:
% 0.79/1.17 end_of_list.
% 0.79/1.17
% 0.79/1.17 UNIT CONFLICT from 371 and 369 at 0.03 seconds.
% 0.79/1.17
% 0.79/1.17 ---------------- PROOF ----------------
% 0.79/1.17 % SZS output start Refutation
% See solution above
% 0.79/1.17 ------------ end of proof -------------
% 0.79/1.17
% 0.79/1.17
% 0.79/1.17 ------------- memory usage ------------
% 0.79/1.17 Memory dynamically allocated (tp_alloc): 976.
% 0.79/1.17 type (bytes each) gets frees in use avail bytes
% 0.79/1.17 sym_ent ( 96) 60 0 60 0 5.6 K
% 0.79/1.17 term ( 16) 29516 22067 7449 39 144.8 K
% 0.79/1.17 gen_ptr ( 8) 42519 9137 33382 58 261.2 K
% 0.79/1.17 context ( 808) 22993 22991 2 3 3.9 K
% 0.79/1.17 trail ( 12) 2593 2593 0 6 0.1 K
% 0.79/1.17 bt_node ( 68) 6784 6781 3 14 1.1 K
% 0.79/1.17 ac_position (285432) 0 0 0 0 0.0 K
% 0.79/1.17 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.79/1.17 ac_match_free_vars_pos (4020)
% 0.79/1.17 0 0 0 0 0.0 K
% 0.79/1.17 discrim ( 12) 7239 3431 3808 505 50.5 K
% 0.79/1.17 flat ( 40) 58084 58084 0 59 2.3 K
% 0.79/1.17 discrim_pos ( 12) 1545 1545 0 1 0.0 K
% 0.79/1.17 fpa_head ( 12) 2453 0 2453 0 28.7 K
% 0.79/1.17 fpa_tree ( 28) 1552 1552 0 19 0.5 K
% 0.79/1.17 fpa_pos ( 36) 628 628 0 1 0.0 K
% 0.79/1.17 literal ( 12) 1438 1067 371 1 4.4 K
% 0.79/1.17 clause ( 24) 1438 1067 371 1 8.7 K
% 0.79/1.17 list ( 12) 316 260 56 4 0.7 K
% 0.79/1.17 list_pos ( 20) 1843 1012 831 28 16.8 K
% 0.79/1.17 pair_index ( 40) 2 0 2 0 0.1 K
% 0.79/1.17
% 0.79/1.17 -------------- statistics -------------
% 0.79/1.17 Clauses input 17
% 0.79/1.17 Usable input 0
% 0.79/1.17 Sos input 17
% 0.79/1.17 Demodulators input 0
% 0.79/1.17 Passive input 0
% 0.79/1.17
% 0.79/1.17 Processed BS (before search) 25
% 0.79/1.17 Forward subsumed BS 8
% 0.79/1.17 Kept BS 17
% 0.79/1.17 New demodulators BS 8
% 0.79/1.17 Back demodulated BS 0
% 0.79/1.17
% 0.79/1.17 Clauses or pairs given 1056
% 0.79/1.17 Clauses generated 922
% 0.79/1.17 Forward subsumed 568
% 0.79/1.17 Deleted by weight 0
% 0.79/1.17 Deleted by variable count 0
% 0.79/1.17 Kept 354
% 0.79/1.17 New demodulators 249
% 0.79/1.17 Back demodulated 206
% 0.79/1.17 Ordered paramod prunes 0
% 0.79/1.17 Basic paramod prunes 1337
% 0.79/1.17 Prime paramod prunes 49
% 0.79/1.17 Semantic prunes 0
% 0.79/1.17
% 0.79/1.17 Rewrite attmepts 12743
% 0.79/1.17 Rewrites 1374
% 0.79/1.17
% 0.79/1.17 FPA overloads 0
% 0.79/1.17 FPA underloads 0
% 0.79/1.17
% 0.79/1.17 Usable size 0
% 0.79/1.17 Sos size 164
% 0.79/1.17 Demodulators size 133
% 0.79/1.17 Passive size 0
% 0.79/1.17 Disabled size 206
% 0.79/1.17
% 0.79/1.17 Proofs found 1
% 0.79/1.17
% 0.79/1.17 ----------- times (seconds) ----------- Sat Jul 2 19:31:46 2022
% 0.79/1.17
% 0.79/1.17 user CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.79/1.17 system CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.79/1.17 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.79/1.17 input time 0.00
% 0.79/1.17 paramodulation time 0.00
% 0.79/1.17 demodulation time 0.00
% 0.79/1.17 orient time 0.01
% 0.79/1.17 weigh time 0.00
% 0.79/1.17 forward subsume time 0.00
% 0.79/1.17 back demod find time 0.00
% 0.79/1.17 conflict time 0.00
% 0.79/1.17 LRPO time 0.00
% 0.79/1.17 store clause time 0.01
% 0.79/1.17 disable clause time 0.00
% 0.79/1.17 prime paramod time 0.00
% 0.79/1.17 semantics time 0.00
% 0.79/1.17
% 0.79/1.17 EQP interrupted
%------------------------------------------------------------------------------