%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG055+2 : 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 : n017.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:39 PM UTC 2026
% Result : Theorem 0.14s 0.51s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 31 ( 12 unt; 0 def)
% Number of atoms : 88 ( 25 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 111 ( 54 ~; 42 |; 13 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 31 ( 13 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
sdtasdt0(xP,xP) = sdtasdt0(sdtasdt0(xH,xH),sdtasdt0(xE,xE)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mArith,axiom,
! [X1,X2,X3] :
( ( aScalar0(X3)
& aScalar0(X2)
& aScalar0(X1) )
=> ( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
& sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
& sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
& sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mArith) ).
fof(m__1820,hypothesis,
( xE = sdtasasdt0(xp,xq)
& aScalar0(xE) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1820) ).
fof(m__1911,hypothesis,
( xP = sdtasdt0(xE,xH)
& aScalar0(xP) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1911) ).
fof(m__1873,hypothesis,
( xH = sdtasdt0(xA,xB)
& aScalar0(xH) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1873) ).
fof(mMulSc,axiom,
! [X1,X2] :
( ( aScalar0(X2)
& aScalar0(X1) )
=> aScalar0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulSc) ).
fof(m__1949,hypothesis,
( xN = sdtasdt0(xR,xS)
& aScalar0(xN) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1949) ).
fof(c_0_7,negated_conjecture,
sdtasdt0(xP,xP) != sdtasdt0(sdtasdt0(xH,xH),sdtasdt0(xE,xE)),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_8,negated_conjecture,
sdtasdt0(xP,xP) != sdtasdt0(sdtasdt0(xH,xH),sdtasdt0(xE,xE)),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_9,negated_conjecture,
sdtasdt0(xP,xP) != sdtasdt0(sdtasdt0(xH,xH),sdtasdt0(xE,xE)),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
fof(c_0_10,plain,
! [X21,X22,X23] :
( ( ~ aScalar0(X23)
| ~ aScalar0(X22)
| ~ aScalar0(X21)
| sdtasdt0(X21,X22) = sdtasdt0(X22,X21) )
& ( ~ aScalar0(X23)
| ~ aScalar0(X22)
| ~ aScalar0(X21)
| sdtasdt0(sdtasdt0(X21,X22),X23) = sdtasdt0(X21,sdtasdt0(X22,X23)) )
& ( ~ aScalar0(X23)
| ~ aScalar0(X22)
| ~ aScalar0(X21)
| sdtpldt0(X21,X22) = sdtpldt0(X22,X21) )
& ( ~ aScalar0(X23)
| ~ aScalar0(X22)
| ~ aScalar0(X21)
| sdtpldt0(sdtpldt0(X21,X22),X23) = sdtpldt0(X21,sdtpldt0(X22,X23)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mArith])])])]) ).
cnf(c_0_11,negated_conjecture,
sdtasdt0(xP,xP) != sdtasdt0(sdtasdt0(xH,xH),sdtasdt0(xE,xE)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( ~ aScalar0(X3)
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( ~ aScalar0(X1)
| ~ aScalar0(sdtasdt0(xE,xE))
| ~ aScalar0(sdtasdt0(xH,xH))
| sdtasdt0(sdtasdt0(xE,xE),sdtasdt0(xH,xH)) != sdtasdt0(xP,xP) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
( ~ aScalar0(X3)
| ~ aScalar0(X2)
| ~ aScalar0(X1)
| sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,hypothesis,
aScalar0(xE),
inference(split_conjunct,[status(thm)],[m__1820]) ).
cnf(c_0_16,hypothesis,
xP = sdtasdt0(xE,xH),
inference(split_conjunct,[status(thm)],[m__1911]) ).
cnf(c_0_17,hypothesis,
aScalar0(xH),
inference(split_conjunct,[status(thm)],[m__1873]) ).
cnf(c_0_18,negated_conjecture,
( ~ aScalar0(X1)
| ~ aScalar0(sdtasdt0(xE,xE))
| ~ aScalar0(sdtasdt0(xH,xH))
| sdtasdt0(xE,sdtasdt0(xE,sdtasdt0(xH,xH))) != sdtasdt0(xP,xP) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_19,hypothesis,
( ~ aScalar0(X1)
| sdtasdt0(xE,sdtasdt0(xH,X1)) = sdtasdt0(xP,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_16]),c_0_17]),c_0_15])]) ).
cnf(c_0_20,negated_conjecture,
( ~ aScalar0(X1)
| ~ aScalar0(sdtasdt0(xE,xE))
| ~ aScalar0(sdtasdt0(xH,xH))
| sdtasdt0(xE,sdtasdt0(xP,xH)) != sdtasdt0(xP,xP) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_17])]) ).
cnf(c_0_21,hypothesis,
aScalar0(xP),
inference(split_conjunct,[status(thm)],[m__1911]) ).
cnf(c_0_22,negated_conjecture,
( ~ aScalar0(X2)
| ~ aScalar0(X1)
| ~ aScalar0(sdtasdt0(xE,xE))
| ~ aScalar0(sdtasdt0(xH,xH))
| sdtasdt0(xE,sdtasdt0(xH,xP)) != sdtasdt0(xP,xP) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_12]),c_0_17]),c_0_21])]) ).
fof(c_0_23,plain,
! [X17,X18] :
( aScalar0(sdtasdt0(X17,X18))
| ~ aScalar0(X18)
| ~ aScalar0(X17) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulSc])])]) ).
cnf(c_0_24,hypothesis,
( ~ aScalar0(X2)
| ~ aScalar0(X1)
| ~ aScalar0(sdtasdt0(xE,xE))
| ~ aScalar0(sdtasdt0(xH,xH)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_19]),c_0_21])]) ).
cnf(c_0_25,plain,
( ~ aScalar0(X2)
| ~ aScalar0(X1)
| aScalar0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_26,hypothesis,
( ~ aScalar0(X2)
| ~ aScalar0(X1)
| ~ aScalar0(sdtasdt0(xE,xE)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_17])]) ).
cnf(c_0_27,hypothesis,
( ~ aScalar0(X2)
| ~ aScalar0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_25]),c_0_15])]) ).
cnf(c_0_28,hypothesis,
aScalar0(xN),
inference(split_conjunct,[status(thm)],[m__1949]) ).
cnf(c_0_29,hypothesis,
~ aScalar0(X1),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_15,c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : RNG055+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.34 % Computer : n017.cluster.edu
% 0.10/0.34 % Model : x86_64 x86_64
% 0.10/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.34 % Memory : 8046.5625MB
% 0.10/0.34 % OS : Linux 6.8.0-71-generic
% 0.10/0.34 % CPULimit : 300
% 0.10/0.34 % WCLimit : 300
% 0.10/0.34 % DateTime : Mon Sep 21 04:11:26 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 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.14/0.51 % Version: 3.5.1
% 0.14/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.51 % Starting sh5l with 300s (1) cores
% 0.14/0.51 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1397840 completed with status 0
% 0.14/0.51 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.14/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.51 % No SInE strategy applied
% 0.14/0.51 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.14/0.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/0.51 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.14/0.51 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 0.14/0.51 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.51 % new_bool_3 with pid 1397851 completed with status 0
% 0.14/0.51 % Result found by new_bool_3
% 0.14/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.51 % No SInE strategy applied
% 0.14/0.51 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.14/0.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/0.51 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.14/0.51 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 0.14/0.51 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.51 % Preprocessing time : 0.002 s
% 0.14/0.51 % Presaturation interreduction done
% 0.14/0.51
% 0.14/0.51 % Proof found!
% 0.14/0.51 % SZS status Theorem
% 0.14/0.51 % SZS output start CNFRefutation
% See solution above
% 0.14/0.51 % Parsed axioms : 57
% 0.14/0.51 % Removed by relevancy pruning/SinE : 0
% 0.14/0.51 % Initial clauses : 95
% 0.14/0.51 % Removed in clause preprocessing : 5
% 0.14/0.51 % Initial clauses in saturation : 90
% 0.14/0.51 % Processed clauses : 218
% 0.14/0.51 % ...of these trivial : 1
% 0.14/0.51 % ...subsumed : 14
% 0.14/0.51 % ...remaining for further processing : 203
% 0.14/0.51 % Other redundant clauses eliminated : 5
% 0.14/0.51 % Clauses deleted for lack of memory : 0
% 0.14/0.51 % Backward-subsumed : 35
% 0.14/0.51 % Backward-rewritten : 1
% 0.14/0.51 % Generated clauses : 378
% 0.14/0.51 % ...of the previous two non-redundant : 311
% 0.14/0.51 % ...aggressively subsumed : 0
% 0.14/0.51 % Contextual simplify-reflections : 0
% 0.14/0.51 % Paramodulations : 355
% 0.14/0.51 % Factorizations : 2
% 0.14/0.51 % NegExts : 0
% 0.14/0.51 % Equation resolutions : 8
% 0.14/0.51 % Disequality decompositions : 0
% 0.14/0.51 % Total rewrite steps : 328
% 0.14/0.51 % ...of those cached : 297
% 0.14/0.51 % Propositional unsat checks : 0
% 0.14/0.51 % Propositional check models : 0
% 0.14/0.51 % Propositional check unsatisfiable : 0
% 0.14/0.51 % Propositional clauses : 0
% 0.14/0.51 % Propositional clauses after purity: 0
% 0.14/0.51 % Propositional unsat core size : 0
% 0.14/0.51 % Propositional preprocessing time : 0.000
% 0.14/0.51 % Propositional encoding time : 0.000
% 0.14/0.51 % Propositional solver time : 0.000
% 0.14/0.51 % Success case prop preproc time : 0.000
% 0.14/0.51 % Success case prop encoding time : 0.000
% 0.14/0.51 % Success case prop solver time : 0.000
% 0.14/0.51 % Current number of processed clauses : 61
% 0.14/0.51 % Positive orientable unit clauses : 39
% 0.14/0.51 % Positive unorientable unit clauses: 0
% 0.14/0.51 % Negative unit clauses : 3
% 0.14/0.51 % Non-unit-clauses : 19
% 0.14/0.51 % Current number of unprocessed clauses: 272
% 0.14/0.51 % ...number of literals in the above : 879
% 0.14/0.51 % Current number of archived formulas : 0
% 0.14/0.51 % Current number of archived clauses : 139
% 0.14/0.51 % Clause-clause subsumption calls (NU) : 1610
% 0.14/0.51 % Rec. Clause-clause subsumption calls : 572
% 0.14/0.51 % Non-unit clause-clause subsumptions : 28
% 0.14/0.51 % Unit Clause-clause subsumption calls : 29
% 0.14/0.51 % Rewrite failures with RHS unbound : 0
% 0.14/0.51 % BW rewrite match attempts : 1
% 0.14/0.51 % BW rewrite match successes : 1
% 0.14/0.51 % Condensation attempts : 0
% 0.14/0.51 % Condensation successes : 0
% 0.14/0.51 % Termbank termtop insertions : 11394
% 0.14/0.51 % Search garbage collected termcells : 913
% 0.14/0.51
% 0.14/0.51 % -------------------------------------------------
% 0.14/0.51 % User time : 0.018 s
% 0.14/0.51 % System time : 0.009 s
% 0.14/0.51 % Total time : 0.027 s
% 0.14/0.51 % Maximum resident set size: 3648 pages
% 0.14/0.51
% 0.14/0.51 % -------------------------------------------------
% 0.14/0.51 % User time : 0.203 s
% 0.14/0.51 % System time : 0.035 s
% 0.14/0.51 % Total time : 0.238 s
% 0.14/0.51 % Maximum resident set size: 4864 pages
% 0.14/0.51 % E exiting
%------------------------------------------------------------------------------