%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : RNG095+2 : 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 : n009.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:05:19 PM UTC 2026
% Result : Theorem 1.34s 1.74s
% Output : CNFRefutation 1.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 5 unt; 0 def)
% Number of atoms : 38 ( 7 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 40 ( 17 ~; 12 |; 10 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 15 ( 0 sgn 4 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1,X2] :
( aElementOf0(X1,xI)
& aElementOf0(X2,xJ)
& sdtpldt0(X1,X2) = sz10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__1205_03,hypothesis,
! [X1] :
( aElement0(X1)
=> ( ? [X2,X3] :
( aElementOf0(X2,xI)
& aElementOf0(X3,xJ)
& sdtpldt0(X2,X3) = X1 )
& aElementOf0(X1,sdtpldt1(xI,xJ)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1205_03) ).
fof(mSortsC_01,axiom,
aElement0(sz10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC_01) ).
fof(c_0_3,negated_conjecture,
~ ? [X1,X2] :
( aElementOf0(X1,xI)
& aElementOf0(X2,xJ)
& sdtpldt0(X1,X2) = sz10 ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_4,negated_conjecture,
! [X149,X150] :
( ~ aElementOf0(X149,xI)
| ~ aElementOf0(X150,xJ)
| sdtpldt0(X149,X150) != sz10 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).
fof(c_0_5,hypothesis,
! [X146] :
( ( aElementOf0(esk12_1(X146),xI)
| ~ aElement0(X146) )
& ( aElementOf0(esk13_1(X146),xJ)
| ~ aElement0(X146) )
& ( sdtpldt0(esk12_1(X146),esk13_1(X146)) = X146
| ~ aElement0(X146) )
& ( aElementOf0(X146,sdtpldt1(xI,xJ))
| ~ aElement0(X146) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__1205_03])])])]) ).
cnf(c_0_6,negated_conjecture,
( ~ aElementOf0(X1,xI)
| ~ aElementOf0(X2,xJ)
| sdtpldt0(X1,X2) != sz10 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,hypothesis,
( sdtpldt0(esk12_1(X1),esk13_1(X1)) = X1
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
aElement0(sz10),
inference(split_conjunct,[status(thm)],[mSortsC_01]) ).
cnf(c_0_9,hypothesis,
( aElementOf0(esk12_1(X1),xI)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( ~ aElementOf0(esk13_1(sz10),xJ)
| ~ aElementOf0(esk12_1(sz10),xI) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7])]),c_0_8])]) ).
cnf(c_0_11,hypothesis,
aElementOf0(esk12_1(sz10),xI),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_12,hypothesis,
( aElementOf0(esk13_1(X1),xJ)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
~ aElementOf0(esk13_1(sz10),xJ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).
cnf(c_0_14,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_8]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.11 % Problem : RNG095+2 : TPTP v9.2.1. Released v4.0.0.
% 0.12/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.15/0.33 % Computer : n009.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 01:49:41 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.34/1.74 % Version : CSE_E---1.7
% 1.34/1.74 % Problem : theBenchmark.p
% 1.34/1.74 % SZS status Theorem for theBenchmark.p
% 1.34/1.74 % SZS output start CNFRefutation
% See solution above
% 1.34/1.74 % Total time : 1.369s
%------------------------------------------------------------------------------