%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : RNG104+1 : 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 : 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:06:24 PM UTC 2026
% Result : Theorem 0.14s 0.42s
% Output : CNFRefutation 0.14s
% 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/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(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(m__1933,hypothesis,
( aElement0(xz)
& aElementOf0(xy,slsdtgt0(xc))
& aElementOf0(xx,slsdtgt0(xc)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1933) ).
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,
! [X22,X23,X24] :
( sdtasdt0(sdtasdt0(X22,X23),X24) = sdtasdt0(X22,sdtasdt0(X23,X24))
| ~ aElement0(X24)
| ~ aElement0(X23)
| ~ aElement0(X22) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulAsso])])]) ).
fof(c_0_11,plain,
! [X34,X35] :
( aElement0(X35)
| ~ aElementOf0(X35,X34)
| ~ aSet0(X34) ),
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,
! [X105,X106,X107,X109,X110,X111,X113] :
( ( ~ aElement0(X105)
| X111 = slsdtgt0(X105)
| ~ aSet0(X111)
| aElementOf0(esk19_2(X105,X111),X111)
| sdtasdt0(X105,esk20_2(X105,X111)) = esk19_2(X105,X111) )
& ( ~ aElement0(X105)
| X111 = slsdtgt0(X105)
| ~ aSet0(X111)
| aElementOf0(esk19_2(X105,X111),X111)
| aElement0(esk20_2(X105,X111)) )
& ( ~ aElement0(X105)
| X111 = slsdtgt0(X105)
| ~ aSet0(X111)
| sdtasdt0(X105,X113) != esk19_2(X105,X111)
| ~ aElement0(X113)
| ~ aElementOf0(esk19_2(X105,X111),X111) )
& ( ~ aElement0(X105)
| X106 != slsdtgt0(X105)
| aElementOf0(X109,X106)
| sdtasdt0(X105,X110) != X109
| ~ aElement0(X110) )
& ( ~ aElement0(X105)
| X106 != slsdtgt0(X105)
| ~ aElementOf0(X107,X106)
| sdtasdt0(X105,esk18_3(X105,X106,X107)) = X107 )
& ( ~ aElement0(X105)
| X106 != slsdtgt0(X105)
| ~ aElementOf0(X107,X106)
| aElement0(esk18_3(X105,X106,X107)) )
& ( ~ aElement0(X105)
| X106 != slsdtgt0(X105)
| aSet0(X106) ) ),
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,
! [X20,X21] :
( sdtasdt0(X20,X21) = sdtasdt0(X21,X20)
| ~ aElement0(X21)
| ~ aElement0(X20) ),
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.02 % Problem : RNG104+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n003.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 04:21:45 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 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.42 % Version: 3.5.1
% 0.14/0.42 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.42 % Starting sh5l with 300s (1) cores
% 0.14/0.42 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3392700 completed with status 0
% 0.14/0.42 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.14/0.42 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.42 % No SInE strategy applied
% 0.14/0.42 % Search class: FGUSF-FFMM32-MFFFFFNN
% 0.14/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.42 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.42 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.42 % new_bool_1 with pid 3392708 completed with status 0
% 0.14/0.42 % Result found by new_bool_1
% 0.14/0.42 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.42 % No SInE strategy applied
% 0.14/0.42 % Search class: FGUSF-FFMM32-MFFFFFNN
% 0.14/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.42 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.42 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.42 % Preprocessing time : 0.002 s
% 0.14/0.42 % Presaturation interreduction done
% 0.14/0.42
% 0.14/0.42 % Proof found!
% 0.14/0.42 % SZS status Theorem
% 0.14/0.42 % SZS output start CNFRefutation
% See solution above
% 0.14/0.42 % Parsed axioms : 43
% 0.14/0.42 % Removed by relevancy pruning/SinE : 0
% 0.14/0.42 % Initial clauses : 102
% 0.14/0.42 % Removed in clause preprocessing : 4
% 0.14/0.42 % Initial clauses in saturation : 98
% 0.14/0.42 % Processed clauses : 201
% 0.14/0.42 % ...of these trivial : 0
% 0.14/0.42 % ...subsumed : 14
% 0.14/0.42 % ...remaining for further processing : 187
% 0.14/0.42 % Other redundant clauses eliminated : 16
% 0.14/0.42 % Clauses deleted for lack of memory : 0
% 0.14/0.42 % Backward-subsumed : 0
% 0.14/0.42 % Backward-rewritten : 4
% 0.14/0.42 % Generated clauses : 154
% 0.14/0.42 % ...of the previous two non-redundant : 125
% 0.14/0.42 % ...aggressively subsumed : 0
% 0.14/0.42 % Contextual simplify-reflections : 1
% 0.14/0.42 % Paramodulations : 140
% 0.14/0.42 % Factorizations : 0
% 0.14/0.42 % NegExts : 0
% 0.14/0.42 % Equation resolutions : 16
% 0.14/0.42 % Disequality decompositions : 0
% 0.14/0.42 % Total rewrite steps : 109
% 0.14/0.42 % ...of those cached : 95
% 0.14/0.42 % Propositional unsat checks : 0
% 0.14/0.42 % Propositional check models : 0
% 0.14/0.42 % Propositional check unsatisfiable : 0
% 0.14/0.42 % Propositional clauses : 0
% 0.14/0.42 % Propositional clauses after purity: 0
% 0.14/0.42 % Propositional unsat core size : 0
% 0.14/0.42 % Propositional preprocessing time : 0.000
% 0.14/0.42 % Propositional encoding time : 0.000
% 0.14/0.42 % Propositional solver time : 0.000
% 0.14/0.42 % Success case prop preproc time : 0.000
% 0.14/0.42 % Success case prop encoding time : 0.000
% 0.14/0.42 % Success case prop solver time : 0.000
% 0.14/0.42 % Current number of processed clauses : 71
% 0.14/0.42 % Positive orientable unit clauses : 16
% 0.14/0.42 % Positive unorientable unit clauses: 0
% 0.14/0.42 % Negative unit clauses : 3
% 0.14/0.42 % Non-unit-clauses : 52
% 0.14/0.42 % Current number of unprocessed clauses: 120
% 0.14/0.42 % ...number of literals in the above : 501
% 0.14/0.42 % Current number of archived formulas : 0
% 0.14/0.42 % Current number of archived clauses : 102
% 0.14/0.42 % Clause-clause subsumption calls (NU) : 1413
% 0.14/0.42 % Rec. Clause-clause subsumption calls : 499
% 0.14/0.42 % Non-unit clause-clause subsumptions : 15
% 0.14/0.42 % Unit Clause-clause subsumption calls : 2
% 0.14/0.42 % Rewrite failures with RHS unbound : 0
% 0.14/0.42 % BW rewrite match attempts : 4
% 0.14/0.42 % BW rewrite match successes : 4
% 0.14/0.42 % Condensation attempts : 0
% 0.14/0.42 % Condensation successes : 0
% 0.14/0.42 % Termbank termtop insertions : 10810
% 0.14/0.42 % Search garbage collected termcells : 1833
% 0.14/0.42
% 0.14/0.42 % -------------------------------------------------
% 0.14/0.42 % User time : 0.010 s
% 0.14/0.42 % System time : 0.004 s
% 0.14/0.42 % Total time : 0.014 s
% 0.14/0.42 % Maximum resident set size: 3944 pages
% 0.14/0.42
% 0.14/0.42 % -------------------------------------------------
% 0.14/0.42 % User time : 0.044 s
% 0.14/0.42 % System time : 0.018 s
% 0.14/0.42 % Total time : 0.061 s
% 0.14/0.42 % Maximum resident set size: 4608 pages
% 0.14/0.42 % E exiting
%------------------------------------------------------------------------------