%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM012+3 : 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 : n008.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:27 PM UTC 2026
% Result : Theorem 0.15s 5.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 10 unt; 0 def)
% Number of atoms : 120 ( 22 equ)
% Maximal formula atoms : 31 ( 5 avg)
% Number of connectives : 123 ( 25 ~; 51 |; 43 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 20 ( 0 sgn 9 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( sdtmndtasgtdt0(xy,xR,xz)
& ( ( sdtmndtplgtdt0(xy,xR,xz)
& ( ? [X1] :
( sdtmndtplgtdt0(X1,xR,xz)
& aReductOfIn0(X1,xy,xR)
& aElement0(X1) )
| aReductOfIn0(xz,xy,xR) ) )
| xy = xz )
& sdtmndtasgtdt0(xx,xR,xy)
& ( ( sdtmndtplgtdt0(xx,xR,xy)
& ( ? [X1] :
( sdtmndtplgtdt0(X1,xR,xy)
& aReductOfIn0(X1,xx,xR)
& aElement0(X1) )
| aReductOfIn0(xy,xx,xR) ) )
| xx = xy ) )
=> ( sdtmndtasgtdt0(xx,xR,xz)
| sdtmndtplgtdt0(xx,xR,xz)
| ? [X1] :
( sdtmndtplgtdt0(X1,xR,xz)
& aReductOfIn0(X1,xx,xR)
& aElement0(X1) )
| aReductOfIn0(xz,xx,xR)
| xx = xz ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mTCTrans,axiom,
! [X1,X2,X3,X4] :
( ( aElement0(X4)
& aElement0(X3)
& aRewritingSystem0(X2)
& aElement0(X1) )
=> ( ( sdtmndtplgtdt0(X3,X2,X4)
& sdtmndtplgtdt0(X1,X2,X3) )
=> sdtmndtplgtdt0(X1,X2,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTCTrans) ).
fof(m__349,hypothesis,
( aElement0(xz)
& aElement0(xy)
& aRewritingSystem0(xR)
& aElement0(xx) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__349) ).
fof(c_0_3,negated_conjecture,
~ ( ( sdtmndtasgtdt0(xy,xR,xz)
& ( ( sdtmndtplgtdt0(xy,xR,xz)
& ( ? [X1] :
( sdtmndtplgtdt0(X1,xR,xz)
& aReductOfIn0(X1,xy,xR)
& aElement0(X1) )
| aReductOfIn0(xz,xy,xR) ) )
| xy = xz )
& sdtmndtasgtdt0(xx,xR,xy)
& ( ( sdtmndtplgtdt0(xx,xR,xy)
& ( ? [X1] :
( sdtmndtplgtdt0(X1,xR,xy)
& aReductOfIn0(X1,xx,xR)
& aElement0(X1) )
| aReductOfIn0(xy,xx,xR) ) )
| xx = xy ) )
=> ( sdtmndtasgtdt0(xx,xR,xz)
| sdtmndtplgtdt0(xx,xR,xz)
| ? [X1] :
( sdtmndtplgtdt0(X1,xR,xz)
& aReductOfIn0(X1,xx,xR)
& aElement0(X1) )
| aReductOfIn0(xz,xx,xR)
| xx = xz ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_4,plain,
! [X13,X14,X15,X16] :
( sdtmndtplgtdt0(X13,X14,X16)
| ~ sdtmndtplgtdt0(X15,X14,X16)
| ~ sdtmndtplgtdt0(X13,X14,X15)
| ~ aElement0(X16)
| ~ aElement0(X15)
| ~ aRewritingSystem0(X14)
| ~ aElement0(X13) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mTCTrans])])]) ).
fof(c_0_5,negated_conjecture,
! [X7] :
( ~ sdtmndtasgtdt0(xx,xR,xz)
& ~ sdtmndtplgtdt0(xx,xR,xz)
& ( ~ sdtmndtplgtdt0(X7,xR,xz)
| ~ aReductOfIn0(X7,xx,xR)
| ~ aElement0(X7) )
& ~ aReductOfIn0(xz,xx,xR)
& xx != xz
& sdtmndtasgtdt0(xy,xR,xz)
& ( xy = xz
| sdtmndtplgtdt0(xy,xR,xz) )
& ( xy = xz
| aReductOfIn0(xz,xy,xR)
| sdtmndtplgtdt0(esk2_0,xR,xz) )
& ( xy = xz
| aReductOfIn0(xz,xy,xR)
| aReductOfIn0(esk2_0,xy,xR) )
& ( xy = xz
| aReductOfIn0(xz,xy,xR)
| aElement0(esk2_0) )
& sdtmndtasgtdt0(xx,xR,xy)
& ( xx = xy
| sdtmndtplgtdt0(xx,xR,xy) )
& ( xx = xy
| aReductOfIn0(xy,xx,xR)
| sdtmndtplgtdt0(esk1_0,xR,xy) )
& ( xx = xy
| aReductOfIn0(xy,xx,xR)
| aReductOfIn0(esk1_0,xx,xR) )
& ( xx = xy
| aReductOfIn0(xy,xx,xR)
| aElement0(esk1_0) ) ),
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)],[c_0_3])])])])])]) ).
cnf(c_0_6,plain,
( ~ sdtmndtplgtdt0(X3,X2,X4)
| ~ sdtmndtplgtdt0(X1,X2,X3)
| ~ aElement0(X4)
| ~ aElement0(X3)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1)
| sdtmndtplgtdt0(X1,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( xy = xz
| sdtmndtplgtdt0(xy,xR,xz) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,hypothesis,
aRewritingSystem0(xR),
inference(split_conjunct,[status(thm)],[m__349]) ).
cnf(c_0_9,hypothesis,
aElement0(xz),
inference(split_conjunct,[status(thm)],[m__349]) ).
cnf(c_0_10,hypothesis,
aElement0(xy),
inference(split_conjunct,[status(thm)],[m__349]) ).
cnf(c_0_11,negated_conjecture,
~ sdtmndtplgtdt0(xx,xR,xz),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
( ~ aElement0(X1)
| ~ sdtmndtplgtdt0(X1,xR,xy)
| sdtmndtplgtdt0(X1,xR,xz)
| xz = xy ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9]),c_0_10])]) ).
cnf(c_0_13,hypothesis,
aElement0(xx),
inference(split_conjunct,[status(thm)],[m__349]) ).
cnf(c_0_14,negated_conjecture,
( ~ sdtmndtplgtdt0(xx,xR,xy)
| xz = xy ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_15,negated_conjecture,
( xx = xy
| sdtmndtplgtdt0(xx,xR,xy) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
~ sdtmndtasgtdt0(xx,xR,xz),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,negated_conjecture,
( xz = xy
| xx = xy ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
sdtmndtasgtdt0(xy,xR,xz),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_19,negated_conjecture,
xz = xy,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_20,negated_conjecture,
sdtmndtasgtdt0(xx,xR,xy),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM012+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/5.38 % Computer : n008.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.39 % CPULimit : 300
% 0.11/5.39 % WCLimit : 300
% 0.11/5.39 % DateTime : Mon Sep 21 14:15:15 UTC 2026
% 0.11/5.39 % CPUTime :
% 0.11/5.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.43 Running first-order theorem proving
% 0.15/5.43 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.15/5.46 % Version: 3.5.1
% 0.15/5.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.46 % Starting sh5l with 300s (1) cores
% 0.15/5.46 % new_bool_1 with pid 1193095 completed with status 0
% 0.15/5.46 % Result found by new_bool_1
% 0.15/5.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.46 % Search class: FGHSF-FFMM33-SFFFFFNN
% 0.15/5.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.46 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.46 % SubtermCWHack with pid 1193102 completed with status 0
% 0.15/5.46 % Result found by SubtermCWHack
% 0.15/5.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.46 % Search class: FGHSF-FFMM33-SFFFFFNN
% 0.15/5.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.46 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.46 % Preprocessing time : 0.001 s
% 0.15/5.46
% 0.15/5.46 % Proof found!
% 0.15/5.46 % SZS status Theorem
% 0.15/5.46 % SZS output start CNFRefutation
% See solution above
% 0.15/5.46 % Parsed axioms : 10
% 0.15/5.46 % Removed by relevancy pruning/SinE : 1
% 0.15/5.46 % Initial clauses : 32
% 0.15/5.46 % Removed in clause preprocessing : 3
% 0.15/5.46 % Initial clauses in saturation : 29
% 0.15/5.46 % Processed clauses : 59
% 0.15/5.46 % ...of these trivial : 0
% 0.15/5.46 % ...subsumed : 14
% 0.15/5.46 % ...remaining for further processing : 45
% 0.15/5.46 % Other redundant clauses eliminated : 1
% 0.15/5.46 % Clauses deleted for lack of memory : 0
% 0.15/5.46 % Backward-subsumed : 1
% 0.15/5.46 % Backward-rewritten : 24
% 0.15/5.46 % Generated clauses : 64
% 0.15/5.46 % ...of the previous two non-redundant : 60
% 0.15/5.46 % ...aggressively subsumed : 0
% 0.15/5.46 % Contextual simplify-reflections : 3
% 0.15/5.46 % Paramodulations : 63
% 0.15/5.46 % Factorizations : 0
% 0.15/5.46 % NegExts : 0
% 0.15/5.46 % Equation resolutions : 1
% 0.15/5.46 % Disequality decompositions : 0
% 0.15/5.46 % Total rewrite steps : 129
% 0.15/5.46 % ...of those cached : 122
% 0.15/5.46 % Propositional unsat checks : 0
% 0.15/5.46 % Propositional check models : 0
% 0.15/5.46 % Propositional check unsatisfiable : 0
% 0.15/5.46 % Propositional clauses : 0
% 0.15/5.46 % Propositional clauses after purity: 0
% 0.15/5.46 % Propositional unsat core size : 0
% 0.15/5.46 % Propositional preprocessing time : 0.000
% 0.15/5.46 % Propositional encoding time : 0.000
% 0.15/5.46 % Propositional solver time : 0.000
% 0.15/5.46 % Success case prop preproc time : 0.000
% 0.15/5.46 % Success case prop encoding time : 0.000
% 0.15/5.46 % Success case prop solver time : 0.000
% 0.15/5.46 % Current number of processed clauses : 19
% 0.15/5.46 % Positive orientable unit clauses : 5
% 0.15/5.46 % Positive unorientable unit clauses: 0
% 0.15/5.46 % Negative unit clauses : 0
% 0.15/5.46 % Non-unit-clauses : 14
% 0.15/5.46 % Current number of unprocessed clauses: 24
% 0.15/5.46 % ...number of literals in the above : 109
% 0.15/5.46 % Current number of archived formulas : 0
% 0.15/5.46 % Current number of archived clauses : 25
% 0.15/5.46 % Clause-clause subsumption calls (NU) : 118
% 0.15/5.46 % Rec. Clause-clause subsumption calls : 28
% 0.15/5.46 % Non-unit clause-clause subsumptions : 17
% 0.15/5.46 % Unit Clause-clause subsumption calls : 2
% 0.15/5.46 % Rewrite failures with RHS unbound : 0
% 0.15/5.46 % BW rewrite match attempts : 1
% 0.15/5.46 % BW rewrite match successes : 1
% 0.15/5.46 % Condensation attempts : 0
% 0.15/5.46 % Condensation successes : 0
% 0.15/5.46 % Termbank termtop insertions : 3372
% 0.15/5.46 % Search garbage collected termcells : 539
% 0.15/5.46
% 0.15/5.46 % -------------------------------------------------
% 0.15/5.46 % User time : 0.005 s
% 0.15/5.46 % System time : 0.003 s
% 0.15/5.46 % Total time : 0.008 s
% 0.15/5.46 % Maximum resident set size: 3608 pages
% 0.15/5.46
% 0.15/5.46 % -------------------------------------------------
% 0.15/5.46 % User time : 0.007 s
% 0.15/5.46 % System time : 0.007 s
% 0.15/5.46 % Total time : 0.014 s
% 0.15/5.46 % Maximum resident set size: 4608 pages
% 0.15/5.46 % E exiting
%------------------------------------------------------------------------------