TSTP Solution File: REL044+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : REL044+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:55 EDT 2023
% Result : Theorem 4.21s 0.98s
% Output : CNFRefutation 4.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 16
% Syntax : Number of formulae : 115 ( 112 unt; 0 def)
% Number of atoms : 118 ( 117 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 4 ~; 0 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 173 ( 12 sgn; 68 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(converse_multiplicativity,axiom,
! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox2/tmp/tmp.vfNv4eeNlg/E---3.1_15222.p',converse_multiplicativity) ).
fof(converse_idempotence,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.vfNv4eeNlg/E---3.1_15222.p',converse_idempotence) ).
fof(composition_identity,axiom,
! [X1] : composition(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/tmp.vfNv4eeNlg/E---3.1_15222.p',composition_identity) ).
fof(converse_cancellativity,axiom,
! [X1,X2] : join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox2/tmp/tmp.vfNv4eeNlg/E---3.1_15222.p',converse_cancellativity) ).
fof(maddux1_join_commutativity,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.vfNv4eeNlg/E---3.1_15222.p',maddux1_join_commutativity) ).
fof(def_zero,axiom,
! [X1] : zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox2/tmp/tmp.vfNv4eeNlg/E---3.1_15222.p',def_zero) ).
fof(maddux4_definiton_of_meet,axiom,
! [X1,X2] : meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox2/tmp/tmp.vfNv4eeNlg/E---3.1_15222.p',maddux4_definiton_of_meet) ).
fof(def_top,axiom,
! [X1] : top = join(X1,complement(X1)),
file('/export/starexec/sandbox2/tmp/tmp.vfNv4eeNlg/E---3.1_15222.p',def_top) ).
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/sandbox2/tmp/tmp.vfNv4eeNlg/E---3.1_15222.p',maddux3_a_kind_of_de_Morgan) ).
fof(maddux2_join_associativity,axiom,
! [X1,X2,X3] : join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.vfNv4eeNlg/E---3.1_15222.p',maddux2_join_associativity) ).
fof(converse_additivity,axiom,
! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox2/tmp/tmp.vfNv4eeNlg/E---3.1_15222.p',converse_additivity) ).
fof(goals,conjecture,
! [X1,X2,X3] :
( join(composition(complement(X1),X2),complement(X3)) = complement(X3)
=> join(composition(X3,converse(X2)),X1) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.vfNv4eeNlg/E---3.1_15222.p',goals) ).
fof(modular_law_1,axiom,
! [X1,X2,X3] : join(meet(composition(X1,X2),X3),meet(composition(X1,meet(X2,composition(converse(X1),X3))),X3)) = meet(composition(X1,meet(X2,composition(converse(X1),X3))),X3),
file('/export/starexec/sandbox2/tmp/tmp.vfNv4eeNlg/E---3.1_15222.p',modular_law_1) ).
fof(composition_distributivity,axiom,
! [X1,X2,X3] : composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.vfNv4eeNlg/E---3.1_15222.p',composition_distributivity) ).
fof(composition_associativity,axiom,
! [X1,X2,X3] : composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.vfNv4eeNlg/E---3.1_15222.p',composition_associativity) ).
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/sandbox2/tmp/tmp.vfNv4eeNlg/E---3.1_15222.p',dedekind_law) ).
fof(c_0_16,plain,
! [X23,X24] : converse(composition(X23,X24)) = composition(converse(X24),converse(X23)),
inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).
fof(c_0_17,plain,
! [X20] : converse(converse(X20)) = X20,
inference(variable_rename,[status(thm)],[converse_idempotence]) ).
cnf(c_0_18,plain,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,plain,
converse(converse(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_20,plain,
! [X16] : composition(X16,one) = X16,
inference(variable_rename,[status(thm)],[composition_identity]) ).
cnf(c_0_21,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
composition(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_23,plain,
! [X25,X26] : join(composition(converse(X25),complement(composition(X25,X26))),complement(X26)) = complement(X26),
inference(variable_rename,[status(thm)],[converse_cancellativity]) ).
fof(c_0_24,plain,
! [X4,X5] : join(X4,X5) = join(X5,X4),
inference(variable_rename,[status(thm)],[maddux1_join_commutativity]) ).
cnf(c_0_25,plain,
composition(converse(one),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_19]) ).
fof(c_0_26,plain,
! [X28] : zero = meet(X28,complement(X28)),
inference(variable_rename,[status(thm)],[def_zero]) ).
fof(c_0_27,plain,
! [X11,X12] : meet(X11,X12) = complement(join(complement(X11),complement(X12))),
inference(variable_rename,[status(thm)],[maddux4_definiton_of_meet]) ).
cnf(c_0_28,plain,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_22,c_0_25]) ).
cnf(c_0_31,plain,
zero = meet(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,plain,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_33,plain,
! [X27] : top = join(X27,complement(X27)),
inference(variable_rename,[status(thm)],[def_top]) ).
cnf(c_0_34,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_25,c_0_30]) ).
cnf(c_0_36,plain,
zero = complement(join(complement(X1),complement(complement(X1)))),
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,plain,
top = join(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_38,plain,
! [X9,X10] : X9 = join(complement(join(complement(X9),complement(X10))),complement(join(complement(X9),X10))),
inference(variable_rename,[status(thm)],[maddux3_a_kind_of_de_Morgan]) ).
fof(c_0_39,plain,
! [X6,X7,X8] : join(X6,join(X7,X8)) = join(join(X6,X7),X8),
inference(variable_rename,[status(thm)],[maddux2_join_associativity]) ).
cnf(c_0_40,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_30]),c_0_35]) ).
cnf(c_0_41,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_43,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_44,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_42,c_0_29]) ).
cnf(c_0_46,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,plain,
join(zero,complement(complement(X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_40]),c_0_37]),c_0_41]),c_0_29]) ).
cnf(c_0_48,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_49,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_47,c_0_48]) ).
fof(c_0_50,plain,
! [X21,X22] : converse(join(X21,X22)) = join(converse(X21),converse(X22)),
inference(variable_rename,[status(thm)],[converse_additivity]) ).
cnf(c_0_51,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_40,c_0_49]) ).
cnf(c_0_52,plain,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_53,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_43,c_0_51]) ).
cnf(c_0_54,plain,
converse(join(converse(X1),X2)) = join(X1,converse(X2)),
inference(spm,[status(thm)],[c_0_52,c_0_19]) ).
cnf(c_0_55,plain,
join(X1,top) = top,
inference(spm,[status(thm)],[c_0_53,c_0_37]) ).
fof(c_0_56,negated_conjecture,
~ ! [X1,X2,X3] :
( join(composition(complement(X1),X2),complement(X3)) = complement(X3)
=> join(composition(X3,converse(X2)),X1) = X1 ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_57,plain,
join(X1,converse(complement(converse(X1)))) = converse(top),
inference(spm,[status(thm)],[c_0_54,c_0_37]) ).
cnf(c_0_58,plain,
join(top,X1) = top,
inference(spm,[status(thm)],[c_0_29,c_0_55]) ).
fof(c_0_59,negated_conjecture,
( join(composition(complement(esk1_0),esk2_0),complement(esk3_0)) = complement(esk3_0)
& join(composition(esk3_0,converse(esk2_0)),esk1_0) != esk1_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_56])])]) ).
cnf(c_0_60,plain,
converse(top) = top,
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
fof(c_0_61,plain,
! [X32,X33,X34] : join(meet(composition(X32,X33),X34),meet(composition(X32,meet(X33,composition(converse(X32),X34))),X34)) = meet(composition(X32,meet(X33,composition(converse(X32),X34))),X34),
inference(variable_rename,[status(thm)],[modular_law_1]) ).
cnf(c_0_62,negated_conjecture,
join(composition(complement(esk1_0),esk2_0),complement(esk3_0)) = complement(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_63,plain,
join(complement(converse(X1)),composition(X2,complement(converse(composition(X1,X2))))) = complement(converse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_18]),c_0_19]) ).
cnf(c_0_64,plain,
converse(composition(top,X1)) = composition(converse(X1),top),
inference(spm,[status(thm)],[c_0_21,c_0_60]) ).
cnf(c_0_65,plain,
join(meet(composition(X1,X2),X3),meet(composition(X1,meet(X2,composition(converse(X1),X3))),X3)) = meet(composition(X1,meet(X2,composition(converse(X1),X3))),X3),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_66,negated_conjecture,
join(complement(esk3_0),composition(complement(esk1_0),esk2_0)) = complement(esk3_0),
inference(rw,[status(thm)],[c_0_62,c_0_29]) ).
fof(c_0_67,plain,
! [X17,X18,X19] : composition(join(X17,X18),X19) = join(composition(X17,X19),composition(X18,X19)),
inference(variable_rename,[status(thm)],[composition_distributivity]) ).
cnf(c_0_68,plain,
composition(X1,complement(composition(converse(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_63,c_0_64]),c_0_60]),c_0_41]),c_0_48]),c_0_60]),c_0_41]) ).
cnf(c_0_69,plain,
join(complement(join(complement(composition(X1,X2)),complement(X3))),complement(join(complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))),complement(X3)))) = complement(join(complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))),complement(X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_32]),c_0_32]),c_0_32]),c_0_32]),c_0_32]) ).
cnf(c_0_70,negated_conjecture,
join(complement(esk3_0),join(composition(complement(esk1_0),esk2_0),X1)) = join(complement(esk3_0),X1),
inference(spm,[status(thm)],[c_0_43,c_0_66]) ).
fof(c_0_71,plain,
! [X13,X14,X15] : composition(X13,composition(X14,X15)) = composition(composition(X13,X14),X15),
inference(variable_rename,[status(thm)],[composition_associativity]) ).
cnf(c_0_72,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_73,plain,
composition(top,complement(composition(top,top))) = zero,
inference(spm,[status(thm)],[c_0_68,c_0_60]) ).
cnf(c_0_74,plain,
join(complement(join(complement(composition(X1,X2)),complement(X3))),complement(join(complement(X3),complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3))))))))) = complement(join(complement(X3),complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_29]),c_0_29]) ).
cnf(c_0_75,negated_conjecture,
join(complement(esk3_0),complement(composition(complement(esk1_0),esk2_0))) = join(top,complement(esk3_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_37]),c_0_29]) ).
cnf(c_0_76,plain,
composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_77,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_72,c_0_73]),c_0_48]),c_0_58]),c_0_73]) ).
cnf(c_0_78,plain,
join(complement(join(complement(composition(converse(X1),X2)),complement(X3))),complement(join(complement(X3),complement(composition(converse(X1),complement(join(complement(X2),complement(composition(X1,X3))))))))) = complement(join(complement(X3),complement(composition(converse(X1),complement(join(complement(X2),complement(composition(X1,X3)))))))),
inference(spm,[status(thm)],[c_0_74,c_0_19]) ).
cnf(c_0_79,negated_conjecture,
join(complement(esk3_0),complement(composition(complement(esk1_0),esk2_0))) = top,
inference(rw,[status(thm)],[c_0_75,c_0_58]) ).
cnf(c_0_80,plain,
composition(X1,zero) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_77]) ).
cnf(c_0_81,plain,
complement(zero) = top,
inference(spm,[status(thm)],[c_0_37,c_0_48]) ).
cnf(c_0_82,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_48]) ).
cnf(c_0_83,negated_conjecture,
complement(join(complement(esk2_0),complement(composition(converse(complement(esk1_0)),esk3_0)))) = 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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_41]),c_0_80]),c_0_81]),c_0_55]),c_0_41]),c_0_82]),c_0_41]),c_0_80]),c_0_81]),c_0_55]),c_0_41]),c_0_29]) ).
cnf(c_0_84,plain,
join(X1,complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_45]),c_0_29]) ).
cnf(c_0_85,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_53,c_0_29]) ).
cnf(c_0_86,negated_conjecture,
complement(join(complement(esk2_0),composition(converse(complement(esk1_0)),esk3_0))) = esk2_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_83]),c_0_49]),c_0_48]) ).
cnf(c_0_87,plain,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(spm,[status(thm)],[c_0_29,c_0_43]) ).
cnf(c_0_88,plain,
join(X1,complement(join(X2,complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_89,plain,
converse(join(X1,composition(converse(X2),X3))) = join(converse(X1),composition(converse(X3),X2)),
inference(spm,[status(thm)],[c_0_52,c_0_21]) ).
cnf(c_0_90,negated_conjecture,
join(complement(esk2_0),composition(converse(complement(esk1_0)),esk3_0)) = complement(esk2_0),
inference(spm,[status(thm)],[c_0_49,c_0_86]) ).
cnf(c_0_91,plain,
join(X1,join(complement(X1),X2)) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_37]),c_0_55]) ).
cnf(c_0_92,plain,
join(complement(X1),complement(join(X2,X1))) = complement(X1),
inference(spm,[status(thm)],[c_0_88,c_0_49]) ).
cnf(c_0_93,negated_conjecture,
join(converse(complement(esk2_0)),composition(converse(esk3_0),complement(esk1_0))) = converse(complement(esk2_0)),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_94,plain,
join(X1,converse(join(complement(converse(X1)),X2))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_91]),c_0_60]) ).
cnf(c_0_95,negated_conjecture,
join(complement(converse(complement(esk2_0))),complement(composition(converse(esk3_0),complement(esk1_0)))) = complement(composition(converse(esk3_0),complement(esk1_0))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_29]) ).
cnf(c_0_96,negated_conjecture,
join(complement(esk2_0),converse(complement(composition(converse(esk3_0),complement(esk1_0))))) = top,
inference(spm,[status(thm)],[c_0_94,c_0_95]) ).
fof(c_0_97,plain,
! [X29,X30,X31] : join(meet(composition(X29,X30),X31),composition(meet(X29,composition(X31,converse(X30))),meet(X30,composition(converse(X29),X31)))) = composition(meet(X29,composition(X31,converse(X30))),meet(X30,composition(converse(X29),X31))),
inference(variable_rename,[status(thm)],[dedekind_law]) ).
cnf(c_0_98,negated_conjecture,
complement(join(complement(esk2_0),complement(converse(complement(composition(converse(esk3_0),complement(esk1_0))))))) = esk2_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_96]),c_0_41]),c_0_48]) ).
cnf(c_0_99,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_97]) ).
cnf(c_0_100,plain,
join(converse(X1),join(converse(X2),X3)) = join(converse(join(X1,X2)),X3),
inference(spm,[status(thm)],[c_0_43,c_0_52]) ).
cnf(c_0_101,plain,
join(X1,join(X2,complement(X1))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_49]),c_0_87]) ).
cnf(c_0_102,negated_conjecture,
join(complement(esk2_0),complement(converse(complement(composition(converse(esk3_0),complement(esk1_0)))))) = complement(esk2_0),
inference(spm,[status(thm)],[c_0_49,c_0_98]) ).
cnf(c_0_103,plain,
join(complement(join(complement(composition(X1,X2)),complement(X3))),composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),complement(join(complement(X2),complement(composition(converse(X1),X3)))))) = composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),complement(join(complement(X2),complement(composition(converse(X1),X3))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_32]),c_0_32]),c_0_32]),c_0_32]),c_0_32]) ).
cnf(c_0_104,plain,
join(complement(converse(X1)),converse(join(X1,X2))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_29]) ).
cnf(c_0_105,negated_conjecture,
join(esk2_0,converse(complement(composition(converse(esk3_0),complement(esk1_0))))) = converse(complement(composition(converse(esk3_0),complement(esk1_0)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_102]),c_0_49]),c_0_49]),c_0_49]),c_0_29]) ).
cnf(c_0_106,plain,
join(complement(composition(complement(join(complement(X1),complement(composition(X2,converse(X3))))),complement(join(complement(X3),complement(composition(converse(X1),X2)))))),complement(join(complement(join(complement(composition(X1,X3)),complement(X2))),complement(composition(complement(join(complement(X1),complement(composition(X2,converse(X3))))),complement(join(complement(X3),complement(composition(converse(X1),X2))))))))) = join(complement(composition(X1,X3)),complement(X2)),
inference(spm,[status(thm)],[c_0_45,c_0_103]) ).
cnf(c_0_107,negated_conjecture,
join(complement(converse(esk2_0)),complement(composition(converse(esk3_0),complement(esk1_0)))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_19]) ).
cnf(c_0_108,plain,
join(complement(join(X1,complement(X2))),complement(join(complement(X2),complement(X1)))) = X2,
inference(spm,[status(thm)],[c_0_45,c_0_29]) ).
cnf(c_0_109,negated_conjecture,
join(esk1_0,complement(composition(esk3_0,converse(esk2_0)))) = top,
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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_107]),c_0_19]),c_0_75]),c_0_58]),c_0_41]),c_0_41]),c_0_80]),c_0_81]),c_0_49]),c_0_19]),c_0_75]),c_0_58]),c_0_41]),c_0_41]),c_0_80]),c_0_81]),c_0_55]),c_0_41]),c_0_82]),c_0_49]),c_0_29]) ).
cnf(c_0_110,negated_conjecture,
join(composition(esk3_0,converse(esk2_0)),esk1_0) != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_111,plain,
join(complement(X1),complement(join(X1,X2))) = complement(X1),
inference(spm,[status(thm)],[c_0_84,c_0_49]) ).
cnf(c_0_112,negated_conjecture,
complement(join(complement(esk1_0),complement(composition(esk3_0,converse(esk2_0))))) = composition(esk3_0,converse(esk2_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_109]),c_0_41]),c_0_48]),c_0_29]) ).
cnf(c_0_113,negated_conjecture,
join(esk1_0,composition(esk3_0,converse(esk2_0))) != esk1_0,
inference(rw,[status(thm)],[c_0_110,c_0_29]) ).
cnf(c_0_114,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_49]),c_0_49]),c_0_113]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : REL044+2 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n005.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 15:11:01 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.vfNv4eeNlg/E---3.1_15222.p
% 4.21/0.98 # Version: 3.1pre001
% 4.21/0.98 # Preprocessing class: FSMSSMSSSSSNFFN.
% 4.21/0.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.21/0.98 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.21/0.98 # Starting new_bool_3 with 300s (1) cores
% 4.21/0.98 # Starting new_bool_1 with 300s (1) cores
% 4.21/0.98 # Starting sh5l with 300s (1) cores
% 4.21/0.98 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 15300 completed with status 0
% 4.21/0.98 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 4.21/0.98 # Preprocessing class: FSMSSMSSSSSNFFN.
% 4.21/0.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.21/0.98 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.21/0.98 # No SInE strategy applied
% 4.21/0.98 # Search class: FUUPM-FFMF21-DFFFFFNN
% 4.21/0.98 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 4.21/0.98 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 811s (1) cores
% 4.21/0.98 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 4.21/0.98 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 136s (1) cores
% 4.21/0.98 # Starting new_bool_3 with 136s (1) cores
% 4.21/0.98 # Starting new_bool_1 with 136s (1) cores
% 4.21/0.98 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 15305 completed with status 0
% 4.21/0.98 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 4.21/0.98 # Preprocessing class: FSMSSMSSSSSNFFN.
% 4.21/0.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.21/0.98 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.21/0.98 # No SInE strategy applied
% 4.21/0.98 # Search class: FUUPM-FFMF21-DFFFFFNN
% 4.21/0.98 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 4.21/0.98 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 811s (1) cores
% 4.21/0.98 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 4.21/0.98 # Preprocessing time : 0.001 s
% 4.21/0.98 # Presaturation interreduction done
% 4.21/0.98
% 4.21/0.98 # Proof found!
% 4.21/0.98 # SZS status Theorem
% 4.21/0.98 # SZS output start CNFRefutation
% See solution above
% 4.21/0.98 # Parsed axioms : 17
% 4.21/0.98 # Removed by relevancy pruning/SinE : 0
% 4.21/0.98 # Initial clauses : 18
% 4.21/0.98 # Removed in clause preprocessing : 1
% 4.21/0.98 # Initial clauses in saturation : 17
% 4.21/0.98 # Processed clauses : 1509
% 4.21/0.98 # ...of these trivial : 868
% 4.21/0.98 # ...subsumed : 81
% 4.21/0.98 # ...remaining for further processing : 560
% 4.21/0.98 # Other redundant clauses eliminated : 0
% 4.21/0.98 # Clauses deleted for lack of memory : 0
% 4.21/0.98 # Backward-subsumed : 0
% 4.21/0.98 # Backward-rewritten : 134
% 4.21/0.98 # Generated clauses : 34880
% 4.21/0.98 # ...of the previous two non-redundant : 21294
% 4.21/0.98 # ...aggressively subsumed : 0
% 4.21/0.98 # Contextual simplify-reflections : 0
% 4.21/0.98 # Paramodulations : 34880
% 4.21/0.98 # Factorizations : 0
% 4.21/0.98 # NegExts : 0
% 4.21/0.98 # Equation resolutions : 0
% 4.21/0.98 # Total rewrite steps : 85911
% 4.21/0.98 # Propositional unsat checks : 0
% 4.21/0.98 # Propositional check models : 0
% 4.21/0.98 # Propositional check unsatisfiable : 0
% 4.21/0.98 # Propositional clauses : 0
% 4.21/0.98 # Propositional clauses after purity: 0
% 4.21/0.98 # Propositional unsat core size : 0
% 4.21/0.98 # Propositional preprocessing time : 0.000
% 4.21/0.98 # Propositional encoding time : 0.000
% 4.21/0.98 # Propositional solver time : 0.000
% 4.21/0.98 # Success case prop preproc time : 0.000
% 4.21/0.98 # Success case prop encoding time : 0.000
% 4.21/0.98 # Success case prop solver time : 0.000
% 4.21/0.98 # Current number of processed clauses : 409
% 4.21/0.98 # Positive orientable unit clauses : 402
% 4.21/0.98 # Positive unorientable unit clauses: 6
% 4.21/0.98 # Negative unit clauses : 1
% 4.21/0.98 # Non-unit-clauses : 0
% 4.21/0.98 # Current number of unprocessed clauses: 19480
% 4.21/0.98 # ...number of literals in the above : 19480
% 4.21/0.98 # Current number of archived formulas : 0
% 4.21/0.98 # Current number of archived clauses : 152
% 4.21/0.98 # Clause-clause subsumption calls (NU) : 0
% 4.21/0.98 # Rec. Clause-clause subsumption calls : 0
% 4.21/0.98 # Non-unit clause-clause subsumptions : 0
% 4.21/0.98 # Unit Clause-clause subsumption calls : 60
% 4.21/0.98 # Rewrite failures with RHS unbound : 0
% 4.21/0.98 # BW rewrite match attempts : 3507
% 4.21/0.98 # BW rewrite match successes : 239
% 4.21/0.98 # Condensation attempts : 0
% 4.21/0.98 # Condensation successes : 0
% 4.21/0.98 # Termbank termtop insertions : 923955
% 4.21/0.98
% 4.21/0.98 # -------------------------------------------------
% 4.21/0.98 # User time : 0.490 s
% 4.21/0.98 # System time : 0.028 s
% 4.21/0.98 # Total time : 0.518 s
% 4.21/0.98 # Maximum resident set size: 1744 pages
% 4.21/0.98
% 4.21/0.98 # -------------------------------------------------
% 4.21/0.98 # User time : 2.522 s
% 4.21/0.98 # System time : 0.070 s
% 4.21/0.98 # Total time : 2.592 s
% 4.21/0.98 # Maximum resident set size: 1688 pages
% 4.21/0.98 % E---3.1 exiting
% 4.21/0.99 % E---3.1 exiting
%------------------------------------------------------------------------------