%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM021+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 : n016.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 12:11:29 PM UTC 2026
% Result : Theorem 0.22s 0.65s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 31 ( 17 unt; 0 def)
% Number of atoms : 132 ( 6 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 174 ( 73 ~; 73 |; 22 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-3 aty)
% Number of variables : 39 ( 2 sgn 21 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mNFRDef,axiom,
! [X1,X2] :
( ( aRewritingSystem0(X2)
& aElement0(X1) )
=> ! [X3] :
( aNormalFormOfIn0(X3,X1,X2)
<=> ( ~ ? [X4] : aReductOfIn0(X4,X3,X2)
& sdtmndtasgtdt0(X1,X2,X3)
& aElement0(X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNFRDef) ).
fof(m__818,hypothesis,
aNormalFormOfIn0(xd,xw,xR),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__818) ).
fof(m__656,hypothesis,
aRewritingSystem0(xR),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__656) ).
fof(m__799,hypothesis,
( sdtmndtasgtdt0(xv,xR,xw)
& sdtmndtasgtdt0(xu,xR,xw)
& aElement0(xw) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__799) ).
fof(mTCDef,axiom,
! [X1,X2,X3] :
( ( aElement0(X3)
& aRewritingSystem0(X2)
& aElement0(X1) )
=> ( sdtmndtplgtdt0(X1,X2,X3)
<=> ( ? [X4] :
( sdtmndtplgtdt0(X4,X2,X3)
& aReductOfIn0(X4,X1,X2)
& aElement0(X4) )
| aReductOfIn0(X3,X1,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTCDef) ).
fof(m__,conjecture,
sdtmndtasgtdt0(xb,xR,xd),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mTCRDef,axiom,
! [X1,X2,X3] :
( ( aElement0(X3)
& aRewritingSystem0(X2)
& aElement0(X1) )
=> ( sdtmndtasgtdt0(X1,X2,X3)
<=> ( sdtmndtplgtdt0(X1,X2,X3)
| X1 = X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTCRDef) ).
fof(m__850,hypothesis,
( sdtmndtasgtdt0(xd,xR,xx)
& sdtmndtasgtdt0(xb,xR,xx)
& aElement0(xx) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__850) ).
fof(c_0_8,plain,
! [X55,X56,X57,X58,X59] :
( ( ~ aRewritingSystem0(X56)
| ~ aElement0(X55)
| aNormalFormOfIn0(X59,X55,X56)
| aReductOfIn0(esk12_3(X55,X56,X59),X59,X56)
| ~ sdtmndtasgtdt0(X55,X56,X59)
| ~ aElement0(X59) )
& ( ~ aRewritingSystem0(X56)
| ~ aElement0(X55)
| ~ aNormalFormOfIn0(X57,X55,X56)
| ~ aReductOfIn0(X58,X57,X56) )
& ( ~ aRewritingSystem0(X56)
| ~ aElement0(X55)
| ~ aNormalFormOfIn0(X57,X55,X56)
| sdtmndtasgtdt0(X55,X56,X57) )
& ( ~ aRewritingSystem0(X56)
| ~ aElement0(X55)
| ~ aNormalFormOfIn0(X57,X55,X56)
| aElement0(X57) ) ),
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)],[mNFRDef])])])])])])]) ).
cnf(c_0_9,plain,
( ~ aRewritingSystem0(X3)
| ~ aElement0(X4)
| ~ aNormalFormOfIn0(X2,X4,X3)
| ~ aReductOfIn0(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_10,hypothesis,
aNormalFormOfIn0(xd,xw,xR),
inference(split_conjunct,[status(thm)],[m__818]) ).
cnf(c_0_11,hypothesis,
aRewritingSystem0(xR),
inference(split_conjunct,[status(thm)],[m__656]) ).
cnf(c_0_12,hypothesis,
aElement0(xw),
inference(split_conjunct,[status(thm)],[m__799]) ).
fof(c_0_13,plain,
! [X16,X17,X18,X20] :
( ( ~ aElement0(X18)
| ~ aRewritingSystem0(X17)
| ~ aElement0(X16)
| sdtmndtplgtdt0(X16,X17,X18)
| ~ sdtmndtplgtdt0(X20,X17,X18)
| ~ aReductOfIn0(X20,X16,X17)
| ~ aElement0(X20) )
& ( ~ aElement0(X18)
| ~ aRewritingSystem0(X17)
| ~ aElement0(X16)
| sdtmndtplgtdt0(X16,X17,X18)
| ~ aReductOfIn0(X18,X16,X17) )
& ( ~ aElement0(X18)
| ~ aRewritingSystem0(X17)
| ~ aElement0(X16)
| ~ sdtmndtplgtdt0(X16,X17,X18)
| aReductOfIn0(X18,X16,X17)
| sdtmndtplgtdt0(esk1_3(X16,X17,X18),X17,X18) )
& ( ~ aElement0(X18)
| ~ aRewritingSystem0(X17)
| ~ aElement0(X16)
| ~ sdtmndtplgtdt0(X16,X17,X18)
| aReductOfIn0(X18,X16,X17)
| aReductOfIn0(esk1_3(X16,X17,X18),X16,X17) )
& ( ~ aElement0(X18)
| ~ aRewritingSystem0(X17)
| ~ aElement0(X16)
| ~ sdtmndtplgtdt0(X16,X17,X18)
| aReductOfIn0(X18,X16,X17)
| aElement0(esk1_3(X16,X17,X18)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mTCDef])])])])])]) ).
cnf(c_0_14,plain,
( ~ aRewritingSystem0(X3)
| ~ aElement0(X2)
| ~ aNormalFormOfIn0(X1,X2,X3)
| aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_15,negated_conjecture,
~ sdtmndtasgtdt0(xb,xR,xd),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_16,hypothesis,
~ aReductOfIn0(X1,xd,xR),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12])]) ).
cnf(c_0_17,plain,
( ~ aElement0(X3)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1)
| ~ sdtmndtplgtdt0(X1,X2,X3)
| aReductOfIn0(X3,X1,X2)
| aReductOfIn0(esk1_3(X1,X2,X3),X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,hypothesis,
aElement0(xd),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_10]),c_0_11]),c_0_12])]) ).
fof(c_0_19,plain,
! [X25,X26,X27] :
( ( ~ aElement0(X27)
| ~ aRewritingSystem0(X26)
| ~ aElement0(X25)
| sdtmndtasgtdt0(X25,X26,X27)
| ~ sdtmndtplgtdt0(X25,X26,X27) )
& ( ~ aElement0(X27)
| ~ aRewritingSystem0(X26)
| ~ aElement0(X25)
| sdtmndtasgtdt0(X25,X26,X27)
| X25 != X27 )
& ( ~ aElement0(X27)
| ~ aRewritingSystem0(X26)
| ~ aElement0(X25)
| sdtmndtplgtdt0(X25,X26,X27)
| X25 = X27
| ~ sdtmndtasgtdt0(X25,X26,X27) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mTCRDef])])])]) ).
fof(c_0_20,negated_conjecture,
~ sdtmndtasgtdt0(xb,xR,xd),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
cnf(c_0_21,hypothesis,
( ~ aElement0(X1)
| ~ sdtmndtplgtdt0(xd,xR,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_11]),c_0_18])]),c_0_16]) ).
cnf(c_0_22,plain,
( ~ aElement0(X3)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1)
| ~ sdtmndtasgtdt0(X1,X2,X3)
| sdtmndtplgtdt0(X1,X2,X3)
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_23,negated_conjecture,
~ sdtmndtasgtdt0(xb,xR,xd),
inference(fof_nnf,[status(thm)],[c_0_20]) ).
cnf(c_0_24,hypothesis,
( ~ aElement0(X1)
| ~ sdtmndtasgtdt0(xd,xR,X1)
| xd = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_11]),c_0_18])]) ).
cnf(c_0_25,hypothesis,
sdtmndtasgtdt0(xd,xR,xx),
inference(split_conjunct,[status(thm)],[m__850]) ).
cnf(c_0_26,hypothesis,
aElement0(xx),
inference(split_conjunct,[status(thm)],[m__850]) ).
cnf(c_0_27,negated_conjecture,
~ sdtmndtasgtdt0(xb,xR,xd),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,hypothesis,
xd = xx,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_29,hypothesis,
sdtmndtasgtdt0(xb,xR,xx),
inference(split_conjunct,[status(thm)],[m__850]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : COM021+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.47 % Computer : n016.cluster.edu
% 0.16/0.47 % Model : x86_64 x86_64
% 0.16/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.47 % Memory : 8046.5625MB
% 0.16/0.47 % OS : Linux 6.8.0-71-generic
% 0.16/0.47 % CPULimit : 300
% 0.16/0.47 % WCLimit : 300
% 0.16/0.47 % DateTime : Mon Sep 21 14:19:23 UTC 2026
% 0.16/0.47 % CPUTime :
% 0.16/0.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/0.56 Running first-order theorem proving
% 0.22/0.56 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.22/0.65 % Version: 3.5.1
% 0.22/0.65 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.22/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.22/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.65 % Starting sh5l with 300s (1) cores
% 0.22/0.65 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 2639577 completed with status 0
% 0.22/0.65 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.22/0.65 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.22/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.22/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.65 % No SInE strategy applied
% 0.22/0.65 % Search class: FGHSF-FFMM31-SFFFFFNN
% 0.22/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.22/0.65 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.22/0.65 % Starting new_bool_3 with 136s (1) cores
% 0.22/0.65 % Starting new_bool_1 with 136s (1) cores
% 0.22/0.65 % SubtermCWHack with pid 2639582 completed with status 0
% 0.22/0.65 % Result found by SubtermCWHack
% 0.22/0.65 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.22/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.22/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.65 % No SInE strategy applied
% 0.22/0.65 % Search class: FGHSF-FFMM31-SFFFFFNN
% 0.22/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.65 % Preprocessing time : 0.003 s
% 0.22/0.65
% 0.22/0.65 % Proof found!
% 0.22/0.65 % SZS status Theorem
% 0.22/0.65 % SZS output start CNFRefutation
% See solution above
% 0.22/0.65 % Parsed axioms : 25
% 0.22/0.65 % Removed by relevancy pruning/SinE : 0
% 0.22/0.65 % Initial clauses : 68
% 0.22/0.65 % Removed in clause preprocessing : 4
% 0.22/0.65 % Initial clauses in saturation : 64
% 0.22/0.65 % Processed clauses : 140
% 0.22/0.65 % ...of these trivial : 0
% 0.22/0.65 % ...subsumed : 8
% 0.22/0.65 % ...remaining for further processing : 132
% 0.22/0.65 % Other redundant clauses eliminated : 1
% 0.22/0.65 % Clauses deleted for lack of memory : 0
% 0.22/0.65 % Backward-subsumed : 0
% 0.22/0.65 % Backward-rewritten : 15
% 0.22/0.65 % Generated clauses : 183
% 0.22/0.65 % ...of the previous two non-redundant : 160
% 0.22/0.65 % ...aggressively subsumed : 0
% 0.22/0.65 % Contextual simplify-reflections : 12
% 0.22/0.65 % Paramodulations : 182
% 0.22/0.65 % Factorizations : 0
% 0.22/0.65 % NegExts : 0
% 0.22/0.65 % Equation resolutions : 1
% 0.22/0.65 % Disequality decompositions : 0
% 0.22/0.65 % Total rewrite steps : 372
% 0.22/0.65 % ...of those cached : 348
% 0.22/0.65 % Propositional unsat checks : 0
% 0.22/0.65 % Propositional check models : 0
% 0.22/0.65 % Propositional check unsatisfiable : 0
% 0.22/0.65 % Propositional clauses : 0
% 0.22/0.65 % Propositional clauses after purity: 0
% 0.22/0.65 % Propositional unsat core size : 0
% 0.22/0.65 % Propositional preprocessing time : 0.000
% 0.22/0.65 % Propositional encoding time : 0.000
% 0.22/0.65 % Propositional solver time : 0.000
% 0.22/0.65 % Success case prop preproc time : 0.000
% 0.22/0.65 % Success case prop encoding time : 0.000
% 0.22/0.65 % Success case prop solver time : 0.000
% 0.22/0.65 % Current number of processed clauses : 116
% 0.22/0.65 % Positive orientable unit clauses : 29
% 0.22/0.65 % Positive unorientable unit clauses: 0
% 0.22/0.65 % Negative unit clauses : 4
% 0.22/0.65 % Non-unit-clauses : 83
% 0.22/0.65 % Current number of unprocessed clauses: 76
% 0.22/0.65 % ...number of literals in the above : 398
% 0.22/0.65 % Current number of archived formulas : 0
% 0.22/0.65 % Current number of archived clauses : 15
% 0.22/0.65 % Clause-clause subsumption calls (NU) : 1259
% 0.22/0.65 % Rec. Clause-clause subsumption calls : 605
% 0.22/0.65 % Non-unit clause-clause subsumptions : 16
% 0.22/0.65 % Unit Clause-clause subsumption calls : 164
% 0.22/0.65 % Rewrite failures with RHS unbound : 0
% 0.22/0.65 % BW rewrite match attempts : 11
% 0.22/0.65 % BW rewrite match successes : 1
% 0.22/0.65 % Condensation attempts : 0
% 0.22/0.65 % Condensation successes : 0
% 0.22/0.65 % Termbank termtop insertions : 8719
% 0.22/0.65 % Search garbage collected termcells : 1154
% 0.22/0.65
% 0.22/0.65 % -------------------------------------------------
% 0.22/0.65 % User time : 0.029 s
% 0.22/0.65 % System time : 0.005 s
% 0.22/0.65 % Total time : 0.034 s
% 0.22/0.65 % Maximum resident set size: 3408 pages
% 0.22/0.65
% 0.22/0.65 % -------------------------------------------------
% 0.22/0.65 % User time : 0.093 s
% 0.22/0.65 % System time : 0.026 s
% 0.22/0.65 % Total time : 0.120 s
% 0.22/0.65 % Maximum resident set size: 4864 pages
% 0.22/0.65 % E exiting
%------------------------------------------------------------------------------