%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : RNG099+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 : n010.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:20 PM UTC 2026
% Result : Theorem 1.59s 1.80s
% Output : CNFRefutation 1.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 35 ( 17 unt; 0 def)
% Number of atoms : 106 ( 3 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 111 ( 40 ~; 35 |; 26 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn 25 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( aElement0(X1)
& ( aElementOf0(sdtpldt0(X1,smndt0(xx)),xI)
| sdteqdtlpzmzozddtrp0(X1,xx,xI) )
& ( aElementOf0(sdtpldt0(X1,smndt0(xy)),xJ)
| sdteqdtlpzmzozddtrp0(X1,xy,xJ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> aElement0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB) ).
fof(m__1332,hypothesis,
aElementOf0(sdtpldt0(xw,smndt0(xx)),xI),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1332) ).
fof(m__1409,hypothesis,
aElementOf0(sdtpldt0(xw,smndt0(xy)),xJ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1409) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).
fof(m__1205,hypothesis,
( aSet0(xI)
& ! [X1] :
( aElementOf0(X1,xI)
=> ( ! [X2] :
( aElementOf0(X2,xI)
=> aElementOf0(sdtpldt0(X1,X2),xI) )
& ! [X2] :
( aElement0(X2)
=> aElementOf0(sdtasdt0(X2,X1),xI) ) ) )
& aIdeal0(xI)
& aSet0(xJ)
& ! [X1] :
( aElementOf0(X1,xJ)
=> ( ! [X2] :
( aElementOf0(X2,xJ)
=> aElementOf0(sdtpldt0(X1,X2),xJ) )
& ! [X2] :
( aElement0(X2)
=> aElementOf0(sdtasdt0(X2,X1),xJ) ) ) )
& aIdeal0(xJ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1205) ).
fof(m__1319,hypothesis,
xw = sdtpldt0(sdtasdt0(xy,xa),sdtasdt0(xx,xb)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1319) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> aElement0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB_02) ).
fof(m__1294,hypothesis,
( aElementOf0(xa,xI)
& aElementOf0(xb,xJ)
& sdtpldt0(xa,xb) = sz10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1294) ).
fof(m__1217,hypothesis,
( aElement0(xx)
& aElement0(xy) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1217) ).
fof(c_0_10,negated_conjecture,
~ ? [X1] :
( aElement0(X1)
& ( aElementOf0(sdtpldt0(X1,smndt0(xx)),xI)
| sdteqdtlpzmzozddtrp0(X1,xx,xI) )
& ( aElementOf0(sdtpldt0(X1,smndt0(xy)),xJ)
| sdteqdtlpzmzozddtrp0(X1,xy,xJ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_11,negated_conjecture,
! [X148] :
( ( ~ aElementOf0(sdtpldt0(X148,smndt0(xy)),xJ)
| ~ aElementOf0(sdtpldt0(X148,smndt0(xx)),xI)
| ~ aElement0(X148) )
& ( ~ sdteqdtlpzmzozddtrp0(X148,xy,xJ)
| ~ aElementOf0(sdtpldt0(X148,smndt0(xx)),xI)
| ~ aElement0(X148) )
& ( ~ aElementOf0(sdtpldt0(X148,smndt0(xy)),xJ)
| ~ sdteqdtlpzmzozddtrp0(X148,xx,xI)
| ~ aElement0(X148) )
& ( ~ sdteqdtlpzmzozddtrp0(X148,xy,xJ)
| ~ sdteqdtlpzmzozddtrp0(X148,xx,xI)
| ~ aElement0(X148) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_12,plain,
! [X72,X73] :
( ~ aElement0(X72)
| ~ aElement0(X73)
| aElement0(sdtpldt0(X72,X73)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])]) ).
cnf(c_0_13,negated_conjecture,
( ~ aElementOf0(sdtpldt0(X1,smndt0(xy)),xJ)
| ~ aElementOf0(sdtpldt0(X1,smndt0(xx)),xI)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,hypothesis,
aElementOf0(sdtpldt0(xw,smndt0(xx)),xI),
inference(split_conjunct,[status(thm)],[m__1332]) ).
cnf(c_0_15,hypothesis,
aElementOf0(sdtpldt0(xw,smndt0(xy)),xJ),
inference(split_conjunct,[status(thm)],[m__1409]) ).
fof(c_0_16,plain,
! [X96,X97] :
( ~ aSet0(X96)
| ~ aElementOf0(X97,X96)
| aElement0(X97) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])]) ).
fof(c_0_17,hypothesis,
! [X139,X140,X141,X142,X143,X144] :
( aSet0(xI)
& ( ~ aElementOf0(X140,xI)
| aElementOf0(sdtpldt0(X139,X140),xI)
| ~ aElementOf0(X139,xI) )
& ( ~ aElement0(X141)
| aElementOf0(sdtasdt0(X141,X139),xI)
| ~ aElementOf0(X139,xI) )
& aIdeal0(xI)
& aSet0(xJ)
& ( ~ aElementOf0(X143,xJ)
| aElementOf0(sdtpldt0(X142,X143),xJ)
| ~ aElementOf0(X142,xJ) )
& ( ~ aElement0(X144)
| aElementOf0(sdtasdt0(X144,X142),xJ)
| ~ aElementOf0(X142,xJ) )
& aIdeal0(xJ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__1205])])])]) ).
cnf(c_0_18,plain,
( aElement0(sdtpldt0(X1,X2))
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,hypothesis,
xw = sdtpldt0(sdtasdt0(xy,xa),sdtasdt0(xx,xb)),
inference(split_conjunct,[status(thm)],[m__1319]) ).
cnf(c_0_20,hypothesis,
~ aElement0(xw),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
fof(c_0_21,plain,
! [X74,X75] :
( ~ aElement0(X74)
| ~ aElement0(X75)
| aElement0(sdtasdt0(X74,X75)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])]) ).
cnf(c_0_22,plain,
( aElement0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,hypothesis,
aElementOf0(xb,xJ),
inference(split_conjunct,[status(thm)],[m__1294]) ).
cnf(c_0_24,hypothesis,
aSet0(xJ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,hypothesis,
( ~ aElement0(sdtasdt0(xx,xb))
| ~ aElement0(sdtasdt0(xy,xa)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_26,plain,
( aElement0(sdtasdt0(X1,X2))
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,hypothesis,
aElement0(xb),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_28,hypothesis,
aElement0(xx),
inference(split_conjunct,[status(thm)],[m__1217]) ).
cnf(c_0_29,hypothesis,
aElementOf0(xa,xI),
inference(split_conjunct,[status(thm)],[m__1294]) ).
cnf(c_0_30,hypothesis,
aSet0(xI),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_31,hypothesis,
~ aElement0(sdtasdt0(xy,xa)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]) ).
cnf(c_0_32,hypothesis,
aElement0(xa),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_29]),c_0_30])]) ).
cnf(c_0_33,hypothesis,
aElement0(xy),
inference(split_conjunct,[status(thm)],[m__1217]) ).
cnf(c_0_34,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_26]),c_0_32]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : RNG099+2 : 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 : n010.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:51:06 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.33 % start to proof: theBenchmark
% 1.59/1.80 % Version : CSE_E---1.7
% 1.59/1.80 % Problem : theBenchmark.p
% 1.59/1.80 % SZS status Theorem for theBenchmark.p
% 1.59/1.80 % SZS output start CNFRefutation
% See solution above
% 1.59/1.80 % Total time : 1.371s
%------------------------------------------------------------------------------