%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : REL010+2 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 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 : 300s
% WCLimit : 300s
% DateTime : Tue May 5 05:04:13 PM UTC 2026
% Result : Theorem 5.40s 4.36s
% Output : CNFRefutation 5.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 14
% Syntax : Number of formulae : 89 ( 86 unt; 0 def)
% Number of atoms : 92 ( 91 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 3 ~; 0 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 7 ( 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 : 127 ( 6 sgn 56 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(converse_multiplicativity,axiom,
! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_multiplicativity) ).
fof(converse_idempotence,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_idempotence) ).
fof(composition_identity,axiom,
! [X1] : composition(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',composition_identity) ).
fof(maddux2_join_associativity,axiom,
! [X1,X2,X3] : join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux2_join_associativity) ).
fof(def_top,axiom,
! [X1] : top = join(X1,complement(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',def_top) ).
fof(converse_cancellativity,axiom,
! [X1,X2] : join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_cancellativity) ).
fof(maddux1_join_commutativity,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux1_join_commutativity) ).
fof(converse_additivity,axiom,
! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_additivity) ).
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/benchmark/Axioms/REL001+0.ax',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/benchmark/Axioms/REL001+0.ax',maddux4_definiton_of_meet) ).
fof(def_zero,axiom,
! [X1] : zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',def_zero) ).
fof(composition_distributivity,axiom,
! [X1,X2,X3] : composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',composition_distributivity) ).
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/benchmark/Axioms/REL001+1.ax',modular_law_1) ).
fof(goals,conjecture,
! [X1,X2,X3] :
( meet(composition(X1,X2),X3) = zero
=> meet(X2,composition(converse(X1),X3)) = zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(c_0_14,plain,
! [X60,X61] : converse(composition(X60,X61)) = composition(converse(X61),converse(X60)),
inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).
fof(c_0_15,plain,
! [X57] : converse(converse(X57)) = X57,
inference(variable_rename,[status(thm)],[converse_idempotence]) ).
cnf(c_0_16,plain,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,plain,
converse(converse(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_18,plain,
! [X53] : composition(X53,one) = X53,
inference(variable_rename,[status(thm)],[composition_identity]) ).
cnf(c_0_19,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
composition(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_21,plain,
! [X43,X44,X45] : join(X43,join(X44,X45)) = join(join(X43,X44),X45),
inference(variable_rename,[status(thm)],[maddux2_join_associativity]) ).
fof(c_0_22,plain,
! [X64] : top = join(X64,complement(X64)),
inference(variable_rename,[status(thm)],[def_top]) ).
fof(c_0_23,plain,
! [X62,X63] : join(composition(converse(X62),complement(composition(X62,X63))),complement(X63)) = complement(X63),
inference(variable_rename,[status(thm)],[converse_cancellativity]) ).
fof(c_0_24,plain,
! [X41,X42] : join(X41,X42) = join(X42,X41),
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_19,c_0_20]),c_0_17]) ).
cnf(c_0_26,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
top = join(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
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_20,c_0_25]) ).
cnf(c_0_31,plain,
join(X1,join(complement(X1),X2)) = join(top,X2),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,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_33,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_25,c_0_30]) ).
fof(c_0_34,plain,
! [X58,X59] : converse(join(X58,X59)) = join(converse(X58),converse(X59)),
inference(variable_rename,[status(thm)],[converse_additivity]) ).
cnf(c_0_35,plain,
join(X1,join(X2,complement(X1))) = join(top,X2),
inference(spm,[status(thm)],[c_0_31,c_0_29]) ).
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_32,c_0_33]),c_0_30]),c_0_33]) ).
fof(c_0_37,plain,
! [X46,X47] : X46 = join(complement(join(complement(X46),complement(X47))),complement(join(complement(X46),X47))),
inference(variable_rename,[status(thm)],[maddux3_a_kind_of_de_Morgan]) ).
fof(c_0_38,plain,
! [X48,X49] : meet(X48,X49) = complement(join(complement(X48),complement(X49))),
inference(variable_rename,[status(thm)],[maddux4_definiton_of_meet]) ).
fof(c_0_39,plain,
! [X65] : zero = meet(X65,complement(X65)),
inference(variable_rename,[status(thm)],[def_zero]) ).
cnf(c_0_40,plain,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,plain,
join(top,complement(complement(X1))) = join(X1,top),
inference(spm,[status(thm)],[c_0_31,c_0_27]) ).
cnf(c_0_42,plain,
join(top,complement(X1)) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_27]) ).
cnf(c_0_43,plain,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_44,plain,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_45,plain,
zero = meet(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_46,plain,
converse(join(converse(X1),X2)) = join(X1,converse(X2)),
inference(spm,[status(thm)],[c_0_40,c_0_17]) ).
cnf(c_0_47,plain,
join(X1,top) = top,
inference(rw,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,plain,
join(meet(X1,X2),complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,plain,
complement(top) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_27]),c_0_45]) ).
cnf(c_0_50,plain,
join(X1,converse(complement(converse(X1)))) = converse(top),
inference(spm,[status(thm)],[c_0_46,c_0_27]) ).
cnf(c_0_51,plain,
join(top,X1) = top,
inference(spm,[status(thm)],[c_0_29,c_0_47]) ).
fof(c_0_52,plain,
! [X54,X55,X56] : composition(join(X54,X55),X56) = join(composition(X54,X56),composition(X55,X56)),
inference(variable_rename,[status(thm)],[composition_distributivity]) ).
cnf(c_0_53,plain,
join(zero,meet(X1,top)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_47]),c_0_49]),c_0_29]) ).
cnf(c_0_54,plain,
meet(X1,X2) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_29]),c_0_44]) ).
cnf(c_0_55,plain,
complement(join(zero,complement(X1))) = meet(top,X1),
inference(spm,[status(thm)],[c_0_44,c_0_49]) ).
cnf(c_0_56,plain,
join(zero,complement(complement(X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_36]),c_0_45]) ).
cnf(c_0_57,plain,
converse(top) = top,
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_58,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_59,plain,
join(zero,meet(top,X1)) = X1,
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_60,plain,
meet(top,complement(X1)) = complement(X1),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_61,plain,
complement(complement(X1)) = meet(X1,X1),
inference(spm,[status(thm)],[c_0_44,c_0_36]) ).
cnf(c_0_62,plain,
converse(composition(X1,top)) = composition(top,converse(X1)),
inference(spm,[status(thm)],[c_0_16,c_0_57]) ).
cnf(c_0_63,plain,
join(X1,composition(X2,X1)) = composition(join(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_33]),c_0_29]) ).
cnf(c_0_64,plain,
converse(join(X1,one)) = join(one,converse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_30]),c_0_29]) ).
cnf(c_0_65,plain,
join(zero,complement(X1)) = complement(X1),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_66,plain,
join(zero,meet(X1,X1)) = X1,
inference(spm,[status(thm)],[c_0_56,c_0_61]) ).
fof(c_0_67,plain,
! [X69,X70,X71] : join(meet(composition(X69,X70),X71),meet(composition(X69,meet(X70,composition(converse(X69),X71))),X71)) = meet(composition(X69,meet(X70,composition(converse(X69),X71))),X71),
inference(variable_rename,[status(thm)],[modular_law_1]) ).
fof(c_0_68,negated_conjecture,
~ ! [X1,X2,X3] :
( meet(composition(X1,X2),X3) = zero
=> meet(X2,composition(converse(X1),X3)) = zero ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_69,plain,
composition(top,join(one,converse(X1))) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_51]),c_0_57]),c_0_64]) ).
cnf(c_0_70,plain,
meet(X1,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_61]),c_0_66]) ).
cnf(c_0_71,plain,
complement(join(zero,zero)) = meet(top,top),
inference(spm,[status(thm)],[c_0_55,c_0_49]) ).
cnf(c_0_72,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_36,c_0_49]) ).
cnf(c_0_73,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_67]) ).
fof(c_0_74,negated_conjecture,
( meet(composition(esk1_0,esk2_0),esk3_0) = zero
& meet(esk2_0,composition(converse(esk1_0),esk3_0)) != zero ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_68])])]) ).
cnf(c_0_75,plain,
composition(top,top) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_57]),c_0_47]) ).
cnf(c_0_76,plain,
join(zero,X1) = X1,
inference(rw,[status(thm)],[c_0_66,c_0_70]) ).
cnf(c_0_77,plain,
complement(zero) = meet(top,top),
inference(rw,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_78,plain,
join(meet(composition(X1,X2),X3),meet(X3,composition(X1,meet(X2,composition(converse(X1),X3))))) = meet(X3,composition(X1,meet(X2,composition(converse(X1),X3)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_54]),c_0_54]) ).
cnf(c_0_79,negated_conjecture,
meet(composition(esk1_0,esk2_0),esk3_0) = zero,
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_80,plain,
composition(top,zero) = 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_32,c_0_75]),c_0_49]),c_0_57]),c_0_49]),c_0_76]),c_0_49]) ).
cnf(c_0_81,plain,
complement(zero) = top,
inference(rw,[status(thm)],[c_0_77,c_0_70]) ).
cnf(c_0_82,plain,
join(meet(composition(converse(X1),X2),X3),meet(X3,composition(converse(X1),meet(X2,composition(X1,X3))))) = meet(X3,composition(converse(X1),meet(X2,composition(X1,X3)))),
inference(spm,[status(thm)],[c_0_78,c_0_17]) ).
cnf(c_0_83,negated_conjecture,
meet(esk3_0,composition(esk1_0,esk2_0)) = zero,
inference(rw,[status(thm)],[c_0_79,c_0_54]) ).
cnf(c_0_84,plain,
composition(X1,zero) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_80]),c_0_76]),c_0_51]),c_0_80]) ).
cnf(c_0_85,plain,
meet(X1,zero) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_81]),c_0_47]),c_0_49]) ).
cnf(c_0_86,plain,
join(X1,zero) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_70]),c_0_29]),c_0_27]),c_0_49]) ).
cnf(c_0_87,negated_conjecture,
meet(esk2_0,composition(converse(esk1_0),esk3_0)) != zero,
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_88,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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84]),c_0_85]),c_0_86]),c_0_84]),c_0_85]),c_0_54]),c_0_87]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : REL010+2 : TPTP v9.2.1. Released v4.0.0.
% 0.12/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n020.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 01:40:20 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 5.40/4.36 % Version : CSE_E---1.7
% 5.40/4.36 % Problem : theBenchmark.p
% 5.40/4.36 % SZS status Theorem for theBenchmark.p
% 5.40/4.36 % SZS output start CNFRefutation
% See solution above
% 5.40/4.37 % Total time : 3.372s
%------------------------------------------------------------------------------