%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : REL024+1 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n015.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:19 PM UTC 2026
% Result : Theorem 1.55s 2.06s
% Output : CNFRefutation 1.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 13
% Syntax : Number of formulae : 70 ( 70 unt; 0 def)
% Number of atoms : 70 ( 69 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 5 ( 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 : 113 ( 4 sgn 50 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(converse_multiplicativity,axiom,
! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_multiplicativity) ).
fof(converse_idempotence,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_idempotence) ).
fof(composition_identity,axiom,
! [X1] : composition(X1,one) = X1,
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/REL001+0.ax',maddux2_join_associativity) ).
fof(def_top,axiom,
! [X1] : top = join(X1,complement(X1)),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/REL001+0.ax',converse_cancellativity) ).
fof(maddux1_join_commutativity,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',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/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/sandbox/benchmark/Axioms/REL001+0.ax',maddux4_definiton_of_meet) ).
fof(def_zero,axiom,
! [X1] : zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',def_zero) ).
fof(goals,conjecture,
! [X1,X2,X3] : join(composition(meet(X1,converse(X2)),meet(X2,X3)),composition(meet(X1,converse(X2)),X3)) = composition(meet(X1,converse(X2)),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(converse_additivity,axiom,
! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/REL001+0.ax',composition_distributivity) ).
fof(c_0_13,plain,
! [X51,X52] : converse(composition(X51,X52)) = composition(converse(X52),converse(X51)),
inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).
fof(c_0_14,plain,
! [X48] : converse(converse(X48)) = X48,
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,
! [X44] : composition(X44,one) = X44,
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,
! [X34,X35,X36] : join(X34,join(X35,X36)) = join(join(X34,X35),X36),
inference(variable_rename,[status(thm)],[maddux2_join_associativity]) ).
fof(c_0_21,plain,
! [X55] : top = join(X55,complement(X55)),
inference(variable_rename,[status(thm)],[def_top]) ).
fof(c_0_22,plain,
! [X53,X54] : join(composition(converse(X53),complement(composition(X53,X54))),complement(X54)) = complement(X54),
inference(variable_rename,[status(thm)],[converse_cancellativity]) ).
fof(c_0_23,plain,
! [X32,X33] : join(X32,X33) = join(X33,X32),
inference(variable_rename,[status(thm)],[maddux1_join_commutativity]) ).
cnf(c_0_24,plain,
composition(converse(one),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_16]) ).
cnf(c_0_25,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
top = join(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_19,c_0_24]) ).
cnf(c_0_30,plain,
join(X1,join(complement(X1),X2)) = join(top,X2),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_24,c_0_29]) ).
fof(c_0_33,plain,
! [X37,X38] : X37 = join(complement(join(complement(X37),complement(X38))),complement(join(complement(X37),X38))),
inference(variable_rename,[status(thm)],[maddux3_a_kind_of_de_Morgan]) ).
fof(c_0_34,plain,
! [X39,X40] : meet(X39,X40) = complement(join(complement(X39),complement(X40))),
inference(variable_rename,[status(thm)],[maddux4_definiton_of_meet]) ).
cnf(c_0_35,plain,
join(X1,join(X2,complement(X1))) = join(top,X2),
inference(spm,[status(thm)],[c_0_30,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_31,c_0_32]),c_0_29]),c_0_32]) ).
fof(c_0_37,plain,
! [X56] : zero = meet(X56,complement(X56)),
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_33]) ).
cnf(c_0_39,plain,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_40,plain,
join(top,complement(complement(X1))) = join(X1,top),
inference(spm,[status(thm)],[c_0_30,c_0_26]) ).
cnf(c_0_41,plain,
join(top,complement(X1)) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),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_26]),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_28]) ).
cnf(c_0_47,plain,
meet(X1,X2) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_28]),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]) ).
fof(c_0_54,negated_conjecture,
~ ! [X1,X2,X3] : join(composition(meet(X1,converse(X2)),meet(X2,X3)),composition(meet(X1,converse(X2)),X3)) = composition(meet(X1,converse(X2)),X3),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_55,plain,
! [X49,X50] : converse(join(X49,X50)) = join(converse(X49),converse(X50)),
inference(variable_rename,[status(thm)],[converse_additivity]) ).
fof(c_0_56,plain,
! [X45,X46,X47] : composition(join(X45,X46),X47) = join(composition(X45,X47),composition(X46,X47)),
inference(variable_rename,[status(thm)],[composition_distributivity]) ).
cnf(c_0_57,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_36,c_0_53]) ).
fof(c_0_58,negated_conjecture,
join(composition(meet(esk1_0,converse(esk2_0)),meet(esk2_0,esk3_0)),composition(meet(esk1_0,converse(esk2_0)),esk3_0)) != composition(meet(esk1_0,converse(esk2_0)),esk3_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_54])])]) ).
cnf(c_0_59,plain,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_60,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_61,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_25,c_0_57]) ).
cnf(c_0_62,negated_conjecture,
join(composition(meet(esk1_0,converse(esk2_0)),meet(esk2_0,esk3_0)),composition(meet(esk1_0,converse(esk2_0)),esk3_0)) != composition(meet(esk1_0,converse(esk2_0)),esk3_0),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_63,plain,
converse(join(composition(converse(X1),X2),X3)) = join(composition(converse(X2),X1),converse(X3)),
inference(spm,[status(thm)],[c_0_59,c_0_18]) ).
cnf(c_0_64,plain,
join(composition(X1,converse(X2)),converse(composition(X2,X3))) = composition(join(X1,converse(X3)),converse(X2)),
inference(spm,[status(thm)],[c_0_60,c_0_15]) ).
cnf(c_0_65,plain,
join(X1,meet(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_43]),c_0_28]) ).
cnf(c_0_66,negated_conjecture,
join(composition(meet(esk1_0,converse(esk2_0)),esk3_0),composition(meet(esk1_0,converse(esk2_0)),meet(esk2_0,esk3_0))) != composition(meet(esk1_0,converse(esk2_0)),esk3_0),
inference(rw,[status(thm)],[c_0_62,c_0_28]) ).
cnf(c_0_67,plain,
join(composition(X1,X2),composition(X1,X3)) = composition(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_63,c_0_64]),c_0_59]),c_0_15]),c_0_16]),c_0_16]),c_0_16]) ).
cnf(c_0_68,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_65,c_0_47]) ).
cnf(c_0_69,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67]),c_0_68])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.20 % Problem : REL024+1 : TPTP v9.2.1. Released v4.0.0.
% 0.04/0.20 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.12/0.42 % Computer : n015.cluster.edu
% 0.12/0.42 % Model : x86_64 x86_64
% 0.12/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.42 % Memory : 8042.1875MB
% 0.12/0.42 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.42 % CPULimit : 300
% 0.12/0.42 % WCLimit : 300
% 0.12/0.42 % DateTime : Tue May 5 01:41:47 EDT 2026
% 0.12/0.44 % CPUTime :
% 0.15/0.46 % start to proof: theBenchmark
% 1.55/2.06 % Version : CSE_E---1.7
% 1.55/2.06 % Problem : theBenchmark.p
% 1.55/2.06 % SZS status Theorem for theBenchmark.p
% 1.55/2.06 % SZS output start CNFRefutation
% See solution above
% 1.55/2.06 % Total time : 1.388s
%------------------------------------------------------------------------------