TSTP Solution File: REL010-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : REL010-2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n008.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 : Mon Jul 18 19:15:20 EDT 2022
% Result : Unsatisfiable 0.71s 1.14s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 9
% Syntax : Number of clauses : 55 ( 55 unt; 0 nHn; 9 RR)
% Number of literals : 55 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 67 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(join(A,B),join(B,A)),
file('REL010-2.p',unknown),
[] ).
cnf(2,plain,
equal(join(join(A,B),C),join(A,join(B,C))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(3,plain,
equal(join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))),A),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(4,plain,
equal(complement(join(complement(A),complement(B))),meet(A,B)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(5,plain,
equal(join(meet(A,B),complement(join(complement(A),B))),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[3]),4]),
[iquote('back_demod(3),demod([4])')] ).
cnf(7,plain,
equal(composition(A,one),A),
file('REL010-2.p',unknown),
[] ).
cnf(8,plain,
equal(join(composition(A,B),composition(C,B)),composition(join(A,C),B)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(9,plain,
equal(converse(converse(A)),A),
file('REL010-2.p',unknown),
[] ).
cnf(10,plain,
equal(converse(join(A,B)),join(converse(A),converse(B))),
file('REL010-2.p',unknown),
[] ).
cnf(11,plain,
equal(converse(composition(A,B)),composition(converse(B),converse(A))),
file('REL010-2.p',unknown),
[] ).
cnf(12,plain,
equal(join(composition(converse(A),complement(composition(A,B))),complement(B)),complement(B)),
file('REL010-2.p',unknown),
[] ).
cnf(13,plain,
equal(join(A,complement(A)),top),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(14,plain,
equal(meet(A,complement(A)),zero),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(15,plain,
equal(join(meet(composition(A,B),C),composition(meet(A,composition(C,converse(B))),meet(B,composition(converse(A),C)))),composition(meet(A,composition(C,converse(B))),meet(B,composition(converse(A),C)))),
file('REL010-2.p',unknown),
[] ).
cnf(18,plain,
equal(meet(composition(sk1,sk2),sk3),zero),
file('REL010-2.p',unknown),
[] ).
cnf(19,plain,
~ equal(meet(sk2,composition(converse(sk1),sk3)),zero),
file('REL010-2.p',unknown),
[] ).
cnf(23,plain,
equal(join(complement(A),A),top),
inference(para,[status(thm),theory(equality)],[1,13]),
[iquote('para(1,13)')] ).
cnf(24,plain,
equal(meet(A,B),meet(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,4]),4]),
[iquote('para(1,4),demod([4])')] ).
cnf(29,plain,
equal(meet(complement(A),A),zero),
inference(para,[status(thm),theory(equality)],[24,14]),
[iquote('para(24,14)')] ).
cnf(32,plain,
equal(join(meet(A,complement(B)),meet(A,B)),A),
inference(para,[status(thm),theory(equality)],[4,5]),
[iquote('para(4,5)')] ).
cnf(33,plain,
equal(meet(sk3,composition(sk1,sk2)),zero),
inference(para,[status(thm),theory(equality)],[24,18]),
[iquote('para(24,18)')] ).
cnf(34,plain,
~ equal(meet(composition(converse(sk1),sk3),sk2),zero),
inference(para,[status(thm),theory(equality)],[24,19]),
[iquote('para(24,19)')] ).
cnf(36,plain,
equal(composition(converse(one),converse(A)),converse(A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,11]),1]),
[iquote('para(7,11),flip(1)')] ).
cnf(38,plain,
equal(composition(converse(one),A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,36]),9]),
[iquote('para(9,36),demod([9])')] ).
cnf(39,plain,
equal(converse(one),one),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[38,7]),1]),
[iquote('para(38,7),flip(1)')] ).
cnf(40,plain,
equal(composition(one,A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[38]),39]),
[iquote('back_demod(38),demod([39])')] ).
cnf(45,plain,
equal(complement(top),zero),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,4]),14]),
[iquote('para(13,4),demod([14])')] ).
cnf(64,plain,
equal(join(meet(A,complement(complement(A))),zero),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,5]),45]),
[iquote('para(13,5),demod([45])')] ).
cnf(70,plain,
equal(join(zero,meet(A,A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,5]),4]),
[iquote('para(14,5),demod([4])')] ).
cnf(71,plain,
equal(join(meet(A,A),zero),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[70,1]),1]),
[iquote('para(70,1),flip(1)')] ).
cnf(79,plain,
equal(join(meet(composition(converse(A),B),C),composition(meet(converse(A),composition(C,converse(B))),meet(B,composition(A,C)))),composition(meet(converse(A),composition(C,converse(B))),meet(B,composition(A,C)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,15]),9]),
[iquote('para(9,15),demod([9])')] ).
cnf(158,plain,
equal(join(complement(A),join(A,B)),join(top,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[23,2]),1]),
[iquote('para(23,2),flip(1)')] ).
cnf(209,plain,
equal(join(meet(complement(complement(A)),A),zero),A),
inference(para,[status(thm),theory(equality)],[24,64]),
[iquote('para(24,64)')] ).
cnf(216,plain,
equal(join(zero,meet(complement(complement(A)),A)),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[209,1]),1]),
[iquote('para(209,1),flip(1)')] ).
cnf(221,plain,
equal(complement(complement(A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[29,32]),216]),1]),
[iquote('para(29,32),demod([216]),flip(1)')] ).
cnf(241,plain,
equal(complement(join(A,complement(B))),meet(complement(A),B)),
inference(para,[status(thm),theory(equality)],[221,4]),
[iquote('para(221,4)')] ).
cnf(293,plain,
equal(complement(join(A,B)),meet(complement(A),complement(B))),
inference(para,[status(thm),theory(equality)],[221,241]),
[iquote('para(221,241)')] ).
cnf(317,plain,
equal(join(complement(A),complement(A)),complement(A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[39,12]),40,40]),
[iquote('para(39,12),demod([40,40])')] ).
cnf(322,plain,
equal(join(A,composition(B,A)),composition(join(one,B),A)),
inference(para,[status(thm),theory(equality)],[40,8]),
[iquote('para(40,8)')] ).
cnf(329,plain,
equal(join(A,A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[221,317]),221,221]),
[iquote('para(221,317),demod([221,221])')] ).
cnf(349,plain,
equal(join(top,A),top),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[329,158]),23]),1]),
[iquote('para(329,158),demod([23]),flip(1)')] ).
cnf(366,plain,
equal(join(composition(converse(A),complement(composition(A,top))),zero),zero),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[45,12]),45]),
[iquote('para(45,12),demod([45])')] ).
cnf(405,plain,
equal(meet(complement(A),complement(A)),complement(A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[329,293]),1]),
[iquote('para(329,293),flip(1)')] ).
cnf(406,plain,
equal(join(zero,complement(A)),complement(A)),
inference(para,[status(thm),theory(equality)],[405,70]),
[iquote('para(405,70)')] ).
cnf(408,plain,
equal(join(zero,A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[221,406]),221]),
[iquote('para(221,406),demod([221])')] ).
cnf(416,plain,
equal(meet(A,A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[70]),408]),
[iquote('back_demod(70),demod([408])')] ).
cnf(417,plain,
equal(join(A,zero),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[71]),416]),
[iquote('back_demod(71),demod([416])')] ).
cnf(419,plain,
equal(composition(converse(A),complement(composition(A,top))),zero),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[366]),417]),
[iquote('back_demod(366),demod([417])')] ).
cnf(658,plain,
equal(join(meet(composition(converse(sk1),sk3),sk2),composition(meet(converse(sk1),composition(sk2,converse(sk3))),zero)),composition(meet(converse(sk1),composition(sk2,converse(sk3))),zero)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[33,79]),33]),
[iquote('para(33,79),demod([33])')] ).
cnf(689,plain,
equal(composition(join(one,A),top),top),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[349,322]),1]),
[iquote('para(349,322),flip(1)')] ).
cnf(738,plain,
equal(composition(join(one,converse(A)),zero),zero),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[689,419]),10,39,45]),
[iquote('para(689,419),demod([10,39,45])')] ).
cnf(740,plain,
equal(composition(join(one,A),zero),zero),
inference(para,[status(thm),theory(equality)],[9,738]),
[iquote('para(9,738)')] ).
cnf(764,plain,
equal(composition(A,zero),zero),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[408,322]),740]),
[iquote('para(408,322),demod([740])')] ).
cnf(767,plain,
equal(meet(composition(converse(sk1),sk3),sk2),zero),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[658]),764,417,764]),
[iquote('back_demod(658),demod([764,417,764])')] ).
cnf(768,plain,
$false,
inference(conflict,[status(thm)],[767,34]),
[iquote('conflict(767,34)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : REL010-2 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.32 % Computer : n008.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Fri Jul 8 10:42:53 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.67/1.05 ----- EQP 0.9e, May 2009 -----
% 0.67/1.05 The job began on n008.cluster.edu, Fri Jul 8 10:42:54 2022
% 0.67/1.05 The command was "./eqp09e".
% 0.67/1.05
% 0.67/1.05 set(prolog_style_variables).
% 0.67/1.05 set(lrpo).
% 0.67/1.05 set(basic_paramod).
% 0.67/1.05 set(functional_subsume).
% 0.67/1.05 set(ordered_paramod).
% 0.67/1.05 set(prime_paramod).
% 0.67/1.05 set(para_pairs).
% 0.67/1.05 assign(pick_given_ratio,4).
% 0.67/1.05 clear(print_kept).
% 0.67/1.05 clear(print_new_demod).
% 0.67/1.05 clear(print_back_demod).
% 0.67/1.05 clear(print_given).
% 0.67/1.05 assign(max_mem,64000).
% 0.67/1.05 end_of_commands.
% 0.67/1.05
% 0.67/1.05 Usable:
% 0.67/1.05 end_of_list.
% 0.67/1.05
% 0.67/1.05 Sos:
% 0.67/1.05 0 (wt=-1) [] join(A,B) = join(B,A).
% 0.67/1.05 0 (wt=-1) [] join(A,join(B,C)) = join(join(A,B),C).
% 0.67/1.05 0 (wt=-1) [] A = join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))).
% 0.67/1.05 0 (wt=-1) [] meet(A,B) = complement(join(complement(A),complement(B))).
% 0.67/1.05 0 (wt=-1) [] composition(A,composition(B,C)) = composition(composition(A,B),C).
% 0.67/1.05 0 (wt=-1) [] composition(A,one) = A.
% 0.67/1.05 0 (wt=-1) [] composition(join(A,B),C) = join(composition(A,C),composition(B,C)).
% 0.67/1.05 0 (wt=-1) [] converse(converse(A)) = A.
% 0.67/1.05 0 (wt=-1) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 0.67/1.05 0 (wt=-1) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 0.67/1.05 0 (wt=-1) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 0.67/1.05 0 (wt=-1) [] top = join(A,complement(A)).
% 0.67/1.05 0 (wt=-1) [] zero = meet(A,complement(A)).
% 0.67/1.05 0 (wt=-1) [] join(meet(composition(A,B),C),composition(meet(A,composition(C,converse(B))),meet(B,composition(converse(A),C)))) = composition(meet(A,composition(C,converse(B))),meet(B,composition(converse(A),C))).
% 0.67/1.05 0 (wt=-1) [] join(meet(composition(A,B),C),meet(composition(A,meet(B,composition(converse(A),C))),C)) = meet(composition(A,meet(B,composition(converse(A),C))),C).
% 0.67/1.05 0 (wt=-1) [] join(meet(composition(A,B),C),meet(composition(meet(A,composition(C,converse(B))),B),C)) = meet(composition(meet(A,composition(C,converse(B))),B),C).
% 0.67/1.05 0 (wt=-1) [] meet(composition(sk1,sk2),sk3) = zero.
% 0.67/1.05 0 (wt=-1) [] -(meet(sk2,composition(converse(sk1),sk3)) = zero).
% 0.67/1.05 end_of_list.
% 0.67/1.05
% 0.67/1.05 Demodulators:
% 0.67/1.05 end_of_list.
% 0.67/1.05
% 0.67/1.05 Passive:
% 0.67/1.05 end_of_list.
% 0.67/1.05
% 0.67/1.05 Starting to process input.
% 0.67/1.05
% 0.67/1.05 ** KEPT: 1 (wt=7) [] join(A,B) = join(B,A).
% 0.67/1.05 clause forward subsumed: 0 (wt=7) [flip(1)] join(B,A) = join(A,B).
% 0.67/1.05
% 0.67/1.05 ** KEPT: 2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 0.67/1.05 2 is a new demodulator.
% 0.67/1.05
% 0.67/1.05 ** KEPT: 3 (wt=14) [flip(1)] join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))) = A.
% 0.67/1.05 3 is a new demodulator.
% 0.67/1.05
% 0.67/1.05 ** KEPT: 4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 0.67/1.05 4 is a new demodulator.
% 0.67/1.05 -> 4 back demodulating 3.
% 0.67/1.05
% 0.67/1.05 ** KEPT: 5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 0.67/1.05 5 is a new demodulator.
% 0.67/1.05
% 0.67/1.05 ** KEPT: 6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 0.67/1.05 6 is a new demodulator.
% 0.67/1.05
% 0.67/1.05 ** KEPT: 7 (wt=5) [] composition(A,one) = A.
% 0.67/1.05 7 is a new demodulator.
% 0.67/1.05
% 0.67/1.05 ** KEPT: 8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 0.67/1.05 8 is a new demodulator.
% 0.67/1.05
% 0.67/1.05 ** KEPT: 9 (wt=5) [] converse(converse(A)) = A.
% 0.67/1.05 9 is a new demodulator.
% 0.67/1.05
% 0.67/1.05 ** KEPT: 10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 0.67/1.05 10 is a new demodulator.
% 0.67/1.05
% 0.67/1.05 ** KEPT: 11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 0.67/1.05 11 is a new demodulator.
% 0.67/1.05
% 0.67/1.05 ** KEPT: 12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 0.67/1.05 12 is a new demodulator.
% 0.67/1.05
% 0.67/1.05 ** KEPT: 13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 0.67/1.05 13 is a new demodulator.
% 0.67/1.05
% 0.67/1.05 ** KEPT: 14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 0.67/1.05 14 is a new demodulator.
% 0.67/1.05
% 0.67/1.05 ** KEPT: 15 (wt=33) [] join(meet(composition(A,B),C),composition(meet(A,composition(C,converse(B))),meet(B,composition(converse(A),C)))) = composition(meet(A,composition(C,converse(B))),meet(B,composition(converse(A),C))).
% 0.67/1.05 15 is a new demodulator.
% 0.67/1.05
% 0.67/1.05 ** KEPT: 16 (wt=27) [] join(meet(composition(A,B),C),meet(composition(A,meet(B,composition(converse(A),C))),C)) = meet(composition(A,meet(B,composition(converse(A),C))),C).
% 0.67/1.05 16 is a new demodulator.
% 0.67/1.05
% 0.67/1.05 ** KEPT: 17 (wt=27) [] join(meet(composition(A,B),C),meet(composition(meet(A,composition(C,converse(B))),B),C)) = meet(composition(meet(A,composition(C,converse(B))),B),C).
% 0.71/1.14 17 is a new demodulator.
% 0.71/1.14
% 0.71/1.14 ** KEPT: 18 (wt=7) [] meet(composition(sk1,sk2),sk3) = zero.
% 0.71/1.14 18 is a new demodulator.
% 0.71/1.14
% 0.71/1.14 ** KEPT: 19 (wt=8) [] -(meet(sk2,composition(converse(sk1),sk3)) = zero).
% 0.71/1.14 ---------------- PROOF FOUND ----------------
% 0.71/1.14 % SZS status Unsatisfiable
% 0.71/1.14
% 0.71/1.14
% 0.71/1.14 After processing input:
% 0.71/1.14
% 0.71/1.14 Usable:
% 0.71/1.14 end_of_list.
% 0.71/1.14
% 0.71/1.14 Sos:
% 0.71/1.14 7 (wt=5) [] composition(A,one) = A.
% 0.71/1.14 9 (wt=5) [] converse(converse(A)) = A.
% 0.71/1.14 13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 0.71/1.14 14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 0.71/1.14 1 (wt=7) [] join(A,B) = join(B,A).
% 0.71/1.14 18 (wt=7) [] meet(composition(sk1,sk2),sk3) = zero.
% 0.71/1.14 19 (wt=8) [] -(meet(sk2,composition(converse(sk1),sk3)) = zero).
% 0.71/1.14 4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 0.71/1.14 10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 0.71/1.14 11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 0.71/1.14 2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 0.71/1.14 5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 0.71/1.14 6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 0.71/1.14 8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 0.71/1.14 12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 0.71/1.14 16 (wt=27) [] join(meet(composition(A,B),C),meet(composition(A,meet(B,composition(converse(A),C))),C)) = meet(composition(A,meet(B,composition(converse(A),C))),C).
% 0.71/1.14 17 (wt=27) [] join(meet(composition(A,B),C),meet(composition(meet(A,composition(C,converse(B))),B),C)) = meet(composition(meet(A,composition(C,converse(B))),B),C).
% 0.71/1.14 15 (wt=33) [] join(meet(composition(A,B),C),composition(meet(A,composition(C,converse(B))),meet(B,composition(converse(A),C)))) = composition(meet(A,composition(C,converse(B))),meet(B,composition(converse(A),C))).
% 0.71/1.14 end_of_list.
% 0.71/1.14
% 0.71/1.14 Demodulators:
% 0.71/1.14 2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 0.71/1.14 4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 0.71/1.14 5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 0.71/1.14 6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 0.71/1.14 7 (wt=5) [] composition(A,one) = A.
% 0.71/1.14 8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 0.71/1.14 9 (wt=5) [] converse(converse(A)) = A.
% 0.71/1.14 10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 0.71/1.14 11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 0.71/1.14 12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 0.71/1.14 13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 0.71/1.14 14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 0.71/1.14 15 (wt=33) [] join(meet(composition(A,B),C),composition(meet(A,composition(C,converse(B))),meet(B,composition(converse(A),C)))) = composition(meet(A,composition(C,converse(B))),meet(B,composition(converse(A),C))).
% 0.71/1.14 16 (wt=27) [] join(meet(composition(A,B),C),meet(composition(A,meet(B,composition(converse(A),C))),C)) = meet(composition(A,meet(B,composition(converse(A),C))),C).
% 0.71/1.14 17 (wt=27) [] join(meet(composition(A,B),C),meet(composition(meet(A,composition(C,converse(B))),B),C)) = meet(composition(meet(A,composition(C,converse(B))),B),C).
% 0.71/1.14 18 (wt=7) [] meet(composition(sk1,sk2),sk3) = zero.
% 0.71/1.14 end_of_list.
% 0.71/1.14
% 0.71/1.14 Passive:
% 0.71/1.14 end_of_list.
% 0.71/1.14
% 0.71/1.14 UNIT CONFLICT from 767 and 34 at 0.04 seconds.
% 0.71/1.14
% 0.71/1.14 ---------------- PROOF ----------------
% 0.71/1.14 % SZS output start Refutation
% See solution above
% 0.71/1.14 ------------ end of proof -------------
% 0.71/1.14
% 0.71/1.14
% 0.71/1.14 ------------- memory usage ------------
% 0.71/1.14 Memory dynamically allocated (tp_alloc): 1953.
% 0.71/1.14 type (bytes each) gets frees in use avail bytes
% 0.71/1.14 sym_ent ( 96) 62 0 62 0 5.8 K
% 0.71/1.14 term ( 16) 67173 48761 18412 36 357.3 K
% 0.71/1.14 gen_ptr ( 8) 99632 14333 85299 54 666.8 K
% 0.71/1.14 context ( 808) 92685 92683 2 4 4.7 K
% 0.71/1.14 trail ( 12) 4424 4424 0 6 0.1 K
% 0.71/1.14 bt_node ( 68) 39219 39216 3 23 1.7 K
% 0.71/1.14 ac_position (285432) 0 0 0 0 0.0 K
% 0.71/1.14 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.71/1.14 ac_match_free_vars_pos (4020)
% 0.71/1.14 0 0 0 0 0.0 K
% 0.71/1.14 discrim ( 12) 18918 3581 15337 120 181.1 K
% 0.71/1.14 flat ( 40) 119188 119188 0 49 1.9 K
% 0.71/1.14 discrim_pos ( 12) 3094 3094 0 1 0.0 K
% 0.71/1.14 fpa_head ( 12) 7073 0 7073 0 82.9 K
% 0.71/1.14 fpa_tree ( 28) 3674 3674 0 19 0.5 K
% 0.71/1.14 fpa_pos ( 36) 1408 1408 0 1 0.0 K
% 0.71/1.14 literal ( 12) 2906 2139 767 1 9.0 K
% 0.71/1.14 clause ( 24) 2906 2139 767 1 18.0 K
% 0.71/1.14 list ( 12) 700 643 57 3 0.7 K
% 0.71/1.14 list_pos ( 20) 3463 1250 2213 16 43.5 K
% 0.71/1.14 pair_index ( 40) 2 0 2 0 0.1 K
% 0.71/1.14
% 0.71/1.14 -------------- statistics -------------
% 0.71/1.14 Clauses input 18
% 0.71/1.14 Usable input 0
% 0.71/1.14 Sos input 18
% 0.71/1.14 Demodulators input 0
% 0.71/1.14 Passive input 0
% 0.71/1.14
% 0.71/1.14 Processed BS (before search) 20
% 0.71/1.14 Forward subsumed BS 1
% 0.71/1.14 Kept BS 19
% 0.71/1.14 New demodulators BS 17
% 0.71/1.14 Back demodulated BS 1
% 0.71/1.14
% 0.71/1.14 Clauses or pairs given 6881
% 0.71/1.14 Clauses generated 1950
% 0.71/1.14 Forward subsumed 1202
% 0.71/1.14 Deleted by weight 0
% 0.71/1.14 Deleted by variable count 0
% 0.71/1.14 Kept 748
% 0.71/1.14 New demodulators 624
% 0.71/1.14 Back demodulated 248
% 0.71/1.14 Ordered paramod prunes 0
% 0.71/1.14 Basic paramod prunes 17620
% 0.71/1.14 Prime paramod prunes 109
% 0.71/1.14 Semantic prunes 0
% 0.71/1.14
% 0.71/1.14 Rewrite attmepts 28376
% 0.71/1.14 Rewrites 2855
% 0.71/1.14
% 0.71/1.14 FPA overloads 0
% 0.71/1.14 FPA underloads 0
% 0.71/1.14
% 0.71/1.14 Usable size 0
% 0.71/1.14 Sos size 517
% 0.71/1.14 Demodulators size 408
% 0.71/1.14 Passive size 0
% 0.71/1.14 Disabled size 249
% 0.71/1.14
% 0.71/1.14 Proofs found 1
% 0.71/1.14
% 0.71/1.14 ----------- times (seconds) ----------- Fri Jul 8 10:42:54 2022
% 0.71/1.14
% 0.71/1.14 user CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.71/1.14 system CPU time 0.05 (0 hr, 0 min, 0 sec)
% 0.71/1.14 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.71/1.14 input time 0.00
% 0.71/1.14 paramodulation time 0.01
% 0.71/1.14 demodulation time 0.00
% 0.71/1.14 orient time 0.00
% 0.71/1.14 weigh time 0.00
% 0.71/1.14 forward subsume time 0.00
% 0.71/1.14 back demod find time 0.00
% 0.71/1.14 conflict time 0.00
% 0.71/1.14 LRPO time 0.00
% 0.71/1.14 store clause time 0.01
% 0.71/1.14 disable clause time 0.00
% 0.71/1.14 prime paramod time 0.00
% 0.71/1.14 semantics time 0.00
% 0.71/1.14
% 0.71/1.14 EQP interrupted
%------------------------------------------------------------------------------