%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : REL042+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 : 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 : 300s
% WCLimit : 300s
% DateTime : Tue May 5 05:04:29 PM UTC 2026
% Result : Theorem 6.03s 4.52s
% Output : CNFRefutation 6.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 14
% Syntax : Number of formulae : 104 ( 101 unt; 0 def)
% Number of atoms : 107 ( 106 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 4 ~; 0 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 156 ( 9 sgn 55 !; 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(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(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(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(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(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] : meet(composition(X1,X2),composition(X1,complement(X2))) = zero
=> join(composition(converse(X1),X1),one) = one ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(c_0_14,plain,
! [X59,X60] : converse(composition(X59,X60)) = composition(converse(X60),converse(X59)),
inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).
fof(c_0_15,plain,
! [X56] : converse(converse(X56)) = X56,
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,
! [X52] : composition(X52,one) = X52,
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,
! [X61,X62] : join(composition(converse(X61),complement(composition(X61,X62))),complement(X62)) = complement(X62),
inference(variable_rename,[status(thm)],[converse_cancellativity]) ).
fof(c_0_22,plain,
! [X40,X41] : join(X40,X41) = join(X41,X40),
inference(variable_rename,[status(thm)],[maddux1_join_commutativity]) ).
cnf(c_0_23,plain,
composition(converse(one),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_17]) ).
fof(c_0_24,plain,
! [X42,X43,X44] : join(X42,join(X43,X44)) = join(join(X42,X43),X44),
inference(variable_rename,[status(thm)],[maddux2_join_associativity]) ).
fof(c_0_25,plain,
! [X63] : top = join(X63,complement(X63)),
inference(variable_rename,[status(thm)],[def_top]) ).
cnf(c_0_26,plain,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_20,c_0_23]) ).
cnf(c_0_29,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
top = join(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_23,c_0_28]) ).
fof(c_0_33,plain,
! [X45,X46] : X45 = join(complement(join(complement(X45),complement(X46))),complement(join(complement(X45),X46))),
inference(variable_rename,[status(thm)],[maddux3_a_kind_of_de_Morgan]) ).
fof(c_0_34,plain,
! [X47,X48] : meet(X47,X48) = complement(join(complement(X47),complement(X48))),
inference(variable_rename,[status(thm)],[maddux4_definiton_of_meet]) ).
cnf(c_0_35,plain,
join(X1,join(complement(X1),X2)) = join(top,X2),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
join(X1,join(X2,complement(join(X1,X2)))) = top,
inference(spm,[status(thm)],[c_0_30,c_0_29]) ).
cnf(c_0_37,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_28]),c_0_32]) ).
fof(c_0_38,plain,
! [X64] : zero = meet(X64,complement(X64)),
inference(variable_rename,[status(thm)],[def_zero]) ).
cnf(c_0_39,plain,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_40,plain,
meet(X1,X2) = complement(join(complement(X1),complement(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_35,c_0_30]) ).
cnf(c_0_42,plain,
join(top,complement(X1)) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_30]),c_0_27]) ).
cnf(c_0_43,plain,
zero = meet(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_44,plain,
join(meet(X1,X2),complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,plain,
join(X1,top) = top,
inference(rw,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,plain,
complement(top) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_30]),c_0_43]) ).
cnf(c_0_47,plain,
join(zero,meet(X1,top)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_27]) ).
cnf(c_0_48,plain,
meet(X1,X2) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_27]),c_0_40]) ).
cnf(c_0_49,plain,
complement(join(zero,complement(X1))) = meet(top,X1),
inference(spm,[status(thm)],[c_0_40,c_0_46]) ).
cnf(c_0_50,plain,
join(zero,complement(complement(X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_37]),c_0_43]) ).
cnf(c_0_51,plain,
join(zero,meet(top,X1)) = X1,
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,plain,
meet(top,complement(X1)) = complement(X1),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,plain,
join(zero,complement(X1)) = complement(X1),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_54,plain,
complement(complement(X1)) = meet(top,X1),
inference(rw,[status(thm)],[c_0_49,c_0_53]) ).
fof(c_0_55,plain,
! [X57,X58] : converse(join(X57,X58)) = join(converse(X57),converse(X58)),
inference(variable_rename,[status(thm)],[converse_additivity]) ).
fof(c_0_56,plain,
! [X53,X54,X55] : composition(join(X53,X54),X55) = join(composition(X53,X55),composition(X54,X55)),
inference(variable_rename,[status(thm)],[composition_distributivity]) ).
cnf(c_0_57,plain,
meet(top,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_53]),c_0_54]) ).
cnf(c_0_58,plain,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_59,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_60,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_54,c_0_57]) ).
cnf(c_0_61,plain,
converse(join(converse(X1),X2)) = join(X1,converse(X2)),
inference(spm,[status(thm)],[c_0_58,c_0_17]) ).
cnf(c_0_62,plain,
join(X1,composition(X2,X1)) = composition(join(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_32]),c_0_27]) ).
cnf(c_0_63,plain,
converse(composition(X1,converse(X2))) = composition(X2,converse(X1)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_64,plain,
converse(join(X1,one)) = join(one,converse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_28]),c_0_27]) ).
cnf(c_0_65,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_37,c_0_60]) ).
cnf(c_0_66,plain,
join(X1,composition(X1,converse(X2))) = composition(X1,join(one,converse(X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]),c_0_64]),c_0_63]) ).
cnf(c_0_67,plain,
complement(complement(X1)) = meet(X1,X1),
inference(spm,[status(thm)],[c_0_40,c_0_37]) ).
cnf(c_0_68,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_29,c_0_65]) ).
cnf(c_0_69,plain,
join(X1,composition(X1,X2)) = composition(X1,join(one,X2)),
inference(spm,[status(thm)],[c_0_66,c_0_17]) ).
cnf(c_0_70,plain,
join(top,X1) = top,
inference(spm,[status(thm)],[c_0_27,c_0_45]) ).
cnf(c_0_71,plain,
join(zero,meet(X1,X1)) = X1,
inference(spm,[status(thm)],[c_0_50,c_0_67]) ).
cnf(c_0_72,plain,
join(X1,meet(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_44]),c_0_27]) ).
cnf(c_0_73,plain,
complement(join(X1,complement(X2))) = meet(complement(X1),X2),
inference(spm,[status(thm)],[c_0_40,c_0_60]) ).
fof(c_0_74,plain,
! [X68,X69,X70] : join(meet(composition(X68,X69),X70),meet(composition(X68,meet(X69,composition(converse(X68),X70))),X70)) = meet(composition(X68,meet(X69,composition(converse(X68),X70))),X70),
inference(variable_rename,[status(thm)],[modular_law_1]) ).
fof(c_0_75,negated_conjecture,
~ ! [X1] :
( ! [X2] : meet(composition(X1,X2),composition(X1,complement(X2))) = zero
=> join(composition(converse(X1),X1),one) = one ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_76,plain,
composition(join(X1,one),X1) = composition(X1,join(one,X1)),
inference(spm,[status(thm)],[c_0_62,c_0_69]) ).
cnf(c_0_77,plain,
composition(join(X1,one),top) = top,
inference(spm,[status(thm)],[c_0_62,c_0_70]) ).
cnf(c_0_78,plain,
join(X1,converse(complement(converse(X1)))) = converse(top),
inference(spm,[status(thm)],[c_0_61,c_0_30]) ).
cnf(c_0_79,plain,
meet(X1,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_67]),c_0_71]) ).
cnf(c_0_80,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_72,c_0_48]) ).
cnf(c_0_81,plain,
complement(join(complement(X1),X2)) = meet(complement(X2),X1),
inference(spm,[status(thm)],[c_0_73,c_0_27]) ).
cnf(c_0_82,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_74]) ).
fof(c_0_83,negated_conjecture,
! [X75] :
( meet(composition(esk1_0,X75),composition(esk1_0,complement(X75))) = zero
& join(composition(converse(esk1_0),esk1_0),one) != one ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_75])])])]) ).
cnf(c_0_84,plain,
composition(top,top) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_45]) ).
cnf(c_0_85,plain,
converse(top) = top,
inference(spm,[status(thm)],[c_0_78,c_0_70]) ).
cnf(c_0_86,plain,
join(zero,X1) = X1,
inference(rw,[status(thm)],[c_0_71,c_0_79]) ).
cnf(c_0_87,plain,
join(X1,join(meet(X2,X1),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_29,c_0_80]) ).
cnf(c_0_88,plain,
join(meet(X1,X2),meet(complement(X2),X1)) = X1,
inference(rw,[status(thm)],[c_0_44,c_0_81]) ).
cnf(c_0_89,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_82,c_0_48]),c_0_48]) ).
cnf(c_0_90,negated_conjecture,
meet(composition(esk1_0,X1),composition(esk1_0,complement(X1))) = zero,
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_91,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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_84]),c_0_46]),c_0_85]),c_0_46]),c_0_62]),c_0_70]),c_0_46]) ).
cnf(c_0_92,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_27,c_0_86]) ).
cnf(c_0_93,plain,
complement(zero) = top,
inference(spm,[status(thm)],[c_0_30,c_0_53]) ).
cnf(c_0_94,plain,
join(X1,meet(complement(X1),X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_95,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_89,c_0_17]) ).
cnf(c_0_96,negated_conjecture,
meet(esk1_0,composition(esk1_0,complement(one))) = zero,
inference(spm,[status(thm)],[c_0_90,c_0_20]) ).
cnf(c_0_97,plain,
composition(X1,zero) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_91]),c_0_45]),c_0_91]),c_0_92]) ).
cnf(c_0_98,plain,
meet(X1,zero) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_93]),c_0_27]),c_0_70]),c_0_46]) ).
cnf(c_0_99,negated_conjecture,
join(composition(converse(esk1_0),esk1_0),one) != one,
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_100,plain,
join(complement(X1),meet(X1,X2)) = join(complement(X1),X2),
inference(spm,[status(thm)],[c_0_94,c_0_60]) ).
cnf(c_0_101,negated_conjecture,
meet(complement(one),composition(converse(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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_97]),c_0_98]),c_0_92]),c_0_97]),c_0_98]),c_0_48]) ).
cnf(c_0_102,negated_conjecture,
join(one,composition(converse(esk1_0),esk1_0)) != one,
inference(rw,[status(thm)],[c_0_99,c_0_27]) ).
cnf(c_0_103,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_60]),c_0_92]),c_0_60]),c_0_102]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : REL042+2 : TPTP v9.2.1. Released v4.0.0.
% 0.00/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 : n016.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:44:21 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 6.03/4.52 % Version : CSE_E---1.7
% 6.03/4.52 % Problem : theBenchmark.p
% 6.03/4.52 % SZS status Theorem for theBenchmark.p
% 6.03/4.52 % SZS output start CNFRefutation
% See solution above
% 6.03/4.54 % Total time : 3.374s
%------------------------------------------------------------------------------