%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM017+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 : 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 12:11:28 PM UTC 2026
% Result : Theorem 0.23s 0.52s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 32 ( 10 unt; 0 def)
% Number of atoms : 147 ( 0 equ)
% Maximal formula atoms : 44 ( 4 avg)
% Number of connectives : 198 ( 83 ~; 84 |; 26 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-4 aty)
% Number of variables : 50 ( 0 sgn 16 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mWCRDef,axiom,
! [X1] :
( aRewritingSystem0(X1)
=> ( isLocallyConfluent0(X1)
<=> ! [X2,X3,X4] :
( ( aReductOfIn0(X4,X2,X1)
& aReductOfIn0(X3,X2,X1)
& aElement0(X4)
& aElement0(X3)
& aElement0(X2) )
=> ? [X5] :
( sdtmndtasgtdt0(X4,X1,X5)
& sdtmndtasgtdt0(X3,X1,X5)
& aElement0(X5) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mWCRDef) ).
fof(mReduct,axiom,
! [X1,X2] :
( ( aRewritingSystem0(X2)
& aElement0(X1) )
=> ! [X3] :
( aReductOfIn0(X3,X1,X2)
=> aElement0(X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mReduct) ).
fof(m__,conjecture,
? [X1] :
( sdtmndtasgtdt0(xv,xR,X1)
& sdtmndtasgtdt0(xu,xR,X1)
& aElement0(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__779,hypothesis,
( sdtmndtasgtdt0(xv,xR,xc)
& aReductOfIn0(xv,xa,xR)
& aElement0(xv) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__779) ).
fof(m__656_01,hypothesis,
( isTerminating0(xR)
& isLocallyConfluent0(xR) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__656_01) ).
fof(m__656,hypothesis,
aRewritingSystem0(xR),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__656) ).
fof(m__731,hypothesis,
( aElement0(xc)
& aElement0(xb)
& aElement0(xa) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__731) ).
fof(m__755,hypothesis,
( sdtmndtasgtdt0(xu,xR,xb)
& aReductOfIn0(xu,xa,xR)
& aElement0(xu) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__755) ).
fof(c_0_8,plain,
! [X41,X42,X43,X44,X49] :
( ( ~ aRewritingSystem0(X41)
| isLocallyConfluent0(X41)
| ~ sdtmndtasgtdt0(esk9_1(X41),X41,X49)
| ~ sdtmndtasgtdt0(esk8_1(X41),X41,X49)
| ~ aElement0(X49) )
& ( ~ aRewritingSystem0(X41)
| isLocallyConfluent0(X41)
| aReductOfIn0(esk9_1(X41),esk7_1(X41),X41) )
& ( ~ aRewritingSystem0(X41)
| isLocallyConfluent0(X41)
| aReductOfIn0(esk8_1(X41),esk7_1(X41),X41) )
& ( ~ aRewritingSystem0(X41)
| isLocallyConfluent0(X41)
| aElement0(esk9_1(X41)) )
& ( ~ aRewritingSystem0(X41)
| isLocallyConfluent0(X41)
| aElement0(esk8_1(X41)) )
& ( ~ aRewritingSystem0(X41)
| isLocallyConfluent0(X41)
| aElement0(esk7_1(X41)) )
& ( ~ aRewritingSystem0(X41)
| ~ isLocallyConfluent0(X41)
| ~ aReductOfIn0(X44,X42,X41)
| ~ aReductOfIn0(X43,X42,X41)
| ~ aElement0(X44)
| ~ aElement0(X43)
| ~ aElement0(X42)
| sdtmndtasgtdt0(X44,X41,esk6_4(X41,X42,X43,X44)) )
& ( ~ aRewritingSystem0(X41)
| ~ isLocallyConfluent0(X41)
| ~ aReductOfIn0(X44,X42,X41)
| ~ aReductOfIn0(X43,X42,X41)
| ~ aElement0(X44)
| ~ aElement0(X43)
| ~ aElement0(X42)
| sdtmndtasgtdt0(X43,X41,esk6_4(X41,X42,X43,X44)) )
& ( ~ aRewritingSystem0(X41)
| ~ isLocallyConfluent0(X41)
| ~ aReductOfIn0(X44,X42,X41)
| ~ aReductOfIn0(X43,X42,X41)
| ~ aElement0(X44)
| ~ aElement0(X43)
| ~ aElement0(X42)
| aElement0(esk6_4(X41,X42,X43,X44)) ) ),
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)],[mWCRDef])])])])])]) ).
fof(c_0_9,plain,
! [X8,X9,X10] :
( aElement0(X10)
| ~ aReductOfIn0(X10,X8,X9)
| ~ aRewritingSystem0(X9)
| ~ aElement0(X8) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mReduct])])])]) ).
cnf(c_0_10,plain,
( ~ aRewritingSystem0(X2)
| ~ isLocallyConfluent0(X2)
| ~ aReductOfIn0(X1,X3,X2)
| ~ aReductOfIn0(X4,X3,X2)
| ~ aElement0(X1)
| ~ aElement0(X4)
| ~ aElement0(X3)
| sdtmndtasgtdt0(X1,X2,esk6_4(X2,X3,X4,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( ~ aReductOfIn0(X3,X1,X2)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1)
| aElement0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( ~ aRewritingSystem0(X1)
| ~ isLocallyConfluent0(X1)
| ~ aReductOfIn0(X4,X2,X1)
| ~ aReductOfIn0(X3,X2,X1)
| ~ aElement0(X4)
| ~ aElement0(X3)
| ~ aElement0(X2)
| aElement0(esk6_4(X1,X2,X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,negated_conjecture,
~ ? [X1] :
( sdtmndtasgtdt0(xv,xR,X1)
& sdtmndtasgtdt0(xu,xR,X1)
& aElement0(X1) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_14,plain,
( ~ aElement0(X3)
| ~ aRewritingSystem0(X2)
| ~ aReductOfIn0(X1,X3,X2)
| ~ aReductOfIn0(X4,X3,X2)
| ~ isLocallyConfluent0(X2)
| sdtmndtasgtdt0(X1,X2,esk6_4(X2,X3,X4,X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_10,c_0_11]),c_0_11]) ).
cnf(c_0_15,hypothesis,
aReductOfIn0(xv,xa,xR),
inference(split_conjunct,[status(thm)],[m__779]) ).
cnf(c_0_16,hypothesis,
isLocallyConfluent0(xR),
inference(split_conjunct,[status(thm)],[m__656_01]) ).
cnf(c_0_17,hypothesis,
aRewritingSystem0(xR),
inference(split_conjunct,[status(thm)],[m__656]) ).
cnf(c_0_18,hypothesis,
aElement0(xa),
inference(split_conjunct,[status(thm)],[m__731]) ).
cnf(c_0_19,plain,
( ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ aReductOfIn0(X3,X2,X1)
| ~ aReductOfIn0(X4,X2,X1)
| ~ isLocallyConfluent0(X1)
| aElement0(esk6_4(X1,X2,X3,X4)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_12,c_0_11]),c_0_11]) ).
cnf(c_0_20,hypothesis,
aReductOfIn0(xu,xa,xR),
inference(split_conjunct,[status(thm)],[m__755]) ).
cnf(c_0_21,plain,
( ~ aRewritingSystem0(X2)
| ~ isLocallyConfluent0(X2)
| ~ aReductOfIn0(X4,X3,X2)
| ~ aReductOfIn0(X1,X3,X2)
| ~ aElement0(X4)
| ~ aElement0(X1)
| ~ aElement0(X3)
| sdtmndtasgtdt0(X1,X2,esk6_4(X2,X3,X1,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_22,negated_conjecture,
! [X68] :
( ~ sdtmndtasgtdt0(xv,xR,X68)
| ~ sdtmndtasgtdt0(xu,xR,X68)
| ~ aElement0(X68) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
cnf(c_0_23,hypothesis,
( ~ aReductOfIn0(X1,xa,xR)
| sdtmndtasgtdt0(X1,xR,esk6_4(xR,xa,xv,X1)) ),
inference(cn,[status(thm)],[inference(rw,[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]),c_0_18])]) ).
cnf(c_0_24,hypothesis,
( ~ aReductOfIn0(X1,xa,xR)
| aElement0(esk6_4(xR,xa,X1,xu)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_25,plain,
( ~ aElement0(X3)
| ~ aRewritingSystem0(X2)
| ~ aReductOfIn0(X1,X3,X2)
| ~ aReductOfIn0(X4,X3,X2)
| ~ isLocallyConfluent0(X2)
| sdtmndtasgtdt0(X1,X2,esk6_4(X2,X3,X1,X4)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_21,c_0_11]),c_0_11]) ).
cnf(c_0_26,negated_conjecture,
( ~ sdtmndtasgtdt0(xv,xR,X1)
| ~ sdtmndtasgtdt0(xu,xR,X1)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,hypothesis,
sdtmndtasgtdt0(xu,xR,esk6_4(xR,xa,xv,xu)),
inference(spm,[status(thm)],[c_0_23,c_0_20]) ).
cnf(c_0_28,hypothesis,
aElement0(esk6_4(xR,xa,xv,xu)),
inference(spm,[status(thm)],[c_0_24,c_0_15]) ).
cnf(c_0_29,hypothesis,
( ~ aReductOfIn0(X1,xa,xR)
| sdtmndtasgtdt0(X1,xR,esk6_4(xR,xa,X1,xu)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_20]),c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_30,negated_conjecture,
~ sdtmndtasgtdt0(xv,xR,esk6_4(xR,xa,xv,xu)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_31,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_15]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM017+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.17/0.42 % Computer : n017.cluster.edu
% 0.17/0.42 % Model : x86_64 x86_64
% 0.17/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42 % Memory : 8046.5625MB
% 0.17/0.42 % OS : Linux 6.8.0-71-generic
% 0.17/0.42 % CPULimit : 300
% 0.17/0.42 % WCLimit : 300
% 0.17/0.42 % DateTime : Mon Sep 21 14:09:43 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.43 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.47 Running first-order theorem proving
% 0.23/0.47 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.52 % Version: 3.5.1
% 0.23/0.52 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.52 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.52 % Starting sh5l with 300s (1) cores
% 0.23/0.52 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2520544 completed with status 0
% 0.23/0.52 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.52 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.52 % No SInE strategy applied
% 0.23/0.52 % Search class: FGHSF-FFMM31-SFFFFFNN
% 0.23/0.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.52 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.52 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.23/0.52 % Starting new_bool_3 with 136s (1) cores
% 0.23/0.52 % Starting new_bool_1 with 136s (1) cores
% 0.23/0.52 % new_bool_3 with pid 2520560 completed with status 0
% 0.23/0.52 % Result found by new_bool_3
% 0.23/0.52 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.52 % No SInE strategy applied
% 0.23/0.52 % Search class: FGHSF-FFMM31-SFFFFFNN
% 0.23/0.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.52 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.52 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.23/0.52 % Starting new_bool_3 with 136s (1) cores
% 0.23/0.52 % Preprocessing time : 0.002 s
% 0.23/0.52 % Presaturation interreduction done
% 0.23/0.52
% 0.23/0.52 % Proof found!
% 0.23/0.52 % SZS status Theorem
% 0.23/0.52 % SZS output start CNFRefutation
% See solution above
% 0.23/0.52 % Parsed axioms : 22
% 0.23/0.52 % Removed by relevancy pruning/SinE : 0
% 0.23/0.52 % Initial clauses : 61
% 0.23/0.52 % Removed in clause preprocessing : 4
% 0.23/0.52 % Initial clauses in saturation : 57
% 0.23/0.52 % Processed clauses : 208
% 0.23/0.52 % ...of these trivial : 0
% 0.23/0.52 % ...subsumed : 2
% 0.23/0.52 % ...remaining for further processing : 206
% 0.23/0.52 % Other redundant clauses eliminated : 1
% 0.23/0.52 % Clauses deleted for lack of memory : 0
% 0.23/0.52 % Backward-subsumed : 0
% 0.23/0.52 % Backward-rewritten : 4
% 0.23/0.52 % Generated clauses : 243
% 0.23/0.52 % ...of the previous two non-redundant : 200
% 0.23/0.52 % ...aggressively subsumed : 0
% 0.23/0.52 % Contextual simplify-reflections : 16
% 0.23/0.52 % Paramodulations : 242
% 0.23/0.52 % Factorizations : 0
% 0.23/0.52 % NegExts : 0
% 0.23/0.52 % Equation resolutions : 1
% 0.23/0.52 % Disequality decompositions : 0
% 0.23/0.52 % Total rewrite steps : 418
% 0.23/0.52 % ...of those cached : 391
% 0.23/0.52 % Propositional unsat checks : 0
% 0.23/0.52 % Propositional check models : 0
% 0.23/0.52 % Propositional check unsatisfiable : 0
% 0.23/0.52 % Propositional clauses : 0
% 0.23/0.52 % Propositional clauses after purity: 0
% 0.23/0.52 % Propositional unsat core size : 0
% 0.23/0.52 % Propositional preprocessing time : 0.000
% 0.23/0.52 % Propositional encoding time : 0.000
% 0.23/0.52 % Propositional solver time : 0.000
% 0.23/0.52 % Success case prop preproc time : 0.000
% 0.23/0.52 % Success case prop encoding time : 0.000
% 0.23/0.52 % Success case prop solver time : 0.000
% 0.23/0.52 % Current number of processed clauses : 144
% 0.23/0.52 % Positive orientable unit clauses : 44
% 0.23/0.52 % Positive unorientable unit clauses: 0
% 0.23/0.52 % Negative unit clauses : 3
% 0.23/0.52 % Non-unit-clauses : 97
% 0.23/0.52 % Current number of unprocessed clauses: 106
% 0.23/0.52 % ...number of literals in the above : 503
% 0.23/0.52 % Current number of archived formulas : 0
% 0.23/0.52 % Current number of archived clauses : 61
% 0.23/0.52 % Clause-clause subsumption calls (NU) : 1753
% 0.23/0.52 % Rec. Clause-clause subsumption calls : 414
% 0.23/0.52 % Non-unit clause-clause subsumptions : 18
% 0.23/0.52 % Unit Clause-clause subsumption calls : 253
% 0.23/0.52 % Rewrite failures with RHS unbound : 0
% 0.23/0.52 % BW rewrite match attempts : 48
% 0.23/0.52 % BW rewrite match successes : 4
% 0.23/0.52 % Condensation attempts : 0
% 0.23/0.52 % Condensation successes : 0
% 0.23/0.52 % Termbank termtop insertions : 11394
% 0.23/0.52 % Search garbage collected termcells : 1172
% 0.23/0.52
% 0.23/0.52 % -------------------------------------------------
% 0.23/0.52 % User time : 0.022 s
% 0.23/0.52 % System time : 0.005 s
% 0.23/0.52 % Total time : 0.027 s
% 0.23/0.52 % Maximum resident set size: 3636 pages
% 0.23/0.52
% 0.23/0.52 % -------------------------------------------------
% 0.23/0.52 % User time : 0.095 s
% 0.23/0.52 % System time : 0.017 s
% 0.23/0.52 % Total time : 0.112 s
% 0.23/0.52 % Maximum resident set size: 4864 pages
% 0.23/0.52 % E exiting
%------------------------------------------------------------------------------