%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG104+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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.14s 0.45s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 32 ( 14 unt; 0 def)
% Number of atoms : 107 ( 33 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 120 ( 45 ~; 44 |; 24 &)
% ( 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 : 12 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 38 ( 0 sgn 24 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
sdtasdt0(xz,xx) = sdtasdt0(xc,sdtasdt0(xu,xz)),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',mMulAsso) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).
fof(m__1933,hypothesis,
( aElement0(xz)
& aElementOf0(xy,slsdtgt0(xc))
& ? [X1] :
( sdtasdt0(xc,X1) = xy
& aElement0(X1) )
& aElementOf0(xx,slsdtgt0(xc))
& ? [X1] :
( sdtasdt0(xc,X1) = xx
& aElement0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1933) ).
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/sandbox/benchmark/theBenchmark.p',mDefPrIdeal) ).
fof(m__1956,hypothesis,
( sdtasdt0(xc,xu) = xx
& aElement0(xu) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1956) ).
fof(m__1905,hypothesis,
aElement0(xc),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1905) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aElement0(X1) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox/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,
! [X30,X31,X32] :
( sdtasdt0(sdtasdt0(X30,X31),X32) = sdtasdt0(X30,sdtasdt0(X31,X32))
| ~ aElement0(X32)
| ~ aElement0(X31)
| ~ aElement0(X30) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulAsso])])]) ).
fof(c_0_11,plain,
! [X10,X11] :
( aElement0(X11)
| ~ aElementOf0(X11,X10)
| ~ aSet0(X10) ),
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,hypothesis,
( aElement0(xz)
& aElementOf0(xy,slsdtgt0(xc))
& sdtasdt0(xc,esk2_0) = xy
& aElement0(esk2_0)
& aElementOf0(xx,slsdtgt0(xc))
& sdtasdt0(xc,esk1_0) = xx
& aElement0(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__1933])]) ).
fof(c_0_13,plain,
! [X16,X17,X18,X20,X21,X22,X24] :
( ( ~ aElement0(X16)
| X22 = slsdtgt0(X16)
| ~ aSet0(X22)
| aElementOf0(esk6_2(X16,X22),X22)
| sdtasdt0(X16,esk7_2(X16,X22)) = esk6_2(X16,X22) )
& ( ~ aElement0(X16)
| X22 = slsdtgt0(X16)
| ~ aSet0(X22)
| aElementOf0(esk6_2(X16,X22),X22)
| aElement0(esk7_2(X16,X22)) )
& ( ~ aElement0(X16)
| X22 = slsdtgt0(X16)
| ~ aSet0(X22)
| sdtasdt0(X16,X24) != esk6_2(X16,X22)
| ~ aElement0(X24)
| ~ aElementOf0(esk6_2(X16,X22),X22) )
& ( ~ aElement0(X16)
| X17 != slsdtgt0(X16)
| aElementOf0(X20,X17)
| sdtasdt0(X16,X21) != X20
| ~ aElement0(X21) )
& ( ~ aElement0(X16)
| X17 != slsdtgt0(X16)
| ~ aElementOf0(X18,X17)
| sdtasdt0(X16,esk5_3(X16,X17,X18)) = X18 )
& ( ~ aElement0(X16)
| X17 != slsdtgt0(X16)
| ~ aElementOf0(X18,X17)
| aElement0(esk5_3(X16,X17,X18)) )
& ( ~ aElement0(X16)
| X17 != slsdtgt0(X16)
| aSet0(X17) ) ),
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_14,negated_conjecture,
sdtasdt0(xz,xx) != sdtasdt0(xc,sdtasdt0(xu,xz)),
inference(fof_nnf,[status(thm)],[c_0_9]) ).
cnf(c_0_15,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_16,hypothesis,
sdtasdt0(xc,xu) = xx,
inference(split_conjunct,[status(thm)],[m__1956]) ).
cnf(c_0_17,hypothesis,
aElement0(xu),
inference(split_conjunct,[status(thm)],[m__1956]) ).
cnf(c_0_18,hypothesis,
aElement0(xc),
inference(split_conjunct,[status(thm)],[m__1905]) ).
cnf(c_0_19,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,hypothesis,
aElementOf0(xx,slsdtgt0(xc)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
( ~ aElement0(X2)
| X1 != slsdtgt0(X2)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,negated_conjecture,
sdtasdt0(xz,xx) != sdtasdt0(xc,sdtasdt0(xu,xz)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,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_15,c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_24,hypothesis,
aElement0(xz),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_25,plain,
! [X28,X29] :
( sdtasdt0(X28,X29) = sdtasdt0(X29,X28)
| ~ aElement0(X29)
| ~ aElement0(X28) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])])]) ).
cnf(c_0_26,hypothesis,
( ~ aSet0(slsdtgt0(xc))
| aElement0(xx) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
( ~ aElement0(X1)
| aSet0(slsdtgt0(X1)) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_28,negated_conjecture,
sdtasdt0(xz,xx) != sdtasdt0(xx,xz),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_29,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,hypothesis,
aElement0(xx),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_18])]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG104+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n006.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 04:19:57 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.14/0.45 % Version: 3.5.1
% 0.14/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.45 % Starting sh5l with 300s (1) cores
% 0.14/0.45 % new_bool_1 with pid 1994340 completed with status 0
% 0.14/0.45 % Result found by new_bool_1
% 0.14/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.45 % Search class: FGUSF-FFMM31-SFFFFFNN
% 0.14/0.45 % partial match(1): FGHSF-FFMM31-SFFFFFNN
% 0.14/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.45 % SubtermCWHack with pid 1994342 completed with status 0
% 0.14/0.45 % Result found by SubtermCWHack
% 0.14/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.45 % Search class: FGUSF-FFMM31-SFFFFFNN
% 0.14/0.45 % partial match(1): FGHSF-FFMM31-SFFFFFNN
% 0.14/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.45 % Preprocessing time : 0.002 s
% 0.14/0.45
% 0.14/0.45 % Proof found!
% 0.14/0.45 % SZS status Theorem
% 0.14/0.45 % SZS output start CNFRefutation
% See solution above
% 0.14/0.45 % Parsed axioms : 43
% 0.14/0.45 % Removed by relevancy pruning/SinE : 20
% 0.14/0.45 % Initial clauses : 50
% 0.14/0.45 % Removed in clause preprocessing : 2
% 0.14/0.45 % Initial clauses in saturation : 48
% 0.14/0.45 % Processed clauses : 162
% 0.14/0.45 % ...of these trivial : 6
% 0.14/0.45 % ...subsumed : 35
% 0.14/0.45 % ...remaining for further processing : 121
% 0.14/0.45 % Other redundant clauses eliminated : 4
% 0.14/0.45 % Clauses deleted for lack of memory : 0
% 0.14/0.45 % Backward-subsumed : 2
% 0.14/0.45 % Backward-rewritten : 7
% 0.14/0.45 % Generated clauses : 334
% 0.14/0.45 % ...of the previous two non-redundant : 247
% 0.14/0.45 % ...aggressively subsumed : 0
% 0.14/0.45 % Contextual simplify-reflections : 1
% 0.14/0.45 % Paramodulations : 331
% 0.14/0.45 % Factorizations : 0
% 0.14/0.45 % NegExts : 0
% 0.14/0.45 % Equation resolutions : 4
% 0.14/0.45 % Disequality decompositions : 0
% 0.14/0.45 % Total rewrite steps : 367
% 0.14/0.45 % ...of those cached : 344
% 0.14/0.45 % Propositional unsat checks : 0
% 0.14/0.45 % Propositional check models : 0
% 0.14/0.45 % Propositional check unsatisfiable : 0
% 0.14/0.45 % Propositional clauses : 0
% 0.14/0.45 % Propositional clauses after purity: 0
% 0.14/0.45 % Propositional unsat core size : 0
% 0.14/0.45 % Propositional preprocessing time : 0.000
% 0.14/0.45 % Propositional encoding time : 0.000
% 0.14/0.45 % Propositional solver time : 0.000
% 0.14/0.45 % Success case prop preproc time : 0.000
% 0.14/0.45 % Success case prop encoding time : 0.000
% 0.14/0.45 % Success case prop solver time : 0.000
% 0.14/0.45 % Current number of processed clauses : 109
% 0.14/0.45 % Positive orientable unit clauses : 32
% 0.14/0.45 % Positive unorientable unit clauses: 0
% 0.14/0.45 % Negative unit clauses : 2
% 0.14/0.45 % Non-unit-clauses : 75
% 0.14/0.45 % Current number of unprocessed clauses: 112
% 0.14/0.45 % ...number of literals in the above : 456
% 0.14/0.45 % Current number of archived formulas : 0
% 0.14/0.45 % Current number of archived clauses : 9
% 0.14/0.45 % Clause-clause subsumption calls (NU) : 636
% 0.14/0.45 % Rec. Clause-clause subsumption calls : 487
% 0.14/0.45 % Non-unit clause-clause subsumptions : 38
% 0.14/0.45 % Unit Clause-clause subsumption calls : 36
% 0.14/0.45 % Rewrite failures with RHS unbound : 0
% 0.14/0.45 % BW rewrite match attempts : 6
% 0.14/0.45 % BW rewrite match successes : 6
% 0.14/0.45 % Condensation attempts : 0
% 0.14/0.45 % Condensation successes : 0
% 0.14/0.45 % Termbank termtop insertions : 7974
% 0.14/0.45 % Search garbage collected termcells : 911
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.012 s
% 0.14/0.45 % System time : 0.003 s
% 0.14/0.45 % Total time : 0.015 s
% 0.14/0.45 % Maximum resident set size: 3692 pages
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.015 s
% 0.14/0.45 % System time : 0.007 s
% 0.14/0.45 % Total time : 0.022 s
% 0.14/0.45 % Maximum resident set size: 4864 pages
% 0.14/0.45 % E exiting
%------------------------------------------------------------------------------