%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : REL002+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 : n021.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:09 PM UTC 2026
% Result : Theorem 1.27s 1.72s
% Output : CNFRefutation 1.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 39 ( 39 unt; 0 def)
% Number of atoms : 39 ( 38 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 53 ( 3 sgn 26 !; 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(goals,conjecture,
! [X1] : join(X1,top) = top,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(c_0_8,plain,
! [X49,X50] : converse(composition(X49,X50)) = composition(converse(X50),converse(X49)),
inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).
fof(c_0_9,plain,
! [X46] : converse(converse(X46)) = X46,
inference(variable_rename,[status(thm)],[converse_idempotence]) ).
cnf(c_0_10,plain,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
converse(converse(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X42] : composition(X42,one) = X42,
inference(variable_rename,[status(thm)],[composition_identity]) ).
cnf(c_0_13,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
composition(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X32,X33,X34] : join(X32,join(X33,X34)) = join(join(X32,X33),X34),
inference(variable_rename,[status(thm)],[maddux2_join_associativity]) ).
fof(c_0_16,plain,
! [X53] : top = join(X53,complement(X53)),
inference(variable_rename,[status(thm)],[def_top]) ).
fof(c_0_17,plain,
! [X51,X52] : join(composition(converse(X51),complement(composition(X51,X52))),complement(X52)) = complement(X52),
inference(variable_rename,[status(thm)],[converse_cancellativity]) ).
fof(c_0_18,plain,
! [X30,X31] : join(X30,X31) = join(X31,X30),
inference(variable_rename,[status(thm)],[maddux1_join_commutativity]) ).
cnf(c_0_19,plain,
composition(converse(one),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_11]) ).
cnf(c_0_20,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
top = join(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_14,c_0_19]) ).
cnf(c_0_25,plain,
join(X1,join(complement(X1),X2)) = join(top,X2),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_19,c_0_24]) ).
fof(c_0_28,negated_conjecture,
~ ! [X1] : join(X1,top) = top,
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_29,plain,
join(X1,join(X2,complement(X1))) = join(top,X2),
inference(spm,[status(thm)],[c_0_25,c_0_23]) ).
cnf(c_0_30,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_24]),c_0_27]) ).
fof(c_0_31,negated_conjecture,
join(esk1_0,top) != top,
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])]) ).
cnf(c_0_32,plain,
join(top,complement(complement(X1))) = join(X1,top),
inference(spm,[status(thm)],[c_0_25,c_0_21]) ).
cnf(c_0_33,plain,
join(top,complement(X1)) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_21]) ).
cnf(c_0_34,negated_conjecture,
join(esk1_0,top) != top,
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_35,plain,
join(X1,top) = top,
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
join(top,esk1_0) != top,
inference(rw,[status(thm)],[c_0_34,c_0_23]) ).
cnf(c_0_37,plain,
join(top,X1) = top,
inference(spm,[status(thm)],[c_0_23,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : REL002+1 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.12 % 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.14/0.32 % Computer : n021.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Tue May 5 01:43:25 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 1.27/1.72 % Version : CSE_E---1.7
% 1.27/1.72 % Problem : theBenchmark.p
% 1.27/1.72 % SZS status Theorem for theBenchmark.p
% 1.27/1.72 % SZS output start CNFRefutation
% See solution above
% 1.27/1.72 % Total time : 1.372s
%------------------------------------------------------------------------------