%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : REL049+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 : n022.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:31 PM UTC 2026
% Result : Theorem 1.24s 1.71s
% Output : CNFRefutation 1.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 14 unt; 0 def)
% Number of atoms : 23 ( 22 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 10 ( 4 ~; 0 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X1,X2,X3] :
( ( join(X1,X2) = X2
& join(X3,X2) = X2 )
=> join(join(X1,X3),X2) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
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(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(c_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
( ( join(X1,X2) = X2
& join(X3,X2) = X2 )
=> join(join(X1,X3),X2) = X2 ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_4,negated_conjecture,
( join(esk1_0,esk2_0) = esk2_0
& join(esk3_0,esk2_0) = esk2_0
& join(join(esk1_0,esk3_0),esk2_0) != esk2_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_5,plain,
! [X32,X33] : join(X32,X33) = join(X33,X32),
inference(variable_rename,[status(thm)],[maddux1_join_commutativity]) ).
fof(c_0_6,plain,
! [X34,X35,X36] : join(X34,join(X35,X36)) = join(join(X34,X35),X36),
inference(variable_rename,[status(thm)],[maddux2_join_associativity]) ).
cnf(c_0_7,negated_conjecture,
join(esk1_0,esk2_0) = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
join(join(esk1_0,esk3_0),esk2_0) != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
join(esk2_0,esk1_0) = esk2_0,
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
join(esk3_0,esk2_0) = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
join(esk2_0,join(esk1_0,esk3_0)) != esk2_0,
inference(rw,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_14,negated_conjecture,
join(esk2_0,join(esk1_0,X1)) = join(esk2_0,X1),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
join(esk2_0,esk3_0) = esk2_0,
inference(rw,[status(thm)],[c_0_12,c_0_8]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : REL049+1 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.11 % 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 : n022.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:45:21 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.33 % start to proof: theBenchmark
% 1.24/1.71 % Version : CSE_E---1.7
% 1.24/1.71 % Problem : theBenchmark.p
% 1.24/1.71 % SZS status Theorem for theBenchmark.p
% 1.24/1.71 % SZS output start CNFRefutation
% See solution above
% 1.24/1.71 % Total time : 1.371s
%------------------------------------------------------------------------------