%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : NUN087+2 : TPTP v9.2.1. Released v7.3.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 : n014.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:00:54 PM UTC 2026
% Result : Theorem 1.26s 1.72s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 10 unt; 0 def)
% Number of atoms : 57 ( 19 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 57 ( 22 ~; 16 |; 19 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 34 ( 6 sgn 8 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_1,axiom,
? [X1] :
! [X2] :
( ( ~ r1(X2)
& X2 != X1 )
| ( r1(X2)
& X2 = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_1) ).
fof(axiom_5a,axiom,
! [X33] :
? [X34] :
( ? [X35] :
( r1(X35)
& r4(X33,X35,X34) )
& ? [X36] :
( r1(X36)
& X34 = X36 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_5a) ).
fof(zerotimeszeroeqzero,conjecture,
? [X39] :
( ? [X22] :
( r1(X22)
& r4(X22,X22,X39) )
& ? [X23] :
( r1(X23)
& X39 = X23 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',zerotimeszeroeqzero) ).
fof(c_0_3,plain,
? [X1] :
! [X2] :
( ( ~ r1(X2)
& X2 != X1 )
| ( r1(X2)
& X2 = X1 ) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
fof(c_0_4,plain,
! [X122] :
( r1(esk16_1(X122))
& r4(X122,esk16_1(X122),esk15_1(X122))
& r1(esk17_1(X122))
& esk15_1(X122) = esk17_1(X122) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_5a])]) ).
fof(c_0_5,negated_conjecture,
~ ? [X39] :
( ? [X22] :
( r1(X22)
& r4(X22,X22,X39) )
& ? [X23] :
( r1(X23)
& X39 = X23 ) ),
inference(assume_negation,[status(cth)],[zerotimeszeroeqzero]) ).
fof(c_0_6,plain,
! [X91] :
( ( r1(X91)
| ~ r1(X91) )
& ( X91 = esk1_0
| ~ r1(X91) )
& ( r1(X91)
| X91 != esk1_0 )
& ( X91 = esk1_0
| X91 != esk1_0 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_3])])]) ).
cnf(c_0_7,plain,
r1(esk17_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
esk15_1(X1) = esk17_1(X1),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_9,negated_conjecture,
! [X133,X134,X135] :
( ~ r1(X134)
| ~ r4(X134,X134,X133)
| ~ r1(X135)
| X133 != X135 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_10,plain,
( X1 = esk1_0
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
r1(esk16_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,plain,
r1(esk15_1(X1)),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( ~ r1(X1)
| ~ r4(X1,X1,X2)
| ~ r1(X3)
| X2 != X3 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
r4(X1,esk16_1(X1),esk15_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,plain,
esk16_1(X1) = esk1_0,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
esk15_1(X1) = esk1_0,
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_17,plain,
( r1(X1)
| X1 != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,negated_conjecture,
( ~ r4(X1,X1,X2)
| ~ r1(X2)
| ~ r1(X1) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
r4(X1,esk1_0,esk1_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_20,plain,
r1(esk1_0),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUN087+2 : TPTP v9.2.1. Released v7.3.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.16/0.33 % Computer : n014.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:24:06 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.26/1.72 % Version : CSE_E---1.7
% 1.26/1.72 % Problem : theBenchmark.p
% 1.26/1.72 % SZS status Theorem for theBenchmark.p
% 1.26/1.72 % SZS output start CNFRefutation
% See solution above
% 1.26/1.72 % Total time : 1.369s
%------------------------------------------------------------------------------