TSTP Solution File: REL033+4 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : REL033+4 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:13:47 EDT 2023
% Result : Theorem 473.10s 60.56s
% Output : CNFRefutation 473.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 38
% Number of leaves : 15
% Syntax : Number of formulae : 172 ( 167 unt; 0 def)
% Number of atoms : 180 ( 179 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 16 ( 8 ~; 3 |; 3 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 302 ( 24 sgn; 66 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(maddux4_definiton_of_meet,axiom,
! [X1,X2] : meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox/tmp/tmp.7zEBIdHaJ9/E---3.1_10465.p',maddux4_definiton_of_meet) ).
fof(def_top,axiom,
! [X1] : top = join(X1,complement(X1)),
file('/export/starexec/sandbox/tmp/tmp.7zEBIdHaJ9/E---3.1_10465.p',def_top) ).
fof(def_zero,axiom,
! [X1] : zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox/tmp/tmp.7zEBIdHaJ9/E---3.1_10465.p',def_zero) ).
fof(maddux2_join_associativity,axiom,
! [X1,X2,X3] : join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.7zEBIdHaJ9/E---3.1_10465.p',maddux2_join_associativity) ).
fof(maddux1_join_commutativity,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.7zEBIdHaJ9/E---3.1_10465.p',maddux1_join_commutativity) ).
fof(maddux3_a_kind_of_de_Morgan,axiom,
! [X1,X2] : X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
file('/export/starexec/sandbox/tmp/tmp.7zEBIdHaJ9/E---3.1_10465.p',maddux3_a_kind_of_de_Morgan) ).
fof(converse_additivity,axiom,
! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox/tmp/tmp.7zEBIdHaJ9/E---3.1_10465.p',converse_additivity) ).
fof(converse_cancellativity,axiom,
! [X1,X2] : join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox/tmp/tmp.7zEBIdHaJ9/E---3.1_10465.p',converse_cancellativity) ).
fof(converse_idempotence,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/export/starexec/sandbox/tmp/tmp.7zEBIdHaJ9/E---3.1_10465.p',converse_idempotence) ).
fof(converse_multiplicativity,axiom,
! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox/tmp/tmp.7zEBIdHaJ9/E---3.1_10465.p',converse_multiplicativity) ).
fof(goals,conjecture,
! [X1,X2,X3] :
( composition(X1,top) = X1
=> ( join(composition(meet(X1,X2),X3),meet(X1,composition(X2,X3))) = meet(X1,composition(X2,X3))
& join(meet(X1,composition(X2,X3)),composition(meet(X1,X2),X3)) = composition(meet(X1,X2),X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.7zEBIdHaJ9/E---3.1_10465.p',goals) ).
fof(composition_distributivity,axiom,
! [X1,X2,X3] : composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.7zEBIdHaJ9/E---3.1_10465.p',composition_distributivity) ).
fof(dedekind_law,axiom,
! [X1,X2,X3] : join(meet(composition(X1,X2),X3),composition(meet(X1,composition(X3,converse(X2))),meet(X2,composition(converse(X1),X3)))) = composition(meet(X1,composition(X3,converse(X2))),meet(X2,composition(converse(X1),X3))),
file('/export/starexec/sandbox/tmp/tmp.7zEBIdHaJ9/E---3.1_10465.p',dedekind_law) ).
fof(composition_associativity,axiom,
! [X1,X2,X3] : composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.7zEBIdHaJ9/E---3.1_10465.p',composition_associativity) ).
fof(modular_law_2,axiom,
! [X1,X2,X3] : join(meet(composition(X1,X2),X3),meet(composition(meet(X1,composition(X3,converse(X2))),X2),X3)) = meet(composition(meet(X1,composition(X3,converse(X2))),X2),X3),
file('/export/starexec/sandbox/tmp/tmp.7zEBIdHaJ9/E---3.1_10465.p',modular_law_2) ).
fof(c_0_15,plain,
! [X26,X27] : meet(X26,X27) = complement(join(complement(X26),complement(X27))),
inference(variable_rename,[status(thm)],[maddux4_definiton_of_meet]) ).
fof(c_0_16,plain,
! [X37] : top = join(X37,complement(X37)),
inference(variable_rename,[status(thm)],[def_top]) ).
fof(c_0_17,plain,
! [X39] : zero = meet(X39,complement(X39)),
inference(variable_rename,[status(thm)],[def_zero]) ).
fof(c_0_18,plain,
! [X30,X31,X32] : join(X30,join(X31,X32)) = join(join(X30,X31),X32),
inference(variable_rename,[status(thm)],[maddux2_join_associativity]) ).
cnf(c_0_19,plain,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
top = join(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
zero = meet(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_22,plain,
! [X28,X29] : join(X28,X29) = join(X29,X28),
inference(variable_rename,[status(thm)],[maddux1_join_commutativity]) ).
cnf(c_0_23,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_24,plain,
! [X33,X34] : X33 = join(complement(join(complement(X33),complement(X34))),complement(join(complement(X33),X34))),
inference(variable_rename,[status(thm)],[maddux3_a_kind_of_de_Morgan]) ).
cnf(c_0_25,plain,
complement(top) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_26,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,plain,
join(X1,join(complement(X1),X2)) = join(top,X2),
inference(spm,[status(thm)],[c_0_23,c_0_20]) ).
cnf(c_0_28,plain,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
meet(top,zero) = zero,
inference(spm,[status(thm)],[c_0_21,c_0_25]) ).
cnf(c_0_30,plain,
meet(X1,X2) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_26]),c_0_19]) ).
cnf(c_0_31,plain,
join(top,join(zero,X1)) = join(top,X1),
inference(spm,[status(thm)],[c_0_27,c_0_25]) ).
cnf(c_0_32,plain,
join(meet(X1,X2),complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[c_0_28,c_0_19]) ).
cnf(c_0_33,plain,
meet(zero,top) = zero,
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
join(top,complement(zero)) = join(top,top),
inference(spm,[status(thm)],[c_0_31,c_0_20]) ).
cnf(c_0_35,plain,
join(zero,complement(join(top,top))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_26]),c_0_34]) ).
cnf(c_0_36,plain,
join(zero,top) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_25]),c_0_26]) ).
cnf(c_0_37,plain,
join(X1,join(X2,complement(join(X1,X2)))) = top,
inference(spm,[status(thm)],[c_0_20,c_0_23]) ).
cnf(c_0_38,plain,
join(top,complement(join(top,top))) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_35]),c_0_26]),c_0_36]) ).
cnf(c_0_39,plain,
join(top,top) = top,
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_40,plain,
join(zero,zero) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_39]),c_0_25]) ).
cnf(c_0_41,plain,
join(meet(X1,X2),meet(X1,complement(X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_19]),c_0_26]) ).
cnf(c_0_42,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_23,c_0_40]) ).
cnf(c_0_43,plain,
join(zero,meet(X1,complement(complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_41,c_0_21]) ).
cnf(c_0_44,plain,
join(zero,meet(X1,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_21]),c_0_19]) ).
cnf(c_0_45,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,plain,
join(complement(X1),join(complement(X2),meet(X1,X2))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_19]),c_0_23]) ).
cnf(c_0_47,plain,
meet(X1,X1) = X1,
inference(rw,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,plain,
join(top,complement(X1)) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_26]),c_0_20]),c_0_26]) ).
cnf(c_0_49,plain,
join(X1,top) = top,
inference(spm,[status(thm)],[c_0_37,c_0_48]) ).
cnf(c_0_50,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_45]) ).
cnf(c_0_51,plain,
complement(join(zero,complement(X1))) = meet(top,X1),
inference(spm,[status(thm)],[c_0_19,c_0_25]) ).
cnf(c_0_52,plain,
meet(X1,top) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_49]),c_0_25]),c_0_50]) ).
cnf(c_0_53,plain,
complement(complement(X1)) = meet(top,X1),
inference(rw,[status(thm)],[c_0_51,c_0_45]) ).
cnf(c_0_54,plain,
meet(top,X1) = X1,
inference(spm,[status(thm)],[c_0_30,c_0_52]) ).
cnf(c_0_55,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_56,plain,
complement(meet(X1,X2)) = join(complement(X1),complement(X2)),
inference(spm,[status(thm)],[c_0_55,c_0_19]) ).
cnf(c_0_57,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(spm,[status(thm)],[c_0_56,c_0_47]) ).
cnf(c_0_58,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_26]),c_0_23]) ).
cnf(c_0_59,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_57,c_0_55]) ).
fof(c_0_60,plain,
! [X35,X36] : converse(join(X35,X36)) = join(converse(X35),converse(X36)),
inference(variable_rename,[status(thm)],[converse_additivity]) ).
cnf(c_0_61,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_23]),c_0_59]) ).
cnf(c_0_62,plain,
join(meet(X1,X2),meet(complement(X2),X1)) = X1,
inference(spm,[status(thm)],[c_0_41,c_0_30]) ).
fof(c_0_63,plain,
! [X15,X16] : join(composition(converse(X15),complement(composition(X15,X16))),complement(X16)) = complement(X16),
inference(variable_rename,[status(thm)],[converse_cancellativity]) ).
cnf(c_0_64,plain,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
fof(c_0_65,plain,
! [X38] : converse(converse(X38)) = X38,
inference(variable_rename,[status(thm)],[converse_idempotence]) ).
cnf(c_0_66,plain,
complement(join(meet(X1,X2),complement(X3))) = meet(join(complement(X1),complement(X2)),X3),
inference(spm,[status(thm)],[c_0_19,c_0_19]) ).
cnf(c_0_67,plain,
join(X1,meet(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_26]) ).
cnf(c_0_68,plain,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
fof(c_0_69,plain,
! [X13,X14] : converse(composition(X13,X14)) = composition(converse(X14),converse(X13)),
inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).
cnf(c_0_70,plain,
join(converse(zero),converse(X1)) = converse(X1),
inference(spm,[status(thm)],[c_0_64,c_0_45]) ).
cnf(c_0_71,plain,
converse(converse(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_72,plain,
join(converse(X1),converse(complement(X1))) = converse(top),
inference(spm,[status(thm)],[c_0_64,c_0_20]) ).
cnf(c_0_73,plain,
complement(join(X1,complement(X2))) = meet(complement(X1),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_52]),c_0_25]),c_0_26]),c_0_45]) ).
cnf(c_0_74,plain,
join(X1,join(meet(X1,X2),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_23,c_0_67]) ).
cnf(c_0_75,plain,
join(meet(complement(X1),X2),meet(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_26,c_0_62]) ).
cnf(c_0_76,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_68,c_0_26]) ).
cnf(c_0_77,plain,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_78,plain,
join(converse(zero),X1) = X1,
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_79,plain,
join(top,join(top,X1)) = join(top,X1),
inference(spm,[status(thm)],[c_0_23,c_0_39]) ).
cnf(c_0_80,plain,
join(X1,converse(complement(converse(X1)))) = converse(top),
inference(spm,[status(thm)],[c_0_72,c_0_71]) ).
cnf(c_0_81,plain,
complement(join(X1,X2)) = meet(complement(X1),complement(X2)),
inference(spm,[status(thm)],[c_0_73,c_0_55]) ).
cnf(c_0_82,plain,
join(complement(X1),meet(X2,X1)) = join(complement(X1),X2),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_83,plain,
join(converse(complement(X1)),composition(converse(complement(composition(X2,X1))),X2)) = converse(complement(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_76]),c_0_77]),c_0_71]) ).
cnf(c_0_84,plain,
converse(zero) = zero,
inference(spm,[status(thm)],[c_0_50,c_0_78]) ).
cnf(c_0_85,plain,
join(top,converse(top)) = converse(top),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_86,plain,
meet(X1,join(complement(X2),complement(X1))) = meet(X1,complement(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_81]),c_0_53]),c_0_54]),c_0_53]),c_0_54]),c_0_56]) ).
cnf(c_0_87,plain,
composition(converse(complement(composition(X1,top))),X1) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_25]),c_0_84]),c_0_45]),c_0_84]) ).
cnf(c_0_88,plain,
complement(zero) = meet(top,join(top,top)),
inference(spm,[status(thm)],[c_0_51,c_0_35]) ).
cnf(c_0_89,plain,
converse(top) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_85]),c_0_71]),c_0_71]),c_0_26]),c_0_85]) ).
cnf(c_0_90,plain,
complement(join(complement(X1),meet(X2,X3))) = meet(X1,join(complement(X2),complement(X3))),
inference(spm,[status(thm)],[c_0_19,c_0_19]) ).
cnf(c_0_91,plain,
meet(X1,join(X2,complement(X1))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_86,c_0_55]) ).
fof(c_0_92,negated_conjecture,
~ ! [X1,X2,X3] :
( composition(X1,top) = X1
=> ( join(composition(meet(X1,X2),X3),meet(X1,composition(X2,X3))) = meet(X1,composition(X2,X3))
& join(meet(X1,composition(X2,X3)),composition(meet(X1,X2),X3)) = composition(meet(X1,X2),X3) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_93,plain,
composition(top,converse(complement(composition(top,top)))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_87]),c_0_88]),c_0_54]),c_0_49]),c_0_89]) ).
cnf(c_0_94,plain,
join(meet(X1,X2),meet(complement(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_62,c_0_30]) ).
cnf(c_0_95,plain,
complement(join(complement(X1),X2)) = meet(X1,complement(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_52]),c_0_25]),c_0_50]) ).
cnf(c_0_96,plain,
meet(X1,join(complement(X1),X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_91,c_0_26]) ).
fof(c_0_97,negated_conjecture,
( composition(esk1_0,top) = esk1_0
& ( join(composition(meet(esk1_0,esk2_0),esk3_0),meet(esk1_0,composition(esk2_0,esk3_0))) != meet(esk1_0,composition(esk2_0,esk3_0))
| join(meet(esk1_0,composition(esk2_0,esk3_0)),composition(meet(esk1_0,esk2_0),esk3_0)) != composition(meet(esk1_0,esk2_0),esk3_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_92])])]) ).
fof(c_0_98,plain,
! [X10,X11,X12] : composition(join(X10,X11),X12) = join(composition(X10,X12),composition(X11,X12)),
inference(variable_rename,[status(thm)],[composition_distributivity]) ).
cnf(c_0_99,plain,
composition(complement(composition(top,top)),top) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_93]),c_0_84]),c_0_71]),c_0_89]) ).
cnf(c_0_100,plain,
join(meet(X1,X2),join(meet(X1,complement(X2)),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_23,c_0_41]) ).
cnf(c_0_101,plain,
join(X1,meet(complement(X1),X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_74,c_0_94]) ).
cnf(c_0_102,plain,
meet(X1,join(X1,complement(X2))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_67]),c_0_53]),c_0_54]),c_0_56]),c_0_53]),c_0_54]) ).
cnf(c_0_103,plain,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_104,plain,
meet(complement(X1),join(X1,X2)) = meet(complement(X1),X2),
inference(spm,[status(thm)],[c_0_96,c_0_55]) ).
cnf(c_0_105,plain,
join(complement(X1),join(meet(X2,X1),X3)) = join(complement(X1),join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_82]),c_0_23]) ).
fof(c_0_106,plain,
! [X17,X18,X19] : join(meet(composition(X17,X18),X19),composition(meet(X17,composition(X19,converse(X18))),meet(X18,composition(converse(X17),X19)))) = composition(meet(X17,composition(X19,converse(X18))),meet(X18,composition(converse(X17),X19))),
inference(variable_rename,[status(thm)],[dedekind_law]) ).
cnf(c_0_107,negated_conjecture,
composition(esk1_0,top) = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_97]) ).
cnf(c_0_108,plain,
join(meet(X1,X2),meet(X2,complement(X1))) = X2,
inference(spm,[status(thm)],[c_0_41,c_0_30]) ).
fof(c_0_109,plain,
! [X7,X8,X9] : composition(X7,composition(X8,X9)) = composition(composition(X7,X8),X9),
inference(variable_rename,[status(thm)],[composition_associativity]) ).
cnf(c_0_110,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_98]) ).
cnf(c_0_111,plain,
composition(top,complement(composition(top,top))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_99]),c_0_25]),c_0_84]),c_0_88]),c_0_54]),c_0_49]),c_0_89]),c_0_45]),c_0_25]),c_0_84]) ).
cnf(c_0_112,plain,
join(top,X1) = top,
inference(spm,[status(thm)],[c_0_26,c_0_49]) ).
cnf(c_0_113,plain,
join(X1,meet(join(complement(X1),X2),X3)) = join(X1,X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_100]),c_0_56]),c_0_55]) ).
cnf(c_0_114,plain,
meet(X1,join(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_102,c_0_55]) ).
cnf(c_0_115,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_103,c_0_59]) ).
cnf(c_0_116,plain,
meet(X1,join(meet(X2,X1),X3)) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_53]),c_0_54]),c_0_96]),c_0_53]),c_0_54]) ).
cnf(c_0_117,plain,
join(X1,meet(X2,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_94]),c_0_26]) ).
cnf(c_0_118,plain,
join(meet(composition(X1,X2),X3),composition(meet(X1,composition(X3,converse(X2))),meet(X2,composition(converse(X1),X3)))) = composition(meet(X1,composition(X3,converse(X2))),meet(X2,composition(converse(X1),X3))),
inference(split_conjunct,[status(thm)],[c_0_106]) ).
cnf(c_0_119,negated_conjecture,
composition(converse(complement(esk1_0)),esk1_0) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_107]),c_0_25]),c_0_84]),c_0_45]),c_0_25]),c_0_84]) ).
cnf(c_0_120,plain,
join(meet(X1,complement(X2)),meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_108]) ).
cnf(c_0_121,plain,
meet(zero,X1) = zero,
inference(spm,[status(thm)],[c_0_45,c_0_67]) ).
cnf(c_0_122,plain,
composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_109]) ).
cnf(c_0_123,plain,
composition(X1,complement(composition(top,top))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_45]),c_0_112]),c_0_111]) ).
cnf(c_0_124,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_113]),c_0_96]),c_0_53]),c_0_54]) ).
cnf(c_0_125,plain,
meet(complement(X1),join(X2,X1)) = meet(complement(X1),X2),
inference(spm,[status(thm)],[c_0_91,c_0_55]) ).
cnf(c_0_126,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_114,c_0_115]) ).
cnf(c_0_127,plain,
meet(X1,join(meet(X1,X2),X3)) = meet(X1,join(X2,X3)),
inference(spm,[status(thm)],[c_0_116,c_0_30]) ).
cnf(c_0_128,plain,
join(X1,join(X2,meet(X3,X1))) = join(X2,X1),
inference(spm,[status(thm)],[c_0_58,c_0_117]) ).
cnf(c_0_129,plain,
join(composition(meet(X1,composition(X2,converse(X3))),meet(X3,composition(converse(X1),X2))),meet(composition(X1,X3),X2)) = composition(meet(X1,composition(X2,converse(X3))),meet(X3,composition(converse(X1),X2))),
inference(spm,[status(thm)],[c_0_26,c_0_118]) ).
cnf(c_0_130,negated_conjecture,
composition(converse(esk1_0),complement(esk1_0)) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_119]),c_0_84]),c_0_71]) ).
cnf(c_0_131,plain,
meet(X1,zero) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_121]),c_0_45]) ).
cnf(c_0_132,plain,
composition(X1,zero) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_123]),c_0_123]) ).
cnf(c_0_133,plain,
meet(meet(X1,X2),meet(X1,X3)) = meet(meet(X1,X2),X3),
inference(spm,[status(thm)],[c_0_124,c_0_62]) ).
cnf(c_0_134,plain,
meet(join(X1,X2),join(X1,complement(X2))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_101]),c_0_56]),c_0_53]),c_0_54]),c_0_56]),c_0_53]),c_0_54]),c_0_30]),c_0_114]),c_0_30]) ).
fof(c_0_135,plain,
! [X23,X24,X25] : join(meet(composition(X23,X24),X25),meet(composition(meet(X23,composition(X25,converse(X24))),X24),X25)) = meet(composition(meet(X23,composition(X25,converse(X24))),X24),X25),
inference(variable_rename,[status(thm)],[modular_law_2]) ).
cnf(c_0_136,plain,
meet(join(X1,X2),join(meet(X1,X3),X2)) = join(meet(X1,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_74]),c_0_30]) ).
cnf(c_0_137,plain,
meet(X1,join(X2,meet(X1,X3))) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_115]),c_0_128]) ).
cnf(c_0_138,negated_conjecture,
meet(composition(esk1_0,X1),complement(esk1_0)) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_130]),c_0_131]),c_0_132]),c_0_45]),c_0_131]),c_0_132]) ).
cnf(c_0_139,plain,
meet(meet(X1,X2),X3) = meet(meet(X1,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_133]),c_0_133]) ).
cnf(c_0_140,plain,
meet(join(X1,X2),join(complement(X2),X1)) = X1,
inference(spm,[status(thm)],[c_0_134,c_0_26]) ).
cnf(c_0_141,plain,
join(X1,meet(X2,complement(X1))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_74,c_0_108]) ).
cnf(c_0_142,plain,
join(meet(composition(X1,X2),X3),meet(composition(meet(X1,composition(X3,converse(X2))),X2),X3)) = meet(composition(meet(X1,composition(X3,converse(X2))),X2),X3),
inference(split_conjunct,[status(thm)],[c_0_135]) ).
cnf(c_0_143,plain,
join(meet(X1,X2),meet(X1,X3)) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_67]),c_0_137]),c_0_127]) ).
cnf(c_0_144,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_94]),c_0_30]) ).
cnf(c_0_145,plain,
composition(converse(X1),complement(composition(X1,top))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_87]),c_0_84]),c_0_71]) ).
cnf(c_0_146,negated_conjecture,
join(esk1_0,composition(esk1_0,X1)) = esk1_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_138]),c_0_55]),c_0_50]),c_0_55]) ).
cnf(c_0_147,plain,
meet(meet(X1,X2),X3) = meet(X2,meet(X1,X3)),
inference(spm,[status(thm)],[c_0_30,c_0_139]) ).
cnf(c_0_148,plain,
meet(join(X1,X2),complement(X1)) = meet(X2,complement(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_140,c_0_117]),c_0_26]),c_0_141]) ).
cnf(c_0_149,plain,
join(meet(composition(X1,X2),X3),meet(X3,composition(meet(X1,composition(X3,converse(X2))),X2))) = meet(X3,composition(meet(X1,composition(X3,converse(X2))),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_142,c_0_30]),c_0_30]) ).
cnf(c_0_150,plain,
join(meet(X1,X2),meet(X2,X3)) = meet(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_143,c_0_144]),c_0_116]) ).
cnf(c_0_151,plain,
meet(composition(X1,X2),complement(composition(X1,top))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_145]),c_0_131]),c_0_132]),c_0_50]),c_0_131]),c_0_132]) ).
cnf(c_0_152,negated_conjecture,
join(esk1_0,join(composition(esk1_0,X1),X2)) = join(esk1_0,X2),
inference(spm,[status(thm)],[c_0_23,c_0_146]) ).
cnf(c_0_153,plain,
join(complement(X1),meet(X1,X2)) = join(complement(X1),X2),
inference(spm,[status(thm)],[c_0_82,c_0_30]) ).
cnf(c_0_154,plain,
meet(complement(X1),meet(join(X1,X2),X3)) = meet(complement(X1),meet(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_147,c_0_148]),c_0_147]) ).
cnf(c_0_155,plain,
meet(X1,composition(meet(X2,composition(X1,converse(X3))),X3)) = meet(X1,composition(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_149,c_0_150]),c_0_110]),c_0_67]) ).
cnf(c_0_156,plain,
meet(composition(X1,top),composition(X1,X2)) = composition(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_151]),c_0_55]),c_0_45]) ).
cnf(c_0_157,negated_conjecture,
join(esk1_0,composition(join(esk1_0,X1),X2)) = join(esk1_0,composition(X1,X2)),
inference(spm,[status(thm)],[c_0_152,c_0_110]) ).
cnf(c_0_158,negated_conjecture,
( join(composition(meet(esk1_0,esk2_0),esk3_0),meet(esk1_0,composition(esk2_0,esk3_0))) != meet(esk1_0,composition(esk2_0,esk3_0))
| join(meet(esk1_0,composition(esk2_0,esk3_0)),composition(meet(esk1_0,esk2_0),esk3_0)) != composition(meet(esk1_0,esk2_0),esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_97]) ).
cnf(c_0_159,plain,
join(X1,meet(join(X1,X2),X3)) = join(X1,meet(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_153,c_0_154]),c_0_53]),c_0_54]),c_0_101]),c_0_53]),c_0_54]) ).
cnf(c_0_160,plain,
meet(X1,composition(meet(composition(X1,converse(X2)),X3),X2)) = meet(X1,composition(X3,X2)),
inference(spm,[status(thm)],[c_0_155,c_0_30]) ).
cnf(c_0_161,plain,
meet(composition(X1,X2),meet(composition(X1,top),X3)) = meet(composition(X1,X2),X3),
inference(spm,[status(thm)],[c_0_147,c_0_156]) ).
cnf(c_0_162,plain,
meet(join(X1,X2),join(X2,complement(X1))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_115]),c_0_81]),c_0_141]) ).
cnf(c_0_163,negated_conjecture,
join(esk1_0,composition(meet(esk1_0,X1),X2)) = esk1_0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_157,c_0_67]),c_0_146]) ).
cnf(c_0_164,negated_conjecture,
( join(composition(meet(esk2_0,esk1_0),esk3_0),meet(esk1_0,composition(esk2_0,esk3_0))) != composition(meet(esk2_0,esk1_0),esk3_0)
| join(composition(meet(esk2_0,esk1_0),esk3_0),meet(esk1_0,composition(esk2_0,esk3_0))) != meet(esk1_0,composition(esk2_0,esk3_0)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_158,c_0_26]),c_0_30]),c_0_30]),c_0_30]) ).
cnf(c_0_165,plain,
join(X1,meet(X2,X3)) = meet(join(X1,X2),join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_150,c_0_114]),c_0_159]) ).
cnf(c_0_166,negated_conjecture,
join(esk1_0,composition(meet(X1,esk1_0),X2)) = esk1_0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_157,c_0_117]),c_0_146]) ).
cnf(c_0_167,plain,
meet(X1,composition(meet(composition(X1,top),X2),X3)) = meet(X1,composition(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_160,c_0_161]),c_0_160]) ).
cnf(c_0_168,negated_conjecture,
meet(esk1_0,composition(meet(esk1_0,X1),X2)) = composition(meet(esk1_0,X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_162,c_0_163]),c_0_91]) ).
cnf(c_0_169,negated_conjecture,
meet(esk1_0,composition(esk2_0,esk3_0)) != composition(meet(esk2_0,esk1_0),esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_164,c_0_165]),c_0_26]),c_0_166]),c_0_110]),c_0_26]),c_0_165]),c_0_59]),c_0_114]),c_0_165]),c_0_26]),c_0_166]),c_0_110]),c_0_26]),c_0_165]),c_0_59]),c_0_114])]) ).
cnf(c_0_170,negated_conjecture,
meet(esk1_0,composition(X1,X2)) = composition(meet(esk1_0,X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_167,c_0_107]),c_0_168]) ).
cnf(c_0_171,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_169,c_0_170]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : REL033+4 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.11/0.30 % Computer : n016.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 2400
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Mon Oct 2 15:43:06 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.16/0.41 Running first-order theorem proving
% 0.16/0.41 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.7zEBIdHaJ9/E---3.1_10465.p
% 473.10/60.56 # Version: 3.1pre001
% 473.10/60.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 473.10/60.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 473.10/60.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 473.10/60.56 # Starting new_bool_3 with 300s (1) cores
% 473.10/60.56 # Starting new_bool_1 with 300s (1) cores
% 473.10/60.56 # Starting sh5l with 300s (1) cores
% 473.10/60.56 # sh5l with pid 10546 completed with status 0
% 473.10/60.56 # Result found by sh5l
% 473.10/60.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 473.10/60.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 473.10/60.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 473.10/60.56 # Starting new_bool_3 with 300s (1) cores
% 473.10/60.56 # Starting new_bool_1 with 300s (1) cores
% 473.10/60.56 # Starting sh5l with 300s (1) cores
% 473.10/60.56 # SinE strategy is gf500_gu_R04_F100_L20000
% 473.10/60.56 # Search class: FUHPM-FFMF21-DFFFFFNN
% 473.10/60.56 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 473.10/60.56 # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 163s (1) cores
% 473.10/60.56 # H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with pid 10553 completed with status 0
% 473.10/60.56 # Result found by H----_047_B31_F1_PI_AE_R4_CS_SP_S2S
% 473.10/60.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 473.10/60.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 473.10/60.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 473.10/60.56 # Starting new_bool_3 with 300s (1) cores
% 473.10/60.56 # Starting new_bool_1 with 300s (1) cores
% 473.10/60.56 # Starting sh5l with 300s (1) cores
% 473.10/60.56 # SinE strategy is gf500_gu_R04_F100_L20000
% 473.10/60.56 # Search class: FUHPM-FFMF21-DFFFFFNN
% 473.10/60.56 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 473.10/60.56 # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 163s (1) cores
% 473.10/60.56 # Preprocessing time : 0.001 s
% 473.10/60.56
% 473.10/60.56 # Proof found!
% 473.10/60.56 # SZS status Theorem
% 473.10/60.56 # SZS output start CNFRefutation
% See solution above
% 473.10/60.56 # Parsed axioms : 17
% 473.10/60.56 # Removed by relevancy pruning/SinE : 1
% 473.10/60.56 # Initial clauses : 17
% 473.10/60.56 # Removed in clause preprocessing : 0
% 473.10/60.56 # Initial clauses in saturation : 17
% 473.10/60.56 # Processed clauses : 55916
% 473.10/60.56 # ...of these trivial : 31130
% 473.10/60.56 # ...subsumed : 20753
% 473.10/60.56 # ...remaining for further processing : 4033
% 473.10/60.56 # Other redundant clauses eliminated : 0
% 473.10/60.56 # Clauses deleted for lack of memory : 212229
% 473.10/60.56 # Backward-subsumed : 0
% 473.10/60.56 # Backward-rewritten : 1075
% 473.10/60.56 # Generated clauses : 2830134
% 473.10/60.56 # ...of the previous two non-redundant : 1542082
% 473.10/60.56 # ...aggressively subsumed : 0
% 473.10/60.56 # Contextual simplify-reflections : 0
% 473.10/60.56 # Paramodulations : 2830134
% 473.10/60.56 # Factorizations : 0
% 473.10/60.56 # NegExts : 0
% 473.10/60.56 # Equation resolutions : 0
% 473.10/60.56 # Total rewrite steps : 9612987
% 473.10/60.56 # Propositional unsat checks : 0
% 473.10/60.56 # Propositional check models : 0
% 473.10/60.56 # Propositional check unsatisfiable : 0
% 473.10/60.56 # Propositional clauses : 0
% 473.10/60.56 # Propositional clauses after purity: 0
% 473.10/60.56 # Propositional unsat core size : 0
% 473.10/60.56 # Propositional preprocessing time : 0.000
% 473.10/60.56 # Propositional encoding time : 0.000
% 473.10/60.56 # Propositional solver time : 0.000
% 473.10/60.56 # Success case prop preproc time : 0.000
% 473.10/60.56 # Success case prop encoding time : 0.000
% 473.10/60.56 # Success case prop solver time : 0.000
% 473.10/60.56 # Current number of processed clauses : 2958
% 473.10/60.56 # Positive orientable unit clauses : 2869
% 473.10/60.56 # Positive unorientable unit clauses: 89
% 473.10/60.56 # Negative unit clauses : 0
% 473.10/60.56 # Non-unit-clauses : 0
% 473.10/60.56 # Current number of unprocessed clauses: 745332
% 473.10/60.56 # ...number of literals in the above : 745332
% 473.10/60.56 # Current number of archived formulas : 0
% 473.10/60.56 # Current number of archived clauses : 1075
% 473.10/60.56 # Clause-clause subsumption calls (NU) : 0
% 473.10/60.56 # Rec. Clause-clause subsumption calls : 0
% 473.10/60.56 # Non-unit clause-clause subsumptions : 0
% 473.10/60.56 # Unit Clause-clause subsumption calls : 1770
% 473.10/60.56 # Rewrite failures with RHS unbound : 5695
% 473.10/60.56 # BW rewrite match attempts : 34128
% 473.10/60.56 # BW rewrite match successes : 6178
% 473.10/60.56 # Condensation attempts : 0
% 473.10/60.56 # Condensation successes : 0
% 473.10/60.56 # Termbank termtop insertions : 56819413
% 473.10/60.56
% 473.10/60.56 # -------------------------------------------------
% 473.10/60.56 # User time : 56.684 s
% 473.10/60.56 # System time : 1.559 s
% 473.10/60.56 # Total time : 58.243 s
% 473.10/60.56 # Maximum resident set size: 1760 pages
% 473.10/60.56
% 473.10/60.56 # -------------------------------------------------
% 473.10/60.56 # User time : 56.686 s
% 473.10/60.56 # System time : 1.562 s
% 473.10/60.56 # Total time : 58.248 s
% 473.10/60.56 # Maximum resident set size: 1724 pages
% 473.10/60.56 % E---3.1 exiting
% 473.10/60.57 % E---3.1 exiting
%------------------------------------------------------------------------------