%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : COM021+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 12:12:21 PM UTC 2026
% Result : Theorem 0.08s 0.43s
% Output : CNFRefutation 0.08s
% 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/sandbox2/benchmark/theBenchmark.p',mNFRDef) ).
fof(m__818,hypothesis,
aNormalFormOfIn0(xd,xw,xR),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__818) ).
fof(m__656,hypothesis,
aRewritingSystem0(xR),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__656) ).
fof(m__799,hypothesis,
( sdtmndtasgtdt0(xv,xR,xw)
& sdtmndtasgtdt0(xu,xR,xw)
& aElement0(xw) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',mTCDef) ).
fof(m__,conjecture,
sdtmndtasgtdt0(xb,xR,xd),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',mTCRDef) ).
fof(m__850,hypothesis,
( sdtmndtasgtdt0(xd,xR,xx)
& sdtmndtasgtdt0(xb,xR,xx)
& aElement0(xx) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__850) ).
fof(c_0_8,plain,
! [X53,X54,X55,X56,X57] :
( ( ~ aRewritingSystem0(X54)
| ~ aElement0(X53)
| aNormalFormOfIn0(X57,X53,X54)
| aReductOfIn0(esk10_3(X53,X54,X57),X57,X54)
| ~ sdtmndtasgtdt0(X53,X54,X57)
| ~ aElement0(X57) )
& ( ~ aRewritingSystem0(X54)
| ~ aElement0(X53)
| ~ aNormalFormOfIn0(X55,X53,X54)
| ~ aReductOfIn0(X56,X55,X54) )
& ( ~ aRewritingSystem0(X54)
| ~ aElement0(X53)
| ~ aNormalFormOfIn0(X55,X53,X54)
| sdtmndtasgtdt0(X53,X54,X55) )
& ( ~ aRewritingSystem0(X54)
| ~ aElement0(X53)
| ~ aNormalFormOfIn0(X55,X53,X54)
| aElement0(X55) ) ),
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,
! [X38,X39,X40,X42] :
( ( ~ aElement0(X40)
| ~ aRewritingSystem0(X39)
| ~ aElement0(X38)
| sdtmndtplgtdt0(X38,X39,X40)
| ~ sdtmndtplgtdt0(X42,X39,X40)
| ~ aReductOfIn0(X42,X38,X39)
| ~ aElement0(X42) )
& ( ~ aElement0(X40)
| ~ aRewritingSystem0(X39)
| ~ aElement0(X38)
| sdtmndtplgtdt0(X38,X39,X40)
| ~ aReductOfIn0(X40,X38,X39) )
& ( ~ aElement0(X40)
| ~ aRewritingSystem0(X39)
| ~ aElement0(X38)
| ~ sdtmndtplgtdt0(X38,X39,X40)
| aReductOfIn0(X40,X38,X39)
| sdtmndtplgtdt0(esk9_3(X38,X39,X40),X39,X40) )
& ( ~ aElement0(X40)
| ~ aRewritingSystem0(X39)
| ~ aElement0(X38)
| ~ sdtmndtplgtdt0(X38,X39,X40)
| aReductOfIn0(X40,X38,X39)
| aReductOfIn0(esk9_3(X38,X39,X40),X38,X39) )
& ( ~ aElement0(X40)
| ~ aRewritingSystem0(X39)
| ~ aElement0(X38)
| ~ sdtmndtplgtdt0(X38,X39,X40)
| aReductOfIn0(X40,X38,X39)
| aElement0(esk9_3(X38,X39,X40)) ) ),
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(esk9_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,
! [X47,X48,X49] :
( ( ~ aElement0(X49)
| ~ aRewritingSystem0(X48)
| ~ aElement0(X47)
| sdtmndtasgtdt0(X47,X48,X49)
| ~ sdtmndtplgtdt0(X47,X48,X49) )
& ( ~ aElement0(X49)
| ~ aRewritingSystem0(X48)
| ~ aElement0(X47)
| sdtmndtasgtdt0(X47,X48,X49)
| X47 != X49 )
& ( ~ aElement0(X49)
| ~ aRewritingSystem0(X48)
| ~ aElement0(X47)
| sdtmndtplgtdt0(X47,X48,X49)
| X47 = X49
| ~ sdtmndtasgtdt0(X47,X48,X49) ) ),
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.03 % Problem : COM021+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.36 % Computer : n011.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Mon Sep 21 14:14:42 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.40 Running first-order theorem proving
% 0.08/0.40 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.08/0.43 % Version: 3.5.1
% 0.08/0.43 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.08/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.08/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.43 % Starting sh5l with 300s (1) cores
% 0.08/0.43 % new_bool_3 with pid 2125182 completed with status 0
% 0.08/0.43 % Result found by new_bool_3
% 0.08/0.43 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.08/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.08/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.08/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.08/0.43 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.08/0.43 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.43 % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.43 % SubtermCWHack with pid 2125185 completed with status 0
% 0.08/0.43 % Result found by SubtermCWHack
% 0.08/0.43 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.08/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.08/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.08/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.08/0.43 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.08/0.43 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.43 % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.43 % Preprocessing time : 0.002 s
% 0.08/0.43
% 0.08/0.43 % Proof found!
% 0.08/0.43 % SZS status Theorem
% 0.08/0.43 % SZS output start CNFRefutation
% See solution above
% 0.08/0.43 % Parsed axioms : 25
% 0.08/0.43 % Removed by relevancy pruning/SinE : 1
% 0.08/0.43 % Initial clauses : 59
% 0.08/0.43 % Removed in clause preprocessing : 4
% 0.08/0.43 % Initial clauses in saturation : 55
% 0.08/0.43 % Processed clauses : 129
% 0.08/0.43 % ...of these trivial : 0
% 0.08/0.43 % ...subsumed : 12
% 0.08/0.43 % ...remaining for further processing : 117
% 0.08/0.43 % Other redundant clauses eliminated : 1
% 0.08/0.43 % Clauses deleted for lack of memory : 0
% 0.08/0.43 % Backward-subsumed : 0
% 0.08/0.43 % Backward-rewritten : 14
% 0.08/0.43 % Generated clauses : 167
% 0.08/0.43 % ...of the previous two non-redundant : 140
% 0.08/0.43 % ...aggressively subsumed : 0
% 0.08/0.43 % Contextual simplify-reflections : 9
% 0.08/0.43 % Paramodulations : 166
% 0.08/0.43 % Factorizations : 0
% 0.08/0.43 % NegExts : 0
% 0.08/0.43 % Equation resolutions : 1
% 0.08/0.43 % Disequality decompositions : 0
% 0.08/0.43 % Total rewrite steps : 332
% 0.08/0.43 % ...of those cached : 310
% 0.08/0.43 % Propositional unsat checks : 0
% 0.08/0.43 % Propositional check models : 0
% 0.08/0.43 % Propositional check unsatisfiable : 0
% 0.08/0.43 % Propositional clauses : 0
% 0.08/0.43 % Propositional clauses after purity: 0
% 0.08/0.43 % Propositional unsat core size : 0
% 0.08/0.43 % Propositional preprocessing time : 0.000
% 0.08/0.43 % Propositional encoding time : 0.000
% 0.08/0.43 % Propositional solver time : 0.000
% 0.08/0.43 % Success case prop preproc time : 0.000
% 0.08/0.43 % Success case prop encoding time : 0.000
% 0.08/0.43 % Success case prop solver time : 0.000
% 0.08/0.43 % Current number of processed clauses : 102
% 0.08/0.43 % Positive orientable unit clauses : 29
% 0.08/0.43 % Positive unorientable unit clauses: 0
% 0.08/0.43 % Negative unit clauses : 4
% 0.08/0.43 % Non-unit-clauses : 69
% 0.08/0.43 % Current number of unprocessed clauses: 58
% 0.08/0.43 % ...number of literals in the above : 296
% 0.08/0.43 % Current number of archived formulas : 0
% 0.08/0.43 % Current number of archived clauses : 14
% 0.08/0.43 % Clause-clause subsumption calls (NU) : 478
% 0.08/0.43 % Rec. Clause-clause subsumption calls : 242
% 0.08/0.43 % Non-unit clause-clause subsumptions : 17
% 0.08/0.43 % Unit Clause-clause subsumption calls : 142
% 0.08/0.43 % Rewrite failures with RHS unbound : 0
% 0.08/0.43 % BW rewrite match attempts : 11
% 0.08/0.43 % BW rewrite match successes : 1
% 0.08/0.43 % Condensation attempts : 0
% 0.08/0.43 % Condensation successes : 0
% 0.08/0.43 % Termbank termtop insertions : 7479
% 0.08/0.43 % Search garbage collected termcells : 939
% 0.08/0.43
% 0.08/0.43 % -------------------------------------------------
% 0.08/0.43 % User time : 0.012 s
% 0.08/0.43 % System time : 0.002 s
% 0.08/0.43 % Total time : 0.015 s
% 0.08/0.43 % Maximum resident set size: 3664 pages
% 0.08/0.43
% 0.08/0.43 % -------------------------------------------------
% 0.08/0.43 % User time : 0.017 s
% 0.08/0.43 % System time : 0.004 s
% 0.08/0.43 % Total time : 0.021 s
% 0.08/0.43 % Maximum resident set size: 4864 pages
% 0.08/0.43 % E exiting
%------------------------------------------------------------------------------