%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG104+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:05:52 PM UTC 2026
% Result : Theorem 0.13s 0.44s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 31 ( 14 unt; 0 def)
% Number of atoms : 96 ( 29 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 110 ( 45 ~; 44 |; 14 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 36 ( 0 sgn 24 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
sdtasdt0(xz,xx) = sdtasdt0(xc,sdtasdt0(xu,xz)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mMulAsso,axiom,
! [X1,X2,X3] :
( ( aElement0(X3)
& aElement0(X2)
& aElement0(X1) )
=> sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulAsso) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
fof(mDefPrIdeal,axiom,
! [X1] :
( aElement0(X1)
=> ! [X2] :
( X2 = slsdtgt0(X1)
<=> ( ! [X3] :
( aElementOf0(X3,X2)
<=> ? [X4] :
( sdtasdt0(X1,X4) = X3
& aElement0(X4) ) )
& aSet0(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefPrIdeal) ).
fof(m__1956,hypothesis,
( sdtasdt0(xc,xu) = xx
& aElement0(xu) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1956) ).
fof(m__1905,hypothesis,
aElement0(xc),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1905) ).
fof(m__1933,hypothesis,
( aElement0(xz)
& aElementOf0(xy,slsdtgt0(xc))
& aElementOf0(xx,slsdtgt0(xc)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1933) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aElement0(X1) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulComm) ).
fof(c_0_8,negated_conjecture,
sdtasdt0(xz,xx) != sdtasdt0(xc,sdtasdt0(xu,xz)),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_9,negated_conjecture,
sdtasdt0(xz,xx) != sdtasdt0(xc,sdtasdt0(xu,xz)),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_10,plain,
! [X28,X29,X30] :
( sdtasdt0(sdtasdt0(X28,X29),X30) = sdtasdt0(X28,sdtasdt0(X29,X30))
| ~ aElement0(X30)
| ~ aElement0(X29)
| ~ aElement0(X28) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulAsso])])]) ).
fof(c_0_11,plain,
! [X8,X9] :
( aElement0(X9)
| ~ aElementOf0(X9,X8)
| ~ aSet0(X8) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
fof(c_0_12,plain,
! [X14,X15,X16,X18,X19,X20,X22] :
( ( ~ aElement0(X14)
| X20 = slsdtgt0(X14)
| ~ aSet0(X20)
| aElementOf0(esk4_2(X14,X20),X20)
| sdtasdt0(X14,esk5_2(X14,X20)) = esk4_2(X14,X20) )
& ( ~ aElement0(X14)
| X20 = slsdtgt0(X14)
| ~ aSet0(X20)
| aElementOf0(esk4_2(X14,X20),X20)
| aElement0(esk5_2(X14,X20)) )
& ( ~ aElement0(X14)
| X20 = slsdtgt0(X14)
| ~ aSet0(X20)
| sdtasdt0(X14,X22) != esk4_2(X14,X20)
| ~ aElement0(X22)
| ~ aElementOf0(esk4_2(X14,X20),X20) )
& ( ~ aElement0(X14)
| X15 != slsdtgt0(X14)
| aElementOf0(X18,X15)
| sdtasdt0(X14,X19) != X18
| ~ aElement0(X19) )
& ( ~ aElement0(X14)
| X15 != slsdtgt0(X14)
| ~ aElementOf0(X16,X15)
| sdtasdt0(X14,esk3_3(X14,X15,X16)) = X16 )
& ( ~ aElement0(X14)
| X15 != slsdtgt0(X14)
| ~ aElementOf0(X16,X15)
| aElement0(esk3_3(X14,X15,X16)) )
& ( ~ aElement0(X14)
| X15 != slsdtgt0(X14)
| aSet0(X15) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefPrIdeal])])])])])])]) ).
fof(c_0_13,negated_conjecture,
sdtasdt0(xz,xx) != sdtasdt0(xc,sdtasdt0(xu,xz)),
inference(fof_nnf,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aElement0(X1)
| sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,hypothesis,
sdtasdt0(xc,xu) = xx,
inference(split_conjunct,[status(thm)],[m__1956]) ).
cnf(c_0_16,hypothesis,
aElement0(xu),
inference(split_conjunct,[status(thm)],[m__1956]) ).
cnf(c_0_17,hypothesis,
aElement0(xc),
inference(split_conjunct,[status(thm)],[m__1905]) ).
cnf(c_0_18,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,hypothesis,
aElementOf0(xx,slsdtgt0(xc)),
inference(split_conjunct,[status(thm)],[m__1933]) ).
cnf(c_0_20,plain,
( ~ aElement0(X2)
| X1 != slsdtgt0(X2)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,negated_conjecture,
sdtasdt0(xz,xx) != sdtasdt0(xc,sdtasdt0(xu,xz)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,hypothesis,
( ~ aElement0(X1)
| sdtasdt0(xc,sdtasdt0(xu,X1)) = sdtasdt0(xx,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_23,hypothesis,
aElement0(xz),
inference(split_conjunct,[status(thm)],[m__1933]) ).
fof(c_0_24,plain,
! [X26,X27] :
( sdtasdt0(X26,X27) = sdtasdt0(X27,X26)
| ~ aElement0(X27)
| ~ aElement0(X26) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])])]) ).
cnf(c_0_25,hypothesis,
( ~ aSet0(slsdtgt0(xc))
| aElement0(xx) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
( ~ aElement0(X1)
| aSet0(slsdtgt0(X1)) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_27,negated_conjecture,
sdtasdt0(xz,xx) != sdtasdt0(xx,xz),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_28,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,hypothesis,
aElement0(xx),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_17])]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG104+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n003.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 04:21:45 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.44 % Version: 3.5.1
% 0.13/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.44 % Starting sh5l with 300s (1) cores
% 0.13/0.44 % new_bool_3 with pid 3392768 completed with status 0
% 0.13/0.44 % Result found by new_bool_3
% 0.13/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.44 % Search class: FGUSF-FFMM31-SFFFFFNN
% 0.13/0.44 % partial match(1): FGHSF-FFMM31-SFFFFFNN
% 0.13/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.44 % SubtermCWHack with pid 3392774 completed with status 0
% 0.13/0.44 % Result found by SubtermCWHack
% 0.13/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.44 % Search class: FGUSF-FFMM31-SFFFFFNN
% 0.13/0.44 % partial match(1): FGHSF-FFMM31-SFFFFFNN
% 0.13/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.44 % Preprocessing time : 0.001 s
% 0.13/0.44
% 0.13/0.44 % Proof found!
% 0.13/0.44 % SZS status Theorem
% 0.13/0.44 % SZS output start CNFRefutation
% See solution above
% 0.13/0.44 % Parsed axioms : 43
% 0.13/0.44 % Removed by relevancy pruning/SinE : 20
% 0.13/0.44 % Initial clauses : 46
% 0.13/0.44 % Removed in clause preprocessing : 2
% 0.13/0.44 % Initial clauses in saturation : 44
% 0.13/0.44 % Processed clauses : 149
% 0.13/0.44 % ...of these trivial : 7
% 0.13/0.44 % ...subsumed : 40
% 0.13/0.44 % ...remaining for further processing : 102
% 0.13/0.44 % Other redundant clauses eliminated : 4
% 0.13/0.44 % Clauses deleted for lack of memory : 0
% 0.13/0.44 % Backward-subsumed : 2
% 0.13/0.44 % Backward-rewritten : 8
% 0.13/0.44 % Generated clauses : 360
% 0.13/0.44 % ...of the previous two non-redundant : 278
% 0.13/0.44 % ...aggressively subsumed : 0
% 0.13/0.44 % Contextual simplify-reflections : 1
% 0.13/0.44 % Paramodulations : 357
% 0.13/0.44 % Factorizations : 0
% 0.13/0.44 % NegExts : 0
% 0.13/0.44 % Equation resolutions : 4
% 0.13/0.44 % Disequality decompositions : 0
% 0.13/0.44 % Total rewrite steps : 374
% 0.13/0.44 % ...of those cached : 355
% 0.13/0.44 % Propositional unsat checks : 0
% 0.13/0.44 % Propositional check models : 0
% 0.13/0.44 % Propositional check unsatisfiable : 0
% 0.13/0.44 % Propositional clauses : 0
% 0.13/0.44 % Propositional clauses after purity: 0
% 0.13/0.44 % Propositional unsat core size : 0
% 0.13/0.44 % Propositional preprocessing time : 0.000
% 0.13/0.44 % Propositional encoding time : 0.000
% 0.13/0.44 % Propositional solver time : 0.000
% 0.13/0.44 % Success case prop preproc time : 0.000
% 0.13/0.44 % Success case prop encoding time : 0.000
% 0.13/0.44 % Success case prop solver time : 0.000
% 0.13/0.44 % Current number of processed clauses : 89
% 0.13/0.44 % Positive orientable unit clauses : 25
% 0.13/0.44 % Positive unorientable unit clauses: 0
% 0.13/0.44 % Negative unit clauses : 2
% 0.13/0.44 % Non-unit-clauses : 62
% 0.13/0.44 % Current number of unprocessed clauses: 154
% 0.13/0.44 % ...number of literals in the above : 592
% 0.13/0.44 % Current number of archived formulas : 0
% 0.13/0.44 % Current number of archived clauses : 10
% 0.13/0.44 % Clause-clause subsumption calls (NU) : 533
% 0.13/0.44 % Rec. Clause-clause subsumption calls : 433
% 0.13/0.44 % Non-unit clause-clause subsumptions : 43
% 0.13/0.44 % Unit Clause-clause subsumption calls : 4
% 0.13/0.44 % Rewrite failures with RHS unbound : 0
% 0.13/0.44 % BW rewrite match attempts : 6
% 0.13/0.44 % BW rewrite match successes : 6
% 0.13/0.44 % Condensation attempts : 0
% 0.13/0.44 % Condensation successes : 0
% 0.13/0.44 % Termbank termtop insertions : 8676
% 0.13/0.44 % Search garbage collected termcells : 895
% 0.13/0.44
% 0.13/0.44 % -------------------------------------------------
% 0.13/0.44 % User time : 0.011 s
% 0.13/0.44 % System time : 0.002 s
% 0.13/0.44 % Total time : 0.013 s
% 0.13/0.44 % Maximum resident set size: 3688 pages
% 0.13/0.44
% 0.13/0.44 % -------------------------------------------------
% 0.13/0.44 % User time : 0.013 s
% 0.13/0.44 % System time : 0.006 s
% 0.13/0.44 % Total time : 0.019 s
% 0.13/0.44 % Maximum resident set size: 4608 pages
% 0.13/0.44 % E exiting
%------------------------------------------------------------------------------