%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : RNG083+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 : n011.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:47 PM UTC 2026
% Result : Theorem 0.23s 0.62s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 46 ( 10 unt; 0 def)
% Number of atoms : 114 ( 46 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 118 ( 50 ~; 46 |; 15 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(mMulUnit,axiom,
! [X1] :
( aElement0(X1)
=> ( X1 = sdtasdt0(sz10,X1)
& sdtasdt0(X1,sz10) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulUnit) ).
fof(mAddInvr,axiom,
! [X1] :
( aElement0(X1)
=> ( sz00 = sdtpldt0(smndt0(X1),X1)
& sdtpldt0(X1,smndt0(X1)) = sz00 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddInvr) ).
fof(mMulMnOne,axiom,
! [X1] :
( aElement0(X1)
=> ( smndt0(X1) = sdtasdt0(X1,smndt0(sz10))
& sdtasdt0(smndt0(sz10),X1) = smndt0(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulMnOne) ).
fof(mSortsC_01,axiom,
aElement0(sz10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsC_01) ).
fof(mSortsU,axiom,
! [X1] :
( aElement0(X1)
=> aElement0(smndt0(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsU) ).
fof(mAMDistr,axiom,
! [X1,X2,X3] :
( ( aElement0(X3)
& aElement0(X2)
& aElement0(X1) )
=> ( sdtasdt0(sdtpldt0(X2,X3),X1) = sdtpldt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1))
& sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAMDistr) ).
fof(m__,conjecture,
( sz00 = sdtasdt0(sz00,xx)
& sdtasdt0(xx,sz00) = sz00 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aElement0(X1) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulComm) ).
fof(mSortsC,axiom,
aElement0(sz00),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsC) ).
fof(m__468,hypothesis,
aElement0(xx),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__468) ).
fof(c_0_11,plain,
! [X19,X20,X21] :
( sdtasdt0(sdtasdt0(X19,X20),X21) = sdtasdt0(X19,sdtasdt0(X20,X21))
| ~ aElement0(X21)
| ~ aElement0(X20)
| ~ aElement0(X19) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulAsso])])]) ).
fof(c_0_12,plain,
! [X22] :
( ( ~ aElement0(X22)
| X22 = sdtasdt0(sz10,X22) )
& ( ~ aElement0(X22)
| sdtasdt0(X22,sz10) = X22 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulUnit])])])]) ).
fof(c_0_13,plain,
! [X16] :
( ( ~ aElement0(X16)
| sz00 = sdtpldt0(smndt0(X16),X16) )
& ( ~ aElement0(X16)
| sdtpldt0(X16,smndt0(X16)) = sz00 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddInvr])])])]) ).
fof(c_0_14,plain,
! [X26] :
( ( ~ aElement0(X26)
| smndt0(X26) = sdtasdt0(X26,smndt0(sz10)) )
& ( ~ aElement0(X26)
| sdtasdt0(smndt0(sz10),X26) = smndt0(X26) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulMnOne])])])]) ).
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_11]) ).
cnf(c_0_16,plain,
( ~ aElement0(X1)
| X1 = sdtasdt0(sz10,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
aElement0(sz10),
inference(split_conjunct,[status(thm)],[mSortsC_01]) ).
cnf(c_0_18,plain,
( ~ aElement0(X1)
| sz00 = sdtpldt0(smndt0(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( ~ aElement0(X1)
| smndt0(X1) = sdtasdt0(X1,smndt0(sz10)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_20,plain,
! [X5] :
( aElement0(smndt0(X5))
| ~ aElement0(X5) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsU])])]) ).
cnf(c_0_21,plain,
( ~ aElement0(X1)
| ~ aElement0(X2)
| sdtasdt0(sz10,sdtasdt0(X1,X2)) = sdtasdt0(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_22,plain,
( ~ aElement0(X1)
| sdtasdt0(smndt0(sz10),X1) = smndt0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_23,plain,
! [X23,X24,X25] :
( ( ~ aElement0(X25)
| ~ aElement0(X24)
| ~ aElement0(X23)
| sdtasdt0(sdtpldt0(X24,X25),X23) = sdtpldt0(sdtasdt0(X24,X23),sdtasdt0(X25,X23)) )
& ( ~ aElement0(X25)
| ~ aElement0(X24)
| ~ aElement0(X23)
| sdtasdt0(X23,sdtpldt0(X24,X25)) = sdtpldt0(sdtasdt0(X23,X24),sdtasdt0(X23,X25)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAMDistr])])])]) ).
cnf(c_0_24,plain,
( ~ aElement0(X1)
| sdtpldt0(sdtasdt0(X1,smndt0(sz10)),X1) = sz00 ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( ~ aElement0(X1)
| aElement0(smndt0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
( ~ aElement0(X1)
| ~ aElement0(smndt0(sz10))
| sdtasdt0(sz10,smndt0(X1)) = smndt0(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aElement0(X1)
| sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,plain,
( ~ aElement0(X1)
| sdtasdt0(X1,sz10) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_29,plain,
( ~ aElement0(smndt0(sz10))
| sdtpldt0(smndt0(sz10),sz10) = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_16]),c_0_17])]) ).
cnf(c_0_30,plain,
( ~ aElement0(X1)
| aElement0(sdtasdt0(X1,smndt0(sz10))) ),
inference(spm,[status(thm)],[c_0_25,c_0_19]) ).
cnf(c_0_31,plain,
( ~ aElement0(X1)
| sdtasdt0(sz10,smndt0(X1)) = smndt0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_25]),c_0_17])]) ).
fof(c_0_32,negated_conjecture,
~ ( sz00 = sdtasdt0(sz00,xx)
& sdtasdt0(xx,sz00) = sz00 ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_33,plain,
! [X17,X18] :
( sdtasdt0(X17,X18) = sdtasdt0(X18,X17)
| ~ aElement0(X18)
| ~ aElement0(X17) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])])]) ).
cnf(c_0_34,plain,
( ~ aElement0(X1)
| ~ aElement0(X2)
| sdtpldt0(sdtasdt0(X1,X2),X1) = sdtasdt0(X1,sdtpldt0(X2,sz10)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_17])]) ).
cnf(c_0_35,plain,
sdtpldt0(smndt0(sz10),sz10) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_25]),c_0_17])]) ).
cnf(c_0_36,plain,
aElement0(smndt0(sz10)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_17])]) ).
fof(c_0_37,negated_conjecture,
( sz00 != sdtasdt0(sz00,xx)
| sdtasdt0(xx,sz00) != sz00 ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])]) ).
cnf(c_0_38,plain,
( ~ aElement0(X2)
| ~ aElement0(X1)
| sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_39,plain,
( ~ aElement0(X1)
| sdtasdt0(X1,sz00) = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_40,plain,
aElement0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
cnf(c_0_41,negated_conjecture,
( sz00 != sdtasdt0(sz00,xx)
| sdtasdt0(xx,sz00) != sz00 ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_42,plain,
( ~ aElement0(X1)
| sdtasdt0(sz00,X1) = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_43,hypothesis,
aElement0(xx),
inference(split_conjunct,[status(thm)],[m__468]) ).
cnf(c_0_44,negated_conjecture,
sdtasdt0(xx,sz00) != sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_39]),c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : RNG083+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n011.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Mon Sep 21 04:18:25 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.53 Running first-order theorem proving
% 0.23/0.53 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.23/0.62 % Version: 3.5.1
% 0.23/0.62 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.62 % Starting sh5l with 300s (1) cores
% 0.23/0.62 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 955799 completed with status 0
% 0.23/0.62 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.62 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.62 % No SInE strategy applied
% 0.23/0.62 % Search class: FHHSF-FFSS21-SFFFFFNN
% 0.23/0.62 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.62 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.62 % Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.23/0.62 % Starting new_bool_3 with 136s (1) cores
% 0.23/0.62 % Starting new_bool_1 with 136s (1) cores
% 0.23/0.62 % G-E--_208_B07_F1_SE_CS_SP_PS_S4d with pid 955806 completed with status 0
% 0.23/0.62 % Result found by G-E--_208_B07_F1_SE_CS_SP_PS_S4d
% 0.23/0.62 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.62 % No SInE strategy applied
% 0.23/0.62 % Search class: FHHSF-FFSS21-SFFFFFNN
% 0.23/0.62 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.62 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.62 % Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.23/0.62 % Preprocessing time : 0.001 s
% 0.23/0.62 % Presaturation interreduction done
% 0.23/0.62
% 0.23/0.62 % Proof found!
% 0.23/0.62 % SZS status Theorem
% 0.23/0.62 % SZS output start CNFRefutation
% See solution above
% 0.23/0.62 % Parsed axioms : 17
% 0.23/0.62 % Removed by relevancy pruning/SinE : 0
% 0.23/0.62 % Initial clauses : 22
% 0.23/0.62 % Removed in clause preprocessing : 1
% 0.23/0.62 % Initial clauses in saturation : 21
% 0.23/0.62 % Processed clauses : 495
% 0.23/0.62 % ...of these trivial : 11
% 0.23/0.62 % ...subsumed : 324
% 0.23/0.62 % ...remaining for further processing : 160
% 0.23/0.62 % Other redundant clauses eliminated : 0
% 0.23/0.62 % Clauses deleted for lack of memory : 0
% 0.23/0.62 % Backward-subsumed : 4
% 0.23/0.62 % Backward-rewritten : 19
% 0.23/0.62 % Generated clauses : 4050
% 0.23/0.62 % ...of the previous two non-redundant : 3387
% 0.23/0.62 % ...aggressively subsumed : 0
% 0.23/0.62 % Contextual simplify-reflections : 20
% 0.23/0.62 % Paramodulations : 4050
% 0.23/0.62 % Factorizations : 0
% 0.23/0.62 % NegExts : 0
% 0.23/0.62 % Equation resolutions : 0
% 0.23/0.62 % Disequality decompositions : 0
% 0.23/0.62 % Total rewrite steps : 4331
% 0.23/0.62 % ...of those cached : 4308
% 0.23/0.62 % Propositional unsat checks : 0
% 0.23/0.62 % Propositional check models : 0
% 0.23/0.62 % Propositional check unsatisfiable : 0
% 0.23/0.62 % Propositional clauses : 0
% 0.23/0.62 % Propositional clauses after purity: 0
% 0.23/0.62 % Propositional unsat core size : 0
% 0.23/0.62 % Propositional preprocessing time : 0.000
% 0.23/0.62 % Propositional encoding time : 0.000
% 0.23/0.62 % Propositional solver time : 0.000
% 0.23/0.62 % Success case prop preproc time : 0.000
% 0.23/0.62 % Success case prop encoding time : 0.000
% 0.23/0.62 % Success case prop solver time : 0.000
% 0.23/0.62 % Current number of processed clauses : 116
% 0.23/0.62 % Positive orientable unit clauses : 19
% 0.23/0.62 % Positive unorientable unit clauses: 0
% 0.23/0.62 % Negative unit clauses : 1
% 0.23/0.62 % Non-unit-clauses : 96
% 0.23/0.62 % Current number of unprocessed clauses: 2910
% 0.23/0.62 % ...number of literals in the above : 11865
% 0.23/0.62 % Current number of archived formulas : 0
% 0.23/0.62 % Current number of archived clauses : 44
% 0.23/0.62 % Clause-clause subsumption calls (NU) : 2715
% 0.23/0.62 % Rec. Clause-clause subsumption calls : 2249
% 0.23/0.62 % Non-unit clause-clause subsumptions : 347
% 0.23/0.62 % Unit Clause-clause subsumption calls : 8
% 0.23/0.62 % Rewrite failures with RHS unbound : 0
% 0.23/0.62 % BW rewrite match attempts : 11
% 0.23/0.62 % BW rewrite match successes : 11
% 0.23/0.62 % Condensation attempts : 0
% 0.23/0.62 % Condensation successes : 0
% 0.23/0.62 % Termbank termtop insertions : 68461
% 0.23/0.62 % Search garbage collected termcells : 204
% 0.23/0.62
% 0.23/0.62 % -------------------------------------------------
% 0.23/0.62 % User time : 0.063 s
% 0.23/0.62 % System time : 0.004 s
% 0.23/0.62 % Total time : 0.067 s
% 0.23/0.62 % Maximum resident set size: 3644 pages
% 0.23/0.62
% 0.23/0.62 % -------------------------------------------------
% 0.23/0.62 % User time : 0.265 s
% 0.23/0.62 % System time : 0.029 s
% 0.23/0.62 % Total time : 0.294 s
% 0.23/0.62 % Maximum resident set size: 4864 pages
% 0.23/0.62 % E exiting
%------------------------------------------------------------------------------