TSTP Solution File: LCL154-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : LCL154-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n013.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.77s 1.17s
% Output : Refutation 0.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 12
% Syntax : Number of clauses : 57 ( 57 unt; 0 nHn; 11 RR)
% Number of literals : 57 ( 0 equ; 5 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 : 73 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(implies(truth,A),A),
file('LCL154-1.p',unknown),
[] ).
cnf(2,plain,
equal(implies(implies(A,B),implies(implies(B,C),implies(A,C))),truth),
file('LCL154-1.p',unknown),
[] ).
cnf(3,plain,
equal(implies(implies(A,B),B),implies(implies(B,A),A)),
file('LCL154-1.p',unknown),
[] ).
cnf(4,plain,
equal(implies(implies(not(A),not(B)),implies(B,A)),truth),
file('LCL154-1.p',unknown),
[] ).
cnf(5,plain,
equal(or(A,B),implies(not(A),B)),
file('LCL154-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('LCL154-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('LCL154-1.p',unknown),
[] ).
cnf(11,plain,
equal(and(A,B),and(B,A)),
file('LCL154-1.p',unknown),
[] ).
cnf(12,plain,
equal(xor(A,B),or(and(A,not(B)),and(not(A),B))),
file('LCL154-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('LCL154-1.p',unknown),
[] ).
cnf(16,plain,
equal(not(truth),falsehood),
file('LCL154-1.p',unknown),
[] ).
cnf(17,plain,
~ equal(xor(x,falsehood),x),
file('LCL154-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(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(33,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(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(56,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(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(implies(not(not(A)),A),truth),
inference(para,[status(thm),theory(equality)],[58,56]),
[iquote('para(58,56)')] ).
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,33]),
[iquote('para(58,33)')] ).
cnf(78,plain,
equal(not(falsehood),truth),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[67,32]),1]),
[iquote('para(67,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(83,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]),81]),
[iquote('back_demod(65),demod([81])')] ).
cnf(86,plain,
equal(and(truth,falsehood),falsehood),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[78,81]),16]),1]),
[iquote('para(78,81),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(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(110,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(114,plain,
equal(implies(implies(and(truth,A),falsehood),falsehood),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[106]),110]),
[iquote('back_demod(106),demod([110])')] ).
cnf(115,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]),110,110]),1]),
[iquote('back_demod(105),demod([110,110]),flip(1)')] ).
cnf(130,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]),110,110,110,115]),1]),
[iquote('back_demod(87),demod([110,110,110,115]),flip(1)')] ).
cnf(137,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)],[115]),130]),
[iquote('back_demod(115),demod([130])')] ).
cnf(139,plain,
~ equal(implies(implies(and(truth,and(x,truth)),falsehood),and(implies(and(truth,x),falsehood),falsehood)),x),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[17]),137,86,51]),
[iquote('back_demod(17),demod([137,86,51])')] ).
cnf(142,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)],[83]),110,110]),
[iquote('back_demod(83),demod([110,110])')] ).
cnf(144,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]),110]),
[iquote('back_demod(73),demod([110])')] ).
cnf(203,plain,
equal(implies(A,implies(implies(B,A),A)),truth),
inference(para,[status(thm),theory(equality)],[3,18]),
[iquote('para(3,18)')] ).
cnf(211,plain,
equal(implies(A,truth),truth),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,203]),51]),
[iquote('para(1,203),demod([51])')] ).
cnf(214,plain,
equal(implies(falsehood,A),truth),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[144]),211]),1]),
[iquote('back_demod(144),demod([211]),flip(1)')] ).
cnf(244,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(248,plain,
equal(and(truth,and(A,truth)),and(truth,A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[244,11]),10]),1]),
[iquote('para(244,11),demod([10]),flip(1)')] ).
cnf(250,plain,
~ equal(implies(implies(and(truth,x),falsehood),and(implies(and(truth,x),falsehood),falsehood)),x),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[139]),248]),
[iquote('back_demod(139),demod([248])')] ).
cnf(325,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)],[214,3]),1]),1]),
[iquote('para(214,3),demod([1]),flip(1)')] ).
cnf(327,plain,
equal(and(truth,A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[114]),325]),
[iquote('back_demod(114),demod([325])')] ).
cnf(330,plain,
~ equal(implies(implies(x,falsehood),and(implies(x,falsehood),falsehood)),x),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[250]),327,327]),
[iquote('back_demod(250),demod([327,327])')] ).
cnf(362,plain,
equal(implies(implies(A,implies(B,falsehood)),falsehood),and(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[142]),327,327,327]),
[iquote('back_demod(142),demod([327,327,327])')] ).
cnf(373,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,362]),211,1]),1]),
[iquote('para(51,362),demod([211,1]),flip(1)')] ).
cnf(374,plain,
~ equal(x,x),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[330]),373,325]),
[iquote('back_demod(330),demod([373,325])')] ).
cnf(375,plain,
$false,
inference(conflict,[status(thm)],[374]),
[iquote('xx_conflict(374)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL154-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.14 % Command : tptp2X_and_run_eqp %s
% 0.13/0.35 % Computer : n013.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jul 3 12:06:59 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.77/1.17 ----- EQP 0.9e, May 2009 -----
% 0.77/1.17 The job began on n013.cluster.edu, Sun Jul 3 12:07:00 2022
% 0.77/1.17 The command was "./eqp09e".
% 0.77/1.17
% 0.77/1.17 set(prolog_style_variables).
% 0.77/1.17 set(lrpo).
% 0.77/1.17 set(basic_paramod).
% 0.77/1.17 set(functional_subsume).
% 0.77/1.17 set(ordered_paramod).
% 0.77/1.17 set(prime_paramod).
% 0.77/1.17 set(para_pairs).
% 0.77/1.17 assign(pick_given_ratio,4).
% 0.77/1.17 clear(print_kept).
% 0.77/1.17 clear(print_new_demod).
% 0.77/1.17 clear(print_back_demod).
% 0.77/1.17 clear(print_given).
% 0.77/1.17 assign(max_mem,64000).
% 0.77/1.17 end_of_commands.
% 0.77/1.17
% 0.77/1.17 Usable:
% 0.77/1.17 end_of_list.
% 0.77/1.17
% 0.77/1.17 Sos:
% 0.77/1.17 0 (wt=-1) [] implies(truth,A) = A.
% 0.77/1.17 0 (wt=-1) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.77/1.17 0 (wt=-1) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.77/1.17 0 (wt=-1) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.77/1.17 0 (wt=-1) [] or(A,B) = implies(not(A),B).
% 0.77/1.17 0 (wt=-1) [] or(or(A,B),C) = or(A,or(B,C)).
% 0.77/1.17 0 (wt=-1) [] or(A,B) = or(B,A).
% 0.77/1.17 0 (wt=-1) [] and(A,B) = not(or(not(A),not(B))).
% 0.77/1.17 0 (wt=-1) [] and(and(A,B),C) = and(A,and(B,C)).
% 0.77/1.17 0 (wt=-1) [] and(A,B) = and(B,A).
% 0.77/1.17 0 (wt=-1) [] xor(A,B) = or(and(A,not(B)),and(not(A),B)).
% 0.77/1.17 0 (wt=-1) [] xor(A,B) = xor(B,A).
% 0.77/1.17 0 (wt=-1) [] and_star(A,B) = not(or(not(A),not(B))).
% 0.77/1.17 0 (wt=-1) [] and_star(and_star(A,B),C) = and_star(A,and_star(B,C)).
% 0.77/1.17 0 (wt=-1) [] and_star(A,B) = and_star(B,A).
% 0.77/1.17 0 (wt=-1) [] not(truth) = falsehood.
% 0.77/1.17 0 (wt=-1) [] -(xor(x,falsehood) = x).
% 0.77/1.17 end_of_list.
% 0.77/1.17
% 0.77/1.17 Demodulators:
% 0.77/1.17 end_of_list.
% 0.77/1.17
% 0.77/1.17 Passive:
% 0.77/1.17 end_of_list.
% 0.77/1.17
% 0.77/1.17 Starting to process input.
% 0.77/1.17
% 0.77/1.17 ** KEPT: 1 (wt=5) [] implies(truth,A) = A.
% 0.77/1.17 1 is a new demodulator.
% 0.77/1.17
% 0.77/1.17 ** KEPT: 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.77/1.17 2 is a new demodulator.
% 0.77/1.17
% 0.77/1.17 ** KEPT: 3 (wt=11) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.77/1.17 clause forward subsumed: 0 (wt=11) [flip(3)] implies(implies(B,A),A) = implies(implies(A,B),B).
% 0.77/1.17
% 0.77/1.17 ** KEPT: 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.77/1.17 4 is a new demodulator.
% 0.77/1.17
% 0.77/1.17 ** KEPT: 5 (wt=8) [] or(A,B) = implies(not(A),B).
% 0.77/1.17
% 0.77/1.17 ** KEPT: 6 (wt=8) [flip(5)] implies(not(A),B) = or(A,B).
% 0.77/1.17 clause forward subsumed: 0 (wt=8) [flip(6)] or(A,B) = implies(not(A),B).
% 0.77/1.17
% 0.77/1.17 ** KEPT: 7 (wt=11) [] or(or(A,B),C) = or(A,or(B,C)).
% 0.77/1.17 7 is a new demodulator.
% 0.77/1.17
% 0.77/1.17 ** KEPT: 8 (wt=7) [] or(A,B) = or(B,A).
% 0.77/1.17 clause forward subsumed: 0 (wt=7) [flip(8)] or(B,A) = or(A,B).
% 0.77/1.17
% 0.77/1.17 ** KEPT: 9 (wt=10) [flip(1)] not(or(not(A),not(B))) = and(A,B).
% 0.77/1.17 9 is a new demodulator.
% 0.77/1.17
% 0.77/1.17 ** KEPT: 10 (wt=11) [] and(and(A,B),C) = and(A,and(B,C)).
% 0.77/1.17 10 is a new demodulator.
% 0.77/1.17
% 0.77/1.17 ** KEPT: 11 (wt=7) [] and(A,B) = and(B,A).
% 0.77/1.17 clause forward subsumed: 0 (wt=7) [flip(11)] and(B,A) = and(A,B).
% 0.77/1.17
% 0.77/1.17 ** KEPT: 12 (wt=13) [] xor(A,B) = or(and(A,not(B)),and(not(A),B)).
% 0.77/1.17
% 0.77/1.17 ** KEPT: 13 (wt=13) [flip(12)] or(and(A,not(B)),and(not(A),B)) = xor(A,B).
% 0.77/1.17 clause forward subsumed: 0 (wt=13) [flip(13)] xor(A,B) = or(and(A,not(B)),and(not(A),B)).
% 0.77/1.17
% 0.77/1.17 ** KEPT: 14 (wt=7) [] xor(A,B) = xor(B,A).
% 0.77/1.17 clause forward subsumed: 0 (wt=7) [flip(14)] xor(B,A) = xor(A,B).
% 0.77/1.17
% 0.77/1.17 ** KEPT: 15 (wt=7) [demod([9])] and_star(A,B) = and(A,B).
% 0.77/1.17 15 is a new demodulator.
% 0.77/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.77/1.17 clause forward subsumed: 0 (wt=7) [demod([15,15])] and(A,B) = and(B,A).
% 0.77/1.17
% 0.77/1.17 ** KEPT: 16 (wt=4) [] not(truth) = falsehood.
% 0.77/1.17 16 is a new demodulator.
% 0.77/1.17
% 0.77/1.17 ** KEPT: 17 (wt=5) [] -(xor(x,falsehood) = x).
% 0.77/1.17 ---------------- PROOF FOUND ----------------
% 0.77/1.17 % SZS status Unsatisfiable
% 0.77/1.17
% 0.77/1.17
% 0.77/1.17 After processing input:
% 0.77/1.17
% 0.77/1.17 Usable:
% 0.77/1.17 end_of_list.
% 0.77/1.17
% 0.77/1.17 Sos:
% 0.77/1.17 16 (wt=4) [] not(truth) = falsehood.
% 0.77/1.17 1 (wt=5) [] implies(truth,A) = A.
% 0.77/1.17 17 (wt=5) [] -(xor(x,falsehood) = x).
% 0.77/1.17 8 (wt=7) [] or(A,B) = or(B,A).
% 0.77/1.17 11 (wt=7) [] and(A,B) = and(B,A).
% 0.77/1.17 14 (wt=7) [] xor(A,B) = xor(B,A).
% 0.77/1.17 15 (wt=7) [demod([9])] and_star(A,B) = and(A,B).
% 0.77/1.17 5 (wt=8) [] or(A,B) = implies(not(A),B).
% 0.77/1.17 6 (wt=8) [flip(5)] implies(not(A),B) = or(A,B).
% 0.77/1.17 9 (wt=10) [flip(1)] not(or(not(A),not(B))) = and(A,B).
% 0.77/1.17 3 (wt=11) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.77/1.17 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.77/1.17 7 (wt=11) [] or(or(A,B),C) = or(A,or(B,C)).
% 0.77/1.17 10 (wt=11) [] and(and(A,B),C) = and(A,and(B,C)).
% 0.77/1.17 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.77/1.17 12 (wt=13) [] xor(A,B) = or(and(A,not(B)),and(not(A),B)).
% 0.77/1.17 13 (wt=13) [flip(12)] or(and(A,not(B)),and(not(A),B)) = xor(A,B).
% 0.77/1.17 end_of_list.
% 0.77/1.17
% 0.77/1.17 Demodulators:
% 0.77/1.17 1 (wt=5) [] implies(truth,A) = A.
% 0.77/1.17 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.77/1.17 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.77/1.17 7 (wt=11) [] or(or(A,B),C) = or(A,or(B,C)).
% 0.77/1.17 9 (wt=10) [flip(1)] not(or(not(A),not(B))) = and(A,B).
% 0.77/1.17 10 (wt=11) [] and(and(A,B),C) = and(A,and(B,C)).
% 0.77/1.17 15 (wt=7) [demod([9])] and_star(A,B) = and(A,B).
% 0.77/1.17 16 (wt=4) [] not(truth) = falsehood.
% 0.77/1.17 end_of_list.
% 0.77/1.17
% 0.77/1.17 Passive:
% 0.77/1.17 end_of_list.
% 0.77/1.17
% 0.77/1.17 UNIT CONFLICT from 374 and x=x at 0.02 seconds.
% 0.77/1.17
% 0.77/1.17 ---------------- PROOF ----------------
% 0.77/1.17 % SZS output start Refutation
% See solution above
% 0.77/1.18 ------------ end of proof -------------
% 0.77/1.18
% 0.77/1.18
% 0.77/1.18 ------------- memory usage ------------
% 0.77/1.18 Memory dynamically allocated (tp_alloc): 976.
% 0.77/1.18 type (bytes each) gets frees in use avail bytes
% 0.77/1.18 sym_ent ( 96) 60 0 60 0 5.6 K
% 0.77/1.18 term ( 16) 29793 22237 7556 39 146.9 K
% 0.77/1.18 gen_ptr ( 8) 43192 9372 33820 56 264.7 K
% 0.77/1.18 context ( 808) 23177 23175 2 3 3.9 K
% 0.77/1.18 trail ( 12) 2323 2323 0 6 0.1 K
% 0.77/1.18 bt_node ( 68) 6789 6786 3 14 1.1 K
% 0.77/1.18 ac_position (285432) 0 0 0 0 0.0 K
% 0.77/1.18 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.77/1.18 ac_match_free_vars_pos (4020)
% 0.77/1.18 0 0 0 0 0.0 K
% 0.77/1.18 discrim ( 12) 7380 3542 3838 487 50.7 K
% 0.77/1.18 flat ( 40) 58574 58574 0 59 2.3 K
% 0.77/1.18 discrim_pos ( 12) 1576 1576 0 1 0.0 K
% 0.77/1.18 fpa_head ( 12) 2445 0 2445 0 28.7 K
% 0.77/1.18 fpa_tree ( 28) 1801 1801 0 29 0.8 K
% 0.77/1.18 fpa_pos ( 36) 636 636 0 1 0.0 K
% 0.77/1.18 literal ( 12) 1452 1078 374 0 4.4 K
% 0.77/1.18 clause ( 24) 1452 1078 374 0 8.8 K
% 0.77/1.18 list ( 12) 322 265 57 3 0.7 K
% 0.77/1.18 list_pos ( 20) 1870 1029 841 21 16.8 K
% 0.77/1.18 pair_index ( 40) 2 0 2 0 0.1 K
% 0.77/1.18
% 0.77/1.18 -------------- statistics -------------
% 0.77/1.18 Clauses input 17
% 0.77/1.18 Usable input 0
% 0.77/1.18 Sos input 17
% 0.77/1.18 Demodulators input 0
% 0.77/1.18 Passive input 0
% 0.77/1.18
% 0.77/1.18 Processed BS (before search) 25
% 0.77/1.18 Forward subsumed BS 8
% 0.77/1.18 Kept BS 17
% 0.77/1.18 New demodulators BS 8
% 0.77/1.18 Back demodulated BS 0
% 0.77/1.18
% 0.77/1.18 Clauses or pairs given 1063
% 0.77/1.18 Clauses generated 936
% 0.77/1.18 Forward subsumed 579
% 0.77/1.18 Deleted by weight 0
% 0.77/1.18 Deleted by variable count 0
% 0.77/1.18 Kept 357
% 0.77/1.18 New demodulators 255
% 0.77/1.18 Back demodulated 208
% 0.77/1.18 Ordered paramod prunes 0
% 0.77/1.18 Basic paramod prunes 1266
% 0.77/1.18 Prime paramod prunes 48
% 0.77/1.18 Semantic prunes 0
% 0.77/1.18
% 0.77/1.18 Rewrite attmepts 12943
% 0.77/1.18 Rewrites 1414
% 0.77/1.18
% 0.77/1.18 FPA overloads 0
% 0.77/1.18 FPA underloads 0
% 0.77/1.18
% 0.77/1.18 Usable size 0
% 0.77/1.18 Sos size 165
% 0.77/1.18 Demodulators size 135
% 0.77/1.18 Passive size 0
% 0.77/1.18 Disabled size 208
% 0.77/1.18
% 0.77/1.18 Proofs found 1
% 0.77/1.18
% 0.77/1.18 ----------- times (seconds) ----------- Sun Jul 3 12:07:00 2022
% 0.77/1.18
% 0.77/1.18 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.77/1.18 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.77/1.18 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.77/1.18 input time 0.00
% 0.77/1.18 paramodulation time 0.00
% 0.77/1.18 demodulation time 0.01
% 0.77/1.18 orient time 0.00
% 0.77/1.18 weigh time 0.00
% 0.77/1.18 forward subsume time 0.00
% 0.77/1.18 back demod find time 0.00
% 0.77/1.18 conflict time 0.00
% 0.77/1.18 LRPO time 0.00
% 0.77/1.18 store clause time 0.00
% 0.77/1.18 disable clause time 0.00
% 0.77/1.18 prime paramod time 0.00
% 0.77/1.18 semantics time 0.00
% 0.77/1.18
% 0.77/1.18 EQP interrupted
%------------------------------------------------------------------------------