%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : RNG105+2 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n008.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:21 PM UTC 2026
% Result : Theorem 1.30s 1.73s
% Output : CNFRefutation 1.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 25 ( 9 unt; 0 def)
% Number of atoms : 78 ( 21 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 84 ( 31 ~; 26 |; 25 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn 10 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = sdtpldt0(xx,xy) )
| aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc)) )
& ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = sdtasdt0(xz,xx) )
| aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__2010,hypothesis,
sdtpldt0(xx,xy) = sdtasdt0(xc,sdtpldt0(xu,xv)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2010) ).
fof(m__2043,hypothesis,
sdtasdt0(xz,xx) = sdtasdt0(xc,sdtasdt0(xu,xz)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2043) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> aElement0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB) ).
fof(m__1979,hypothesis,
( aElement0(xv)
& sdtasdt0(xc,xv) = xy ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1979) ).
fof(m__1956,hypothesis,
( aElement0(xu)
& sdtasdt0(xc,xu) = xx ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1956) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> aElement0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB_02) ).
fof(m__1933,hypothesis,
( ? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = xx )
& aElementOf0(xx,slsdtgt0(xc))
& ? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = xy )
& aElementOf0(xy,slsdtgt0(xc))
& aElement0(xz) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1933) ).
fof(c_0_8,negated_conjecture,
~ ( ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = sdtpldt0(xx,xy) )
| aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc)) )
& ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = sdtasdt0(xz,xx) )
| aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc)) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_9,negated_conjecture,
! [X199,X200] :
( ( ~ aElement0(X200)
| sdtasdt0(xc,X200) != sdtasdt0(xz,xx)
| ~ aElement0(X199)
| sdtasdt0(xc,X199) != sdtpldt0(xx,xy) )
& ( ~ aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc))
| ~ aElement0(X199)
| sdtasdt0(xc,X199) != sdtpldt0(xx,xy) )
& ( ~ aElement0(X200)
| sdtasdt0(xc,X200) != sdtasdt0(xz,xx)
| ~ aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc)) )
& ( ~ aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc))
| ~ aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
cnf(c_0_10,negated_conjecture,
( ~ aElement0(X1)
| sdtasdt0(xc,X1) != sdtasdt0(xz,xx)
| ~ aElement0(X2)
| sdtasdt0(xc,X2) != sdtpldt0(xx,xy) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_11,hypothesis,
sdtpldt0(xx,xy) = sdtasdt0(xc,sdtpldt0(xu,xv)),
inference(split_conjunct,[status(thm)],[m__2010]) ).
cnf(c_0_12,hypothesis,
( sdtasdt0(xc,X1) != sdtasdt0(xz,xx)
| ~ aElement0(sdtpldt0(xu,xv))
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,hypothesis,
sdtasdt0(xz,xx) = sdtasdt0(xc,sdtasdt0(xu,xz)),
inference(split_conjunct,[status(thm)],[m__2043]) ).
fof(c_0_14,plain,
! [X95,X96] :
( ~ aElement0(X95)
| ~ aElement0(X96)
| aElement0(sdtpldt0(X95,X96)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])]) ).
cnf(c_0_15,hypothesis,
( ~ aElement0(sdtpldt0(xu,xv))
| ~ aElement0(sdtasdt0(xu,xz)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( aElement0(sdtpldt0(X1,X2))
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,hypothesis,
aElement0(xv),
inference(split_conjunct,[status(thm)],[m__1979]) ).
cnf(c_0_18,hypothesis,
aElement0(xu),
inference(split_conjunct,[status(thm)],[m__1956]) ).
fof(c_0_19,plain,
! [X97,X98] :
( ~ aElement0(X97)
| ~ aElement0(X98)
| aElement0(sdtasdt0(X97,X98)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])]) ).
fof(c_0_20,hypothesis,
( aElement0(esk21_0)
& sdtasdt0(xc,esk21_0) = xx
& aElementOf0(xx,slsdtgt0(xc))
& aElement0(esk22_0)
& sdtasdt0(xc,esk22_0) = xy
& aElementOf0(xy,slsdtgt0(xc))
& aElement0(xz) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__1933])]) ).
cnf(c_0_21,hypothesis,
~ aElement0(sdtasdt0(xu,xz)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_22,plain,
( aElement0(sdtasdt0(X1,X2))
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,hypothesis,
aElement0(xz),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : RNG105+2 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n008.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:50:58 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.30/1.73 % Version : CSE_E---1.7
% 1.30/1.73 % Problem : theBenchmark.p
% 1.30/1.73 % SZS status Theorem for theBenchmark.p
% 1.30/1.73 % SZS output start CNFRefutation
% See solution above
% 1.30/1.73 % Total time : 1.372s
%------------------------------------------------------------------------------