TSTP Solution File: REL028+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : REL028+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:14:20 EDT 2023
% Result : Theorem 8.53s 1.68s
% Output : CNFRefutation 8.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 13
% Syntax : Number of formulae : 138 ( 135 unt; 0 def)
% Number of atoms : 144 ( 143 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 9 ( 3 ~; 0 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 1 avg)
% Maximal term depth : 6 ( 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 : 206 ( 10 sgn; 48 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(converse_multiplicativity,axiom,
! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox2/tmp/tmp.fJM1vEqNtF/E---3.1_30175.p',converse_multiplicativity) ).
fof(converse_idempotence,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.fJM1vEqNtF/E---3.1_30175.p',converse_idempotence) ).
fof(composition_identity,axiom,
! [X1] : composition(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/tmp.fJM1vEqNtF/E---3.1_30175.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.fJM1vEqNtF/E---3.1_30175.p',converse_cancellativity) ).
fof(maddux1_join_commutativity,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.fJM1vEqNtF/E---3.1_30175.p',maddux1_join_commutativity) ).
fof(maddux2_join_associativity,axiom,
! [X1,X2,X3] : join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.fJM1vEqNtF/E---3.1_30175.p',maddux2_join_associativity) ).
fof(def_top,axiom,
! [X1] : top = join(X1,complement(X1)),
file('/export/starexec/sandbox2/tmp/tmp.fJM1vEqNtF/E---3.1_30175.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.fJM1vEqNtF/E---3.1_30175.p',maddux3_a_kind_of_de_Morgan) ).
fof(maddux4_definiton_of_meet,axiom,
! [X1,X2] : meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox2/tmp/tmp.fJM1vEqNtF/E---3.1_30175.p',maddux4_definiton_of_meet) ).
fof(def_zero,axiom,
! [X1] : zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox2/tmp/tmp.fJM1vEqNtF/E---3.1_30175.p',def_zero) ).
fof(converse_additivity,axiom,
! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox2/tmp/tmp.fJM1vEqNtF/E---3.1_30175.p',converse_additivity) ).
fof(goals,conjecture,
! [X1,X2] :
( ( join(X1,one) = one
& join(X2,one) = one )
=> composition(X1,X2) = meet(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.fJM1vEqNtF/E---3.1_30175.p',goals) ).
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.fJM1vEqNtF/E---3.1_30175.p',composition_distributivity) ).
fof(c_0_13,plain,
! [X16,X17] : converse(composition(X16,X17)) = composition(converse(X17),converse(X16)),
inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).
fof(c_0_14,plain,
! [X30] : converse(converse(X30)) = X30,
inference(variable_rename,[status(thm)],[converse_idempotence]) ).
cnf(c_0_15,plain,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
converse(converse(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X12] : composition(X12,one) = X12,
inference(variable_rename,[status(thm)],[composition_identity]) ).
cnf(c_0_18,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
composition(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_20,plain,
! [X18,X19] : join(composition(converse(X18),complement(composition(X18,X19))),complement(X19)) = complement(X19),
inference(variable_rename,[status(thm)],[converse_cancellativity]) ).
fof(c_0_21,plain,
! [X20,X21] : join(X20,X21) = join(X21,X20),
inference(variable_rename,[status(thm)],[maddux1_join_commutativity]) ).
cnf(c_0_22,plain,
composition(converse(one),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_16]) ).
fof(c_0_23,plain,
! [X22,X23,X24] : join(X22,join(X23,X24)) = join(join(X22,X23),X24),
inference(variable_rename,[status(thm)],[maddux2_join_associativity]) ).
fof(c_0_24,plain,
! [X29] : top = join(X29,complement(X29)),
inference(variable_rename,[status(thm)],[def_top]) ).
cnf(c_0_25,plain,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_19,c_0_22]) ).
cnf(c_0_28,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
top = join(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_22,c_0_27]) ).
fof(c_0_32,plain,
! [X25,X26] : X25 = join(complement(join(complement(X25),complement(X26))),complement(join(complement(X25),X26))),
inference(variable_rename,[status(thm)],[maddux3_a_kind_of_de_Morgan]) ).
fof(c_0_33,plain,
! [X6,X7] : meet(X6,X7) = complement(join(complement(X6),complement(X7))),
inference(variable_rename,[status(thm)],[maddux4_definiton_of_meet]) ).
cnf(c_0_34,plain,
join(X1,join(complement(X1),X2)) = join(top,X2),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
join(X1,join(X2,complement(join(X1,X2)))) = top,
inference(spm,[status(thm)],[c_0_29,c_0_28]) ).
cnf(c_0_36,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_27]),c_0_31]) ).
fof(c_0_37,plain,
! [X8] : zero = meet(X8,complement(X8)),
inference(variable_rename,[status(thm)],[def_zero]) ).
cnf(c_0_38,plain,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_39,plain,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_40,plain,
join(top,complement(complement(X1))) = join(X1,top),
inference(spm,[status(thm)],[c_0_34,c_0_29]) ).
cnf(c_0_41,plain,
join(top,complement(X1)) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_29]),c_0_26]) ).
cnf(c_0_42,plain,
zero = meet(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_43,plain,
join(meet(X1,X2),complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
join(X1,top) = top,
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,plain,
complement(top) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_29]),c_0_42]) ).
cnf(c_0_46,plain,
join(zero,meet(X1,top)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_26]) ).
cnf(c_0_47,plain,
meet(X1,X2) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_26]),c_0_39]) ).
cnf(c_0_48,plain,
complement(join(zero,complement(X1))) = meet(top,X1),
inference(spm,[status(thm)],[c_0_39,c_0_45]) ).
cnf(c_0_49,plain,
join(zero,complement(complement(X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_36]),c_0_42]) ).
cnf(c_0_50,plain,
join(zero,meet(top,X1)) = X1,
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,plain,
meet(top,complement(X1)) = complement(X1),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_52,plain,
join(zero,complement(X1)) = complement(X1),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_53,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_49,c_0_52]) ).
cnf(c_0_54,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_36,c_0_53]) ).
cnf(c_0_55,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_28,c_0_54]) ).
fof(c_0_56,plain,
! [X27,X28] : converse(join(X27,X28)) = join(converse(X27),converse(X28)),
inference(variable_rename,[status(thm)],[converse_additivity]) ).
cnf(c_0_57,plain,
join(X1,meet(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_43]),c_0_26]) ).
cnf(c_0_58,plain,
complement(join(X1,complement(X2))) = meet(complement(X1),X2),
inference(spm,[status(thm)],[c_0_39,c_0_53]) ).
cnf(c_0_59,plain,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_60,plain,
complement(complement(X1)) = meet(X1,X1),
inference(spm,[status(thm)],[c_0_39,c_0_36]) ).
fof(c_0_61,negated_conjecture,
~ ! [X1,X2] :
( ( join(X1,one) = one
& join(X2,one) = one )
=> composition(X1,X2) = meet(X1,X2) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_62,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_57,c_0_47]) ).
cnf(c_0_63,plain,
complement(join(complement(X1),X2)) = meet(complement(X2),X1),
inference(spm,[status(thm)],[c_0_58,c_0_26]) ).
cnf(c_0_64,plain,
converse(join(converse(X1),X2)) = join(X1,converse(X2)),
inference(spm,[status(thm)],[c_0_59,c_0_16]) ).
cnf(c_0_65,plain,
join(zero,meet(X1,X1)) = X1,
inference(spm,[status(thm)],[c_0_49,c_0_60]) ).
fof(c_0_66,plain,
! [X13,X14,X15] : composition(join(X13,X14),X15) = join(composition(X13,X15),composition(X14,X15)),
inference(variable_rename,[status(thm)],[composition_distributivity]) ).
fof(c_0_67,negated_conjecture,
( join(esk1_0,one) = one
& join(esk2_0,one) = one
& composition(esk1_0,esk2_0) != meet(esk1_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_61])])]) ).
cnf(c_0_68,plain,
join(X1,join(meet(X2,X1),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_28,c_0_62]) ).
cnf(c_0_69,plain,
join(meet(X1,X2),meet(complement(X2),X1)) = X1,
inference(rw,[status(thm)],[c_0_43,c_0_63]) ).
cnf(c_0_70,plain,
join(X1,converse(complement(converse(X1)))) = converse(top),
inference(spm,[status(thm)],[c_0_64,c_0_29]) ).
cnf(c_0_71,plain,
join(top,X1) = top,
inference(spm,[status(thm)],[c_0_26,c_0_44]) ).
cnf(c_0_72,plain,
meet(X1,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_60]),c_0_65]) ).
cnf(c_0_73,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_74,negated_conjecture,
join(esk2_0,one) = one,
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_75,plain,
join(one,converse(X1)) = converse(join(one,X1)),
inference(spm,[status(thm)],[c_0_59,c_0_27]) ).
cnf(c_0_76,negated_conjecture,
join(esk1_0,one) = one,
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_77,plain,
join(X1,meet(complement(X1),X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_78,plain,
meet(complement(X1),complement(X2)) = complement(join(X1,X2)),
inference(spm,[status(thm)],[c_0_58,c_0_53]) ).
cnf(c_0_79,plain,
converse(top) = top,
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_80,plain,
join(zero,X1) = X1,
inference(rw,[status(thm)],[c_0_65,c_0_72]) ).
cnf(c_0_81,plain,
join(X1,join(X2,complement(X1))) = join(top,X2),
inference(spm,[status(thm)],[c_0_34,c_0_26]) ).
cnf(c_0_82,plain,
join(X1,composition(X2,X1)) = composition(join(one,X2),X1),
inference(spm,[status(thm)],[c_0_73,c_0_31]) ).
cnf(c_0_83,negated_conjecture,
join(one,esk2_0) = one,
inference(rw,[status(thm)],[c_0_74,c_0_26]) ).
cnf(c_0_84,plain,
join(converse(join(one,X1)),X2) = join(one,join(converse(X1),X2)),
inference(spm,[status(thm)],[c_0_28,c_0_75]) ).
cnf(c_0_85,negated_conjecture,
join(one,esk1_0) = one,
inference(rw,[status(thm)],[c_0_76,c_0_26]) ).
cnf(c_0_86,plain,
join(X1,complement(join(X1,X2))) = join(X1,complement(X2)),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_87,plain,
join(X1,converse(complement(converse(X1)))) = top,
inference(rw,[status(thm)],[c_0_70,c_0_79]) ).
cnf(c_0_88,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_80]) ).
cnf(c_0_89,plain,
join(X1,join(X2,complement(X1))) = top,
inference(rw,[status(thm)],[c_0_81,c_0_71]) ).
cnf(c_0_90,negated_conjecture,
join(X1,composition(esk2_0,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_31]) ).
cnf(c_0_91,plain,
converse(composition(X1,converse(X2))) = composition(X2,converse(X1)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_92,negated_conjecture,
join(one,join(converse(esk1_0),X1)) = join(one,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_27]) ).
cnf(c_0_93,plain,
join(X1,complement(converse(complement(converse(X1))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_45]),c_0_88]) ).
cnf(c_0_94,plain,
meet(X1,join(X2,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_89]),c_0_53]),c_0_45]),c_0_88]) ).
cnf(c_0_95,negated_conjecture,
join(X1,composition(X1,converse(esk2_0))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_90]),c_0_16]),c_0_91]) ).
cnf(c_0_96,plain,
complement(meet(complement(X1),X2)) = join(X1,complement(X2)),
inference(spm,[status(thm)],[c_0_53,c_0_58]) ).
cnf(c_0_97,negated_conjecture,
join(one,complement(converse(complement(esk1_0)))) = one,
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_93]),c_0_75]),c_0_85]),c_0_27]),c_0_16]) ).
cnf(c_0_98,plain,
meet(X1,complement(meet(X1,X2))) = meet(complement(X2),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_77]),c_0_63]),c_0_53]),c_0_47]) ).
cnf(c_0_99,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_57]),c_0_47]) ).
cnf(c_0_100,plain,
join(X1,meet(X2,complement(X1))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_77,c_0_47]) ).
cnf(c_0_101,plain,
join(one,complement(converse(complement(one)))) = one,
inference(spm,[status(thm)],[c_0_93,c_0_27]) ).
cnf(c_0_102,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_26]),c_0_28]) ).
cnf(c_0_103,plain,
join(X1,join(X2,X3)) = join(X2,join(X3,X1)),
inference(spm,[status(thm)],[c_0_28,c_0_26]) ).
cnf(c_0_104,negated_conjecture,
join(X1,composition(converse(esk2_0),X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_95]),c_0_31]),c_0_31]) ).
cnf(c_0_105,plain,
complement(join(X1,join(X2,complement(X3)))) = meet(complement(join(X1,X2)),X3),
inference(spm,[status(thm)],[c_0_58,c_0_28]) ).
cnf(c_0_106,plain,
join(complement(X1),complement(X2)) = complement(meet(X1,X2)),
inference(spm,[status(thm)],[c_0_96,c_0_53]) ).
cnf(c_0_107,plain,
join(X1,converse(meet(X2,converse(X1)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_62]),c_0_16]) ).
cnf(c_0_108,negated_conjecture,
meet(complement(one),converse(complement(esk1_0))) = complement(one),
inference(spm,[status(thm)],[c_0_58,c_0_97]) ).
cnf(c_0_109,plain,
meet(X1,join(X2,complement(X1))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_98]),c_0_96]),c_0_53]),c_0_47]),c_0_99]) ).
cnf(c_0_110,plain,
join(X1,complement(join(X2,X1))) = join(X1,complement(X2)),
inference(spm,[status(thm)],[c_0_100,c_0_78]) ).
cnf(c_0_111,plain,
meet(complement(one),converse(complement(one))) = complement(one),
inference(spm,[status(thm)],[c_0_58,c_0_101]) ).
cnf(c_0_112,plain,
join(X1,join(X2,meet(X1,X3))) = join(X2,X1),
inference(spm,[status(thm)],[c_0_102,c_0_57]) ).
cnf(c_0_113,plain,
join(composition(X1,X2),join(X3,composition(X4,X2))) = join(X3,composition(join(X4,X1),X2)),
inference(spm,[status(thm)],[c_0_103,c_0_73]) ).
cnf(c_0_114,negated_conjecture,
join(X1,composition(X1,esk2_0)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_104]),c_0_16]),c_0_15]),c_0_16]) ).
cnf(c_0_115,plain,
meet(meet(complement(X1),X2),X3) = meet(complement(X1),meet(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106]),c_0_58]),c_0_58]) ).
cnf(c_0_116,negated_conjecture,
join(complement(esk1_0),converse(complement(one))) = complement(esk1_0),
inference(spm,[status(thm)],[c_0_107,c_0_108]) ).
cnf(c_0_117,plain,
meet(join(X1,X2),join(X2,complement(X1))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_47]),c_0_94]) ).
cnf(c_0_118,plain,
join(complement(one),converse(complement(one))) = complement(one),
inference(spm,[status(thm)],[c_0_107,c_0_111]) ).
cnf(c_0_119,plain,
meet(X1,top) = X1,
inference(rw,[status(thm)],[c_0_46,c_0_80]) ).
cnf(c_0_120,plain,
join(meet(X1,X2),complement(X2)) = join(complement(X2),X1),
inference(spm,[status(thm)],[c_0_112,c_0_69]) ).
cnf(c_0_121,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_62]),c_0_47]) ).
cnf(c_0_122,negated_conjecture,
join(X1,composition(join(X1,X2),esk2_0)) = join(composition(X2,esk2_0),X1),
inference(spm,[status(thm)],[c_0_113,c_0_114]) ).
cnf(c_0_123,plain,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
inference(spm,[status(thm)],[c_0_115,c_0_53]) ).
cnf(c_0_124,negated_conjecture,
meet(esk1_0,complement(converse(complement(one)))) = esk1_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_116]),c_0_53]),c_0_47]) ).
cnf(c_0_125,plain,
converse(complement(one)) = complement(one),
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_117,c_0_118]),c_0_53]),c_0_26]),c_0_75]),c_0_29]),c_0_79]),c_0_119]) ).
cnf(c_0_126,plain,
meet(X1,join(complement(X1),X2)) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_120]),c_0_121]) ).
cnf(c_0_127,negated_conjecture,
join(X1,composition(complement(X1),esk2_0)) = join(X1,composition(top,esk2_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_29]),c_0_26]) ).
cnf(c_0_128,negated_conjecture,
meet(X1,composition(X1,esk2_0)) = composition(X1,esk2_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_114]),c_0_109]) ).
cnf(c_0_129,negated_conjecture,
meet(esk1_0,meet(one,X1)) = meet(esk1_0,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_124]),c_0_125]),c_0_53]) ).
cnf(c_0_130,negated_conjecture,
meet(composition(top,esk2_0),X1) = composition(X1,esk2_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_127]),c_0_126]),c_0_53]),c_0_47]),c_0_128]) ).
cnf(c_0_131,negated_conjecture,
meet(esk1_0,meet(X1,one)) = meet(esk1_0,X1),
inference(spm,[status(thm)],[c_0_129,c_0_47]) ).
cnf(c_0_132,negated_conjecture,
meet(composition(X1,esk2_0),X2) = composition(meet(X1,X2),esk2_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_130]),c_0_130]) ).
cnf(c_0_133,negated_conjecture,
meet(esk1_0,join(complement(one),X1)) = meet(esk1_0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_126]),c_0_131]) ).
cnf(c_0_134,negated_conjecture,
meet(X1,composition(X2,esk2_0)) = composition(meet(X2,X1),esk2_0),
inference(spm,[status(thm)],[c_0_47,c_0_132]) ).
cnf(c_0_135,plain,
meet(top,X1) = X1,
inference(spm,[status(thm)],[c_0_51,c_0_53]) ).
cnf(c_0_136,negated_conjecture,
composition(esk1_0,esk2_0) != meet(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_137,negated_conjecture,
$false,
inference(sr,[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_133,c_0_127]),c_0_133]),c_0_53]),c_0_31]),c_0_134]),c_0_135]),c_0_136]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : REL028+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n020.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 15:12:01 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.20/0.50 Running first-order model finding
% 0.20/0.50 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.fJM1vEqNtF/E---3.1_30175.p
% 8.53/1.68 # Version: 3.1pre001
% 8.53/1.68 # Preprocessing class: FSMSSMSSSSSNFFN.
% 8.53/1.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.53/1.68 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.53/1.68 # Starting new_bool_3 with 300s (1) cores
% 8.53/1.68 # Starting new_bool_1 with 300s (1) cores
% 8.53/1.68 # Starting sh5l with 300s (1) cores
% 8.53/1.68 # sh5l with pid 30255 completed with status 0
% 8.53/1.68 # Result found by sh5l
% 8.53/1.68 # Preprocessing class: FSMSSMSSSSSNFFN.
% 8.53/1.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.53/1.68 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.53/1.68 # Starting new_bool_3 with 300s (1) cores
% 8.53/1.68 # Starting new_bool_1 with 300s (1) cores
% 8.53/1.68 # Starting sh5l with 300s (1) cores
% 8.53/1.68 # SinE strategy is gf500_gu_R04_F100_L20000
% 8.53/1.68 # Search class: FUUPM-FFSF21-MFFFFFNN
% 8.53/1.68 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 8.53/1.68 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 8.53/1.68 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 30260 completed with status 0
% 8.53/1.68 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 8.53/1.68 # Preprocessing class: FSMSSMSSSSSNFFN.
% 8.53/1.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.53/1.68 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.53/1.68 # Starting new_bool_3 with 300s (1) cores
% 8.53/1.68 # Starting new_bool_1 with 300s (1) cores
% 8.53/1.68 # Starting sh5l with 300s (1) cores
% 8.53/1.68 # SinE strategy is gf500_gu_R04_F100_L20000
% 8.53/1.68 # Search class: FUUPM-FFSF21-MFFFFFNN
% 8.53/1.68 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 8.53/1.68 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 8.53/1.68 # Preprocessing time : 0.001 s
% 8.53/1.68 # Presaturation interreduction done
% 8.53/1.68
% 8.53/1.68 # Proof found!
% 8.53/1.68 # SZS status Theorem
% 8.53/1.68 # SZS output start CNFRefutation
% See solution above
% 8.53/1.68 # Parsed axioms : 14
% 8.53/1.68 # Removed by relevancy pruning/SinE : 0
% 8.53/1.68 # Initial clauses : 16
% 8.53/1.68 # Removed in clause preprocessing : 0
% 8.53/1.68 # Initial clauses in saturation : 16
% 8.53/1.68 # Processed clauses : 5907
% 8.53/1.68 # ...of these trivial : 3676
% 8.53/1.68 # ...subsumed : 1243
% 8.53/1.68 # ...remaining for further processing : 987
% 8.53/1.68 # Other redundant clauses eliminated : 0
% 8.53/1.68 # Clauses deleted for lack of memory : 0
% 8.53/1.68 # Backward-subsumed : 0
% 8.53/1.68 # Backward-rewritten : 165
% 8.53/1.68 # Generated clauses : 133276
% 8.53/1.68 # ...of the previous two non-redundant : 64619
% 8.53/1.68 # ...aggressively subsumed : 0
% 8.53/1.68 # Contextual simplify-reflections : 0
% 8.53/1.68 # Paramodulations : 133276
% 8.53/1.68 # Factorizations : 0
% 8.53/1.68 # NegExts : 0
% 8.53/1.68 # Equation resolutions : 0
% 8.53/1.68 # Total rewrite steps : 218316
% 8.53/1.68 # Propositional unsat checks : 0
% 8.53/1.68 # Propositional check models : 0
% 8.53/1.68 # Propositional check unsatisfiable : 0
% 8.53/1.68 # Propositional clauses : 0
% 8.53/1.68 # Propositional clauses after purity: 0
% 8.53/1.68 # Propositional unsat core size : 0
% 8.53/1.69 # Propositional preprocessing time : 0.000
% 8.53/1.69 # Propositional encoding time : 0.000
% 8.53/1.69 # Propositional solver time : 0.000
% 8.53/1.69 # Success case prop preproc time : 0.000
% 8.53/1.69 # Success case prop encoding time : 0.000
% 8.53/1.69 # Success case prop solver time : 0.000
% 8.53/1.69 # Current number of processed clauses : 806
% 8.53/1.69 # Positive orientable unit clauses : 793
% 8.53/1.69 # Positive unorientable unit clauses: 12
% 8.53/1.69 # Negative unit clauses : 1
% 8.53/1.69 # Non-unit-clauses : 0
% 8.53/1.69 # Current number of unprocessed clauses: 57892
% 8.53/1.69 # ...number of literals in the above : 57892
% 8.53/1.69 # Current number of archived formulas : 0
% 8.53/1.69 # Current number of archived clauses : 181
% 8.53/1.69 # Clause-clause subsumption calls (NU) : 0
% 8.53/1.69 # Rec. Clause-clause subsumption calls : 0
% 8.53/1.69 # Non-unit clause-clause subsumptions : 0
% 8.53/1.69 # Unit Clause-clause subsumption calls : 48
% 8.53/1.69 # Rewrite failures with RHS unbound : 0
% 8.53/1.69 # BW rewrite match attempts : 2092
% 8.53/1.69 # BW rewrite match successes : 299
% 8.53/1.69 # Condensation attempts : 0
% 8.53/1.69 # Condensation successes : 0
% 8.53/1.69 # Termbank termtop insertions : 1339195
% 8.53/1.69
% 8.53/1.69 # -------------------------------------------------
% 8.53/1.69 # User time : 0.657 s
% 8.53/1.69 # System time : 0.033 s
% 8.53/1.69 # Total time : 0.690 s
% 8.53/1.69 # Maximum resident set size: 1748 pages
% 8.53/1.69
% 8.53/1.69 # -------------------------------------------------
% 8.53/1.69 # User time : 0.658 s
% 8.53/1.69 # System time : 0.035 s
% 8.53/1.69 # Total time : 0.693 s
% 8.53/1.69 # Maximum resident set size: 1680 pages
% 8.53/1.69 % E---3.1 exiting
%------------------------------------------------------------------------------