TSTP Solution File: REL007-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : REL007-1 : TPTP v8.1.0. Released v4.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 : Mon Jul 18 19:15:16 EDT 2022
% Result : Unsatisfiable 1.73s 2.10s
% Output : Refutation 1.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 8
% Syntax : Number of clauses : 89 ( 89 unt; 0 nHn; 24 RR)
% Number of literals : 89 ( 0 equ; 1 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 : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 102 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(join(A,B),join(B,A)),
file('REL007-1.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('REL007-1.p',unknown),
[] ).
cnf(9,plain,
equal(converse(converse(A)),A),
file('REL007-1.p',unknown),
[] ).
cnf(10,plain,
equal(converse(join(A,B)),join(converse(A),converse(B))),
file('REL007-1.p',unknown),
[] ).
cnf(11,plain,
equal(converse(composition(A,B)),composition(converse(B),converse(A))),
file('REL007-1.p',unknown),
[] ).
cnf(12,plain,
equal(join(composition(converse(A),complement(composition(A,B))),complement(B)),complement(B)),
file('REL007-1.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(meet(sk1,converse(sk2)),zero),
file('REL007-1.p',unknown),
[] ).
cnf(16,plain,
~ equal(meet(converse(sk1),sk2),zero),
file('REL007-1.p',unknown),
[] ).
cnf(20,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(23,plain,
equal(join(complement(A),A),top),
inference(para,[status(thm),theory(equality)],[1,13]),
[iquote('para(1,13)')] ).
cnf(25,plain,
equal(join(meet(A,B),complement(join(B,complement(A)))),A),
inference(para,[status(thm),theory(equality)],[1,5]),
[iquote('para(1,5)')] ).
cnf(26,plain,
equal(join(meet(A,B),join(complement(join(complement(A),B)),C)),join(A,C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,2]),1]),
[iquote('para(5,2),flip(1)')] ).
cnf(27,plain,
equal(meet(complement(A),A),zero),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,20]),1]),
[iquote('para(14,20),flip(1)')] ).
cnf(28,plain,
equal(join(meet(join(complement(A),complement(B)),C),complement(join(meet(A,B),C))),join(complement(A),complement(B))),
inference(para,[status(thm),theory(equality)],[4,5]),
[iquote('para(4,5)')] ).
cnf(29,plain,
equal(join(meet(A,complement(B)),meet(A,B)),A),
inference(para,[status(thm),theory(equality)],[4,5]),
[iquote('para(4,5)')] ).
cnf(31,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(32,plain,
equal(composition(converse(one),A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,31]),9]),
[iquote('para(9,31),demod([9])')] ).
cnf(34,plain,
equal(converse(one),one),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[32,7]),1]),
[iquote('para(32,7),flip(1)')] ).
cnf(35,plain,
equal(composition(one,A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[32]),34]),
[iquote('back_demod(32),demod([34])')] ).
cnf(40,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(51,plain,
equal(complement(join(zero,complement(A))),meet(top,A)),
inference(para,[status(thm),theory(equality)],[40,4]),
[iquote('para(40,4)')] ).
cnf(54,plain,
equal(complement(join(zero,zero)),meet(top,top)),
inference(para,[status(thm),theory(equality)],[40,51]),
[iquote('para(40,51)')] ).
cnf(60,plain,
equal(join(A,join(complement(A),B)),join(top,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,2]),1]),
[iquote('para(13,2),flip(1)')] ).
cnf(62,plain,
equal(join(meet(A,complement(complement(A))),zero),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,5]),40]),
[iquote('para(13,5),demod([40])')] ).
cnf(65,plain,
equal(meet(join(complement(A),complement(B)),meet(A,B)),zero),
inference(para,[status(thm),theory(equality)],[4,14]),
[iquote('para(4,14)')] ).
cnf(66,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(67,plain,
equal(join(meet(A,A),zero),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[66,1]),1]),
[iquote('para(66,1),flip(1)')] ).
cnf(125,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(127,plain,
equal(join(converse(complement(A)),converse(A)),converse(top)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[23,10]),1]),
[iquote('para(23,10),flip(1)')] ).
cnf(128,plain,
equal(join(converse(complement(converse(A))),A),converse(top)),
inference(para,[status(thm),theory(equality)],[9,127]),
[iquote('para(9,127)')] ).
cnf(139,plain,
equal(join(meet(A,complement(B)),meet(B,A)),A),
inference(para,[status(thm),theory(equality)],[4,25]),
[iquote('para(4,25)')] ).
cnf(150,plain,
equal(join(meet(complement(complement(A)),A),zero),A),
inference(para,[status(thm),theory(equality)],[20,62]),
[iquote('para(20,62)')] ).
cnf(153,plain,
equal(join(zero,meet(complement(complement(A)),A)),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[150,1]),1]),
[iquote('para(150,1),flip(1)')] ).
cnf(159,plain,
equal(join(meet(sk1,complement(converse(sk2))),zero),sk1),
inference(para,[status(thm),theory(equality)],[15,29]),
[iquote('para(15,29)')] ).
cnf(163,plain,
equal(join(meet(A,B),top),join(top,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[23,26]),60]),
[iquote('para(23,26),demod([60])')] ).
cnf(166,plain,
equal(join(meet(complement(converse(sk2)),sk1),zero),sk1),
inference(para,[status(thm),theory(equality)],[20,159]),
[iquote('para(20,159)')] ).
cnf(167,plain,
equal(join(top,meet(A,B)),join(top,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[163,1]),1]),
[iquote('para(163,1),flip(1)')] ).
cnf(168,plain,
equal(join(zero,complement(join(A,complement(complement(A))))),complement(A)),
inference(para,[status(thm),theory(equality)],[27,25]),
[iquote('para(27,25)')] ).
cnf(169,plain,
equal(join(zero,meet(complement(converse(sk2)),sk1)),sk1),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[166,1]),1]),
[iquote('para(166,1),flip(1)')] ).
cnf(174,plain,
equal(complement(complement(A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[27,29]),153]),1]),
[iquote('para(27,29),demod([153]),flip(1)')] ).
cnf(175,plain,
equal(join(zero,complement(join(A,A))),complement(A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[168]),174]),
[iquote('back_demod(168),demod([174])')] ).
cnf(188,plain,
equal(complement(join(zero,A)),meet(top,complement(A))),
inference(para,[status(thm),theory(equality)],[174,51]),
[iquote('para(174,51)')] ).
cnf(191,plain,
equal(meet(top,complement(zero)),meet(top,top)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[54]),188]),
[iquote('back_demod(54),demod([188])')] ).
cnf(213,plain,
equal(complement(join(A,complement(B))),meet(complement(A),B)),
inference(para,[status(thm),theory(equality)],[174,4]),
[iquote('para(174,4)')] ).
cnf(235,plain,
equal(join(complement(A),complement(A)),complement(A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[34,12]),35,35]),
[iquote('para(34,12),demod([35,35])')] ).
cnf(248,plain,
equal(join(A,A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[174,235]),174,174]),
[iquote('para(174,235),demod([174,174])')] ).
cnf(249,plain,
equal(join(zero,complement(A)),complement(A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[175]),248]),
[iquote('back_demod(175),demod([248])')] ).
cnf(262,plain,
equal(join(zero,A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[174,249]),174]),
[iquote('para(174,249),demod([174])')] ).
cnf(269,plain,
equal(meet(top,complement(A)),complement(A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[188]),262]),1]),
[iquote('back_demod(188),demod([262]),flip(1)')] ).
cnf(270,plain,
equal(complement(zero),meet(top,top)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[191]),269]),
[iquote('back_demod(191),demod([269])')] ).
cnf(272,plain,
equal(meet(complement(converse(sk2)),sk1),sk1),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[169]),262]),
[iquote('back_demod(169),demod([262])')] ).
cnf(277,plain,
equal(meet(A,A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[66]),262]),
[iquote('back_demod(66),demod([262])')] ).
cnf(278,plain,
equal(complement(zero),top),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[270]),277]),
[iquote('back_demod(270),demod([277])')] ).
cnf(279,plain,
equal(join(A,zero),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[67]),277]),
[iquote('back_demod(67),demod([277])')] ).
cnf(331,plain,
equal(complement(join(A,top)),meet(complement(A),zero)),
inference(para,[status(thm),theory(equality)],[278,213]),
[iquote('para(278,213)')] ).
cnf(374,plain,
equal(join(A,top),top),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[331,13]),2,167,279]),
[iquote('para(331,13),demod([2,167,279])')] ).
cnf(378,plain,
equal(join(top,A),top),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[163]),374]),1]),
[iquote('back_demod(163),demod([374]),flip(1)')] ).
cnf(381,plain,
equal(join(complement(A),join(A,B)),top),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[125]),378]),
[iquote('back_demod(125),demod([378])')] ).
cnf(394,plain,
equal(converse(top),top),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[374,128]),1]),
[iquote('para(374,128),flip(1)')] ).
cnf(456,plain,
equal(complement(meet(A,B)),join(complement(A),complement(B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[65,28]),248,262]),
[iquote('para(65,28),demod([248,262])')] ).
cnf(475,plain,
equal(complement(join(A,B)),meet(complement(A),complement(B))),
inference(para,[status(thm),theory(equality)],[174,213]),
[iquote('para(174,213)')] ).
cnf(1091,plain,
equal(join(converse(sk2),complement(sk1)),complement(sk1)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[272,456]),174]),1]),
[iquote('para(272,456),demod([174]),flip(1)')] ).
cnf(1196,plain,
equal(join(converse(complement(A)),join(converse(A),converse(B))),top),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[381,10]),394,10]),1]),
[iquote('para(381,10),demod([394,10]),flip(1)')] ).
cnf(1205,plain,
equal(join(converse(complement(A)),join(converse(A),B)),top),
inference(para,[status(thm),theory(equality)],[9,1196]),
[iquote('para(9,1196)')] ).
cnf(1289,plain,
equal(meet(A,meet(complement(A),complement(B))),zero),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[381,475]),40,174,475]),1]),
[iquote('para(381,475),demod([40,174,475]),flip(1)')] ).
cnf(1291,plain,
equal(meet(A,meet(complement(A),B)),zero),
inference(para,[status(thm),theory(equality)],[174,1289]),
[iquote('para(174,1289)')] ).
cnf(1300,plain,
equal(meet(A,meet(B,complement(A))),zero),
inference(para,[status(thm),theory(equality)],[20,1291]),
[iquote('para(20,1291)')] ).
cnf(1438,plain,
equal(meet(A,join(A,complement(B))),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1291,29]),456,174,279]),
[iquote('para(1291,29),demod([456,174,279])')] ).
cnf(1439,plain,
equal(meet(A,join(A,B)),A),
inference(para,[status(thm),theory(equality)],[174,1438]),
[iquote('para(174,1438)')] ).
cnf(1440,plain,
equal(meet(A,join(B,A)),A),
inference(para,[status(thm),theory(equality)],[1,1439]),
[iquote('para(1,1439)')] ).
cnf(1542,plain,
equal(join(complement(A),meet(complement(A),complement(B))),complement(A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1439,456]),475]),1]),
[iquote('para(1439,456),demod([475]),flip(1)')] ).
cnf(1543,plain,
equal(join(A,meet(A,complement(B))),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[174,1542]),174,174]),
[iquote('para(174,1542),demod([174,174])')] ).
cnf(1547,plain,
equal(join(A,meet(A,B)),A),
inference(para,[status(thm),theory(equality)],[174,1543]),
[iquote('para(174,1543)')] ).
cnf(1887,plain,
equal(join(converse(complement(sk2)),complement(sk1)),top),
inference(para,[status(thm),theory(equality)],[1091,1205]),
[iquote('para(1091,1205)')] ).
cnf(2206,plain,
equal(meet(complement(converse(complement(sk2))),sk1),zero),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1887,475]),40,174]),1]),
[iquote('para(1887,475),demod([40,174]),flip(1)')] ).
cnf(2411,plain,
equal(meet(sk1,converse(complement(sk2))),sk1),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2206,139]),174,279]),
[iquote('para(2206,139),demod([174,279])')] ).
cnf(2412,plain,
equal(meet(converse(complement(sk2)),sk1),sk1),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2411,20]),1]),
[iquote('para(2411,20),flip(1)')] ).
cnf(2418,plain,
equal(join(converse(complement(sk2)),sk1),converse(complement(sk2))),
inference(para,[status(thm),theory(equality)],[2412,1547]),
[iquote('para(2412,1547)')] ).
cnf(4962,plain,
equal(join(complement(sk2),converse(sk1)),complement(sk2)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2418,10]),9,9]),1]),
[iquote('para(2418,10),demod([9,9]),flip(1)')] ).
cnf(4965,plain,
equal(meet(converse(sk1),complement(sk2)),converse(sk1)),
inference(para,[status(thm),theory(equality)],[4962,1440]),
[iquote('para(4962,1440)')] ).
cnf(4969,plain,
equal(meet(sk2,converse(sk1)),zero),
inference(para,[status(thm),theory(equality)],[4965,1300]),
[iquote('para(4965,1300)')] ).
cnf(4971,plain,
equal(meet(converse(sk1),sk2),zero),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4969,20]),1]),
[iquote('para(4969,20),flip(1)')] ).
cnf(4972,plain,
$false,
inference(conflict,[status(thm)],[4971,16]),
[iquote('conflict(4971,16)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : REL007-1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.35 % Computer : n021.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 : Fri Jul 8 11:51:50 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.73/2.10 ----- EQP 0.9e, May 2009 -----
% 1.73/2.10 The job began on n021.cluster.edu, Fri Jul 8 11:51:51 2022
% 1.73/2.10 The command was "./eqp09e".
% 1.73/2.10
% 1.73/2.10 set(prolog_style_variables).
% 1.73/2.10 set(lrpo).
% 1.73/2.10 set(basic_paramod).
% 1.73/2.10 set(functional_subsume).
% 1.73/2.10 set(ordered_paramod).
% 1.73/2.10 set(prime_paramod).
% 1.73/2.10 set(para_pairs).
% 1.73/2.10 assign(pick_given_ratio,4).
% 1.73/2.10 clear(print_kept).
% 1.73/2.10 clear(print_new_demod).
% 1.73/2.10 clear(print_back_demod).
% 1.73/2.10 clear(print_given).
% 1.73/2.10 assign(max_mem,64000).
% 1.73/2.10 end_of_commands.
% 1.73/2.10
% 1.73/2.10 Usable:
% 1.73/2.10 end_of_list.
% 1.73/2.10
% 1.73/2.10 Sos:
% 1.73/2.10 0 (wt=-1) [] join(A,B) = join(B,A).
% 1.73/2.10 0 (wt=-1) [] join(A,join(B,C)) = join(join(A,B),C).
% 1.73/2.10 0 (wt=-1) [] A = join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))).
% 1.73/2.10 0 (wt=-1) [] meet(A,B) = complement(join(complement(A),complement(B))).
% 1.73/2.10 0 (wt=-1) [] composition(A,composition(B,C)) = composition(composition(A,B),C).
% 1.73/2.10 0 (wt=-1) [] composition(A,one) = A.
% 1.73/2.10 0 (wt=-1) [] composition(join(A,B),C) = join(composition(A,C),composition(B,C)).
% 1.73/2.10 0 (wt=-1) [] converse(converse(A)) = A.
% 1.73/2.10 0 (wt=-1) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 1.73/2.10 0 (wt=-1) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 1.73/2.10 0 (wt=-1) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 1.73/2.10 0 (wt=-1) [] top = join(A,complement(A)).
% 1.73/2.10 0 (wt=-1) [] zero = meet(A,complement(A)).
% 1.73/2.10 0 (wt=-1) [] meet(sk1,converse(sk2)) = zero.
% 1.73/2.10 0 (wt=-1) [] -(meet(converse(sk1),sk2) = zero).
% 1.73/2.10 end_of_list.
% 1.73/2.10
% 1.73/2.10 Demodulators:
% 1.73/2.10 end_of_list.
% 1.73/2.10
% 1.73/2.10 Passive:
% 1.73/2.10 end_of_list.
% 1.73/2.10
% 1.73/2.10 Starting to process input.
% 1.73/2.10
% 1.73/2.10 ** KEPT: 1 (wt=7) [] join(A,B) = join(B,A).
% 1.73/2.10 clause forward subsumed: 0 (wt=7) [flip(1)] join(B,A) = join(A,B).
% 1.73/2.10
% 1.73/2.10 ** KEPT: 2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 1.73/2.10 2 is a new demodulator.
% 1.73/2.10
% 1.73/2.10 ** KEPT: 3 (wt=14) [flip(1)] join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))) = A.
% 1.73/2.10 3 is a new demodulator.
% 1.73/2.10
% 1.73/2.10 ** KEPT: 4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 1.73/2.10 4 is a new demodulator.
% 1.73/2.10 -> 4 back demodulating 3.
% 1.73/2.10
% 1.73/2.10 ** KEPT: 5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 1.73/2.10 5 is a new demodulator.
% 1.73/2.10
% 1.73/2.10 ** KEPT: 6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 1.73/2.10 6 is a new demodulator.
% 1.73/2.10
% 1.73/2.10 ** KEPT: 7 (wt=5) [] composition(A,one) = A.
% 1.73/2.10 7 is a new demodulator.
% 1.73/2.10
% 1.73/2.10 ** KEPT: 8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 1.73/2.10 8 is a new demodulator.
% 1.73/2.10
% 1.73/2.10 ** KEPT: 9 (wt=5) [] converse(converse(A)) = A.
% 1.73/2.10 9 is a new demodulator.
% 1.73/2.10
% 1.73/2.10 ** KEPT: 10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 1.73/2.10 10 is a new demodulator.
% 1.73/2.10
% 1.73/2.10 ** KEPT: 11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 1.73/2.10 11 is a new demodulator.
% 1.73/2.10
% 1.73/2.10 ** KEPT: 12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 1.73/2.10 12 is a new demodulator.
% 1.73/2.10
% 1.73/2.10 ** KEPT: 13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 1.73/2.10 13 is a new demodulator.
% 1.73/2.10
% 1.73/2.10 ** KEPT: 14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 1.73/2.10 14 is a new demodulator.
% 1.73/2.10
% 1.73/2.10 ** KEPT: 15 (wt=6) [] meet(sk1,converse(sk2)) = zero.
% 1.73/2.10 15 is a new demodulator.
% 1.73/2.10
% 1.73/2.10 ** KEPT: 16 (wt=6) [] -(meet(converse(sk1),sk2) = zero).
% 1.73/2.10 ---------------- PROOF FOUND ----------------
% 1.73/2.10 % SZS status Unsatisfiable
% 1.73/2.10
% 1.73/2.10
% 1.73/2.10 After processing input:
% 1.73/2.10
% 1.73/2.10 Usable:
% 1.73/2.10 end_of_list.
% 1.73/2.10
% 1.73/2.10 Sos:
% 1.73/2.10 7 (wt=5) [] composition(A,one) = A.
% 1.73/2.10 9 (wt=5) [] converse(converse(A)) = A.
% 1.73/2.10 13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 1.73/2.10 14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 1.73/2.10 15 (wt=6) [] meet(sk1,converse(sk2)) = zero.
% 1.73/2.10 16 (wt=6) [] -(meet(converse(sk1),sk2) = zero).
% 1.73/2.10 1 (wt=7) [] join(A,B) = join(B,A).
% 1.73/2.10 4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 1.73/2.10 10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 1.73/2.10 11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 1.73/2.10 2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 1.73/2.10 5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 1.73/2.10 6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 1.73/2.10 8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 1.73/2.10 12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 1.73/2.10 end_of_list.
% 1.73/2.10
% 1.73/2.10 Demodulators:
% 1.73/2.10 2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 1.73/2.10 4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 1.73/2.10 5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 1.73/2.10 6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 1.73/2.10 7 (wt=5) [] composition(A,one) = A.
% 1.73/2.10 8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 1.73/2.10 9 (wt=5) [] converse(converse(A)) = A.
% 1.73/2.10 10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 1.73/2.10 11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 1.73/2.10 12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 1.73/2.10 13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 1.73/2.10 14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 1.73/2.10 15 (wt=6) [] meet(sk1,converse(sk2)) = zero.
% 1.73/2.10 end_of_list.
% 1.73/2.10
% 1.73/2.10 Passive:
% 1.73/2.10 end_of_list.
% 1.73/2.10
% 1.73/2.10 UNIT CONFLICT from 4971 and 16 at 0.54 seconds.
% 1.73/2.10
% 1.73/2.10 ---------------- PROOF ----------------
% 1.73/2.10 % SZS output start Refutation
% See solution above
% 1.73/2.10 ------------ end of proof -------------
% 1.73/2.10
% 1.73/2.10
% 1.73/2.10 ------------- memory usage ------------
% 1.73/2.10 Memory dynamically allocated (tp_alloc): 9277.
% 1.73/2.10 type (bytes each) gets frees in use avail bytes
% 1.73/2.10 sym_ent ( 96) 61 0 61 0 5.7 K
% 1.73/2.10 term ( 16) 762846 642328 120518 45 2335.3 K
% 1.73/2.10 gen_ptr ( 8) 720305 138893 581412 88 4543.0 K
% 1.73/2.10 context ( 808) 975765 975763 2 5 5.5 K
% 1.73/2.10 trail ( 12) 48822 48822 0 7 0.1 K
% 1.73/2.10 bt_node ( 68) 455543 455540 3 29 2.1 K
% 1.73/2.10 ac_position (285432) 0 0 0 0 0.0 K
% 1.73/2.10 ac_match_pos (14044) 0 0 0 0 0.0 K
% 1.73/2.10 ac_match_free_vars_pos (4020)
% 1.73/2.10 0 0 0 0 0.0 K
% 1.73/2.10 discrim ( 12) 93522 14413 79109 0 927.1 K
% 1.73/2.10 flat ( 40) 1592443 1592443 0 83 3.2 K
% 1.73/2.10 discrim_pos ( 12) 41876 41876 0 1 0.0 K
% 1.73/2.10 fpa_head ( 12) 13353 0 13353 0 156.5 K
% 1.73/2.10 fpa_tree ( 28) 21233 21233 0 47 1.3 K
% 1.73/2.10 fpa_pos ( 36) 7913 7913 0 1 0.0 K
% 1.73/2.10 literal ( 12) 32229 27258 4971 1 58.3 K
% 1.73/2.10 clause ( 24) 32229 27258 4971 1 116.5 K
% 1.73/2.10 list ( 12) 3001 2945 56 4 0.7 K
% 1.73/2.10 list_pos ( 20) 19897 4690 15207 0 297.0 K
% 1.73/2.10 pair_index ( 40) 2 0 2 0 0.1 K
% 1.73/2.10
% 1.73/2.10 -------------- statistics -------------
% 1.73/2.10 Clauses input 15
% 1.73/2.10 Usable input 0
% 1.73/2.10 Sos input 15
% 1.73/2.10 Demodulators input 0
% 1.73/2.10 Passive input 0
% 1.73/2.10
% 1.73/2.10 Processed BS (before search) 17
% 1.73/2.10 Forward subsumed BS 1
% 1.73/2.10 Kept BS 16
% 1.73/2.10 New demodulators BS 14
% 1.73/2.10 Back demodulated BS 1
% 1.73/2.10
% 1.73/2.10 Clauses or pairs given 79179
% 1.73/2.10 Clauses generated 21892
% 1.73/2.10 Forward subsumed 16937
% 1.73/2.10 Deleted by weight 0
% 1.73/2.10 Deleted by variable count 0
% 1.73/2.10 Kept 4955
% 1.73/2.10 New demodulators 2928
% 1.73/2.10 Back demodulated 1002
% 1.73/2.10 Ordered paramod prunes 0
% 1.73/2.10 Basic paramod prunes 347003
% 1.73/2.10 Prime paramod prunes 1442
% 1.73/2.10 Semantic prunes 0
% 1.73/2.10
% 1.73/2.10 Rewrite attmepts 297208
% 1.73/2.10 Rewrites 35956
% 1.73/2.10
% 1.73/2.10 FPA overloads 0
% 1.73/2.10 FPA underloads 0
% 1.73/2.10
% 1.73/2.10 Usable size 0
% 1.73/2.10 Sos size 3967
% 1.73/2.10 Demodulators size 2303
% 1.73/2.10 Passive size 0
% 1.73/2.10 Disabled size 1003
% 1.73/2.10
% 1.73/2.10 Proofs found 1
% 1.73/2.10
% 1.73/2.10 ----------- times (seconds) ----------- Fri Jul 8 11:51:52 2022
% 1.73/2.10
% 1.73/2.10 user CPU time 0.54 (0 hr, 0 min, 0 sec)
% 1.73/2.10 system CPU time 0.47 (0 hr, 0 min, 0 sec)
% 1.73/2.10 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.73/2.10 input time 0.00
% 1.73/2.10 paramodulation time 0.12
% 1.73/2.10 demodulation time 0.06
% 1.73/2.10 orient time 0.03
% 1.73/2.10 weigh time 0.01
% 1.73/2.10 forward subsume time 0.02
% 1.73/2.10 back demod find time 0.02
% 1.73/2.10 conflict time 0.01
% 1.73/2.10 LRPO time 0.01
% 1.73/2.10 store clause time 0.12
% 1.73/2.10 disable clause time 0.01
% 1.73/2.10 prime paramod time 0.01
% 1.73/2.10 semantics time 0.00
% 1.73/2.10
% 1.73/2.10 EQP interrupted
%------------------------------------------------------------------------------