%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM236_1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:47 PM UTC 2026
% Result : Theorem 0.28s 0.54s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 50 ( 22 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 58 ( 26 ~; 4 |; 23 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-1 aty)
% Number of variables : 14 ( 0 sgn 14 !; 0 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
vOptTerm: $tType ).
tff(decl_sort2,type,
vTy: $tType ).
tff(decl_sort3,type,
vTerm: $tType ).
tff(decl_24,type,
vSucc: vTerm > vTerm ).
tff(decl_25,type,
vPred: vTerm > vTerm ).
tff(decl_26,type,
vsomeTerm: vTerm > vOptTerm ).
tff(decl_27,type,
vZero: vTerm ).
tff(decl_31,type,
vnoTerm: vOptTerm ).
tff(decl_35,type,
vt1: vTerm ).
tff(decl_36,type,
visValue: vTerm > $o ).
tff(decl_37,type,
visNV: vTerm > $o ).
tff(decl_38,type,
vreduce: vTerm > vOptTerm ).
tff(decl_40,type,
visSomeTerm: vOptTerm > $o ).
tff(decl_41,type,
vptchecksimple: ( vTy * vTerm ) > $o ).
tff(decl_42,type,
vgetTerm: vOptTerm > vTerm ).
tff(decl_103,type,
esk53_0: vTerm ).
tff(decl_104,type,
esk54_0: vTy ).
tff('Progress-Pred-Succ-isNV-False-isSomeTerm-True',conjecture,
! [X11: vTerm,X98: vTy] :
( ( ~ visValue(vPred(vt1))
& vptchecksimple(vPred(vt1),X98)
& ( vt1 = vSucc(X11) )
& ( vt1 != vZero )
& ~ visNV(X11)
& visSomeTerm(vreduce(vSucc(X11))) )
=> ( vreduce(vPred(vt1)) != vnoTerm ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Progress-Pred-Succ-isNV-False-isSomeTerm-True') ).
tff('reduce-8',axiom,
! [X11: vTerm] :
( ( visSomeTerm(vreduce(vSucc(X11)))
& ~ visNV(X11) )
=> ( vreduce(vPred(vSucc(X11))) = vsomeTerm(vPred(vgetTerm(vreduce(vSucc(X11))))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','reduce-8') ).
tff('DIFF-noTerm-someTerm',axiom,
! [X2: vTerm] : ( vnoTerm != vsomeTerm(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','DIFF-noTerm-someTerm') ).
tff(c_0_3,negated_conjecture,
~ ! [X11: vTerm,X98: vTy] :
( ( ~ visValue(vPred(vt1))
& vptchecksimple(vPred(vt1),X98)
& ( vt1 = vSucc(X11) )
& ( vt1 != vZero )
& ~ visNV(X11)
& visSomeTerm(vreduce(vSucc(X11))) )
=> ( vreduce(vPred(vt1)) != vnoTerm ) ),
inference(assume_negation,[status(cth)],['Progress-Pred-Succ-isNV-False-isSomeTerm-True']) ).
tff(c_0_4,negated_conjecture,
~ ! [X11: vTerm,X98: vTy] :
( ( ~ visValue(vPred(vt1))
& vptchecksimple(vPred(vt1),X98)
& ( vt1 = vSucc(X11) )
& ( vt1 != vZero )
& ~ visNV(X11)
& visSomeTerm(vreduce(vSucc(X11))) )
=> ( vreduce(vPred(vt1)) != vnoTerm ) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
tff(c_0_5,plain,
! [X11: vTerm] :
( ( visSomeTerm(vreduce(vSucc(X11)))
& ~ visNV(X11) )
=> ( vreduce(vPred(vSucc(X11))) = vsomeTerm(vPred(vgetTerm(vreduce(vSucc(X11))))) ) ),
inference(fof_simplification,[status(thm)],['reduce-8']) ).
tff(c_0_6,negated_conjecture,
( ( vreduce(vPred(vt1)) = vnoTerm )
& ~ visValue(vPred(vt1))
& vptchecksimple(vPred(vt1),esk54_0)
& ( vt1 = vSucc(esk53_0) )
& ( vt1 != vZero )
& ~ visNV(esk53_0)
& visSomeTerm(vreduce(vSucc(esk53_0))) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
tff(c_0_7,plain,
! [X2: vTerm] : ( vnoTerm != vsomeTerm(X2) ),
inference(fof_simplification,[status(thm)],['DIFF-noTerm-someTerm']) ).
tff(c_0_8,plain,
! [X240: vTerm] :
( ( vreduce(vPred(vSucc(X240))) = vsomeTerm(vPred(vgetTerm(vreduce(vSucc(X240))))) )
| ~ visSomeTerm(vreduce(vSucc(X240)))
| visNV(X240) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
tcf(c_0_9,negated_conjecture,
visSomeTerm(vreduce(vSucc(esk53_0))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_10,negated_conjecture,
vt1 = vSucc(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tff(c_0_11,plain,
! [X184: vTerm] : ( vnoTerm != vsomeTerm(X184) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_7])]) ).
tcf(c_0_12,plain,
! [X1: vTerm] :
( ~ visSomeTerm(vreduce(vSucc(X1)))
| ( vreduce(vPred(vSucc(X1))) = vsomeTerm(vPred(vgetTerm(vreduce(vSucc(X1))))) )
| visNV(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_13,negated_conjecture,
vreduce(vPred(vt1)) = vnoTerm,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_14,negated_conjecture,
visSomeTerm(vreduce(vt1)),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
tcf(c_0_15,plain,
! [X1: vTerm] : vnoTerm != vsomeTerm(X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tcf(c_0_16,negated_conjecture,
~ visNV(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_10]),c_0_13]),c_0_14])]),c_0_15]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COM236_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n019.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 14:20:49 UTC 2026
% 0.04/0.36 % CPUTime :
% 0.04/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.40 Running first-order theorem proving
% 0.04/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.28/0.54 % Version: 3.5.1
% 0.28/0.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.28/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.28/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.28/0.54 % Starting sh5l with 300s (1) cores
% 0.28/0.54 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2803005 completed with status 0
% 0.28/0.54 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.28/0.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.28/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.28/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.28/0.54 % No SInE strategy applied
% 0.28/0.54 % Search class: FGUSM-FSLM31-MFFFFFNN
% 0.28/0.54 % partial match(1): FGHSM-FSLM31-MFFFFFNN
% 0.28/0.54 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.28/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.28/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.28/0.54 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.28/0.54 % Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 0.28/0.54 % Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.28/0.54 % G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 2803029 completed with status 0
% 0.28/0.54 % Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 0.28/0.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.28/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.28/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.28/0.54 % No SInE strategy applied
% 0.28/0.54 % Search class: FGUSM-FSLM31-MFFFFFNN
% 0.28/0.54 % partial match(1): FGHSM-FSLM31-MFFFFFNN
% 0.28/0.54 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.28/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.28/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.28/0.54 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.28/0.54 % Preprocessing time : 0.007 s
% 0.28/0.54 % Presaturation interreduction done
% 0.28/0.54
% 0.28/0.54 % Proof found!
% 0.28/0.54 % SZS status Theorem
% 0.28/0.54 % SZS output start CNFRefutation
% See solution above
% 0.28/0.54 % Parsed axioms : 130
% 0.28/0.54 % Removed by relevancy pruning/SinE : 0
% 0.28/0.54 % Initial clauses : 798
% 0.28/0.54 % Removed in clause preprocessing : 23
% 0.28/0.54 % Initial clauses in saturation : 775
% 0.28/0.54 % Processed clauses : 1524
% 0.28/0.54 % ...of these trivial : 17
% 0.28/0.54 % ...subsumed : 334
% 0.28/0.54 % ...remaining for further processing : 1173
% 0.28/0.54 % Other redundant clauses eliminated : 218
% 0.28/0.54 % Clauses deleted for lack of memory : 0
% 0.28/0.54 % Backward-subsumed : 12
% 0.28/0.54 % Backward-rewritten : 9
% 0.28/0.54 % Generated clauses : 1736
% 0.28/0.54 % ...of the previous two non-redundant : 1348
% 0.28/0.54 % ...aggressively subsumed : 0
% 0.28/0.54 % Contextual simplify-reflections : 5
% 0.28/0.54 % Paramodulations : 1615
% 0.28/0.54 % Factorizations : 6
% 0.28/0.54 % NegExts : 0
% 0.28/0.54 % Equation resolutions : 227
% 0.28/0.54 % Disequality decompositions : 0
% 0.28/0.54 % Total rewrite steps : 500
% 0.28/0.54 % ...of those cached : 407
% 0.28/0.54 % Propositional unsat checks : 0
% 0.28/0.54 % Propositional check models : 0
% 0.28/0.54 % Propositional check unsatisfiable : 0
% 0.28/0.54 % Propositional clauses : 0
% 0.28/0.54 % Propositional clauses after purity: 0
% 0.28/0.54 % Propositional unsat core size : 0
% 0.28/0.54 % Propositional preprocessing time : 0.000
% 0.28/0.54 % Propositional encoding time : 0.000
% 0.28/0.54 % Propositional solver time : 0.000
% 0.28/0.54 % Success case prop preproc time : 0.000
% 0.28/0.54 % Success case prop encoding time : 0.000
% 0.28/0.54 % Success case prop solver time : 0.000
% 0.28/0.54 % Current number of processed clauses : 337
% 0.28/0.54 % Positive orientable unit clauses : 80
% 0.28/0.54 % Positive unorientable unit clauses: 0
% 0.28/0.54 % Negative unit clauses : 63
% 0.28/0.54 % Non-unit-clauses : 194
% 0.28/0.54 % Current number of unprocessed clauses: 1322
% 0.28/0.54 % ...number of literals in the above : 4658
% 0.28/0.54 % Current number of archived formulas : 0
% 0.28/0.54 % Current number of archived clauses : 756
% 0.28/0.54 % Clause-clause subsumption calls (NU) : 105146
% 0.28/0.54 % Rec. Clause-clause subsumption calls : 16969
% 0.28/0.54 % Non-unit clause-clause subsumptions : 120
% 0.28/0.54 % Unit Clause-clause subsumption calls : 1972
% 0.28/0.54 % Rewrite failures with RHS unbound : 0
% 0.28/0.54 % BW rewrite match attempts : 573
% 0.28/0.54 % BW rewrite match successes : 7
% 0.28/0.54 % Condensation attempts : 0
% 0.28/0.54 % Condensation successes : 0
% 0.28/0.54 % Termbank termtop insertions : 77768
% 0.28/0.54 % Search garbage collected termcells : 5996
% 0.28/0.54
% 0.28/0.54 % -------------------------------------------------
% 0.28/0.54 % User time : 0.110 s
% 0.28/0.54 % System time : 0.007 s
% 0.28/0.54 % Total time : 0.117 s
% 0.28/0.54 % Maximum resident set size: 5120 pages
% 0.28/0.54
% 0.28/0.54 % -------------------------------------------------
% 0.28/0.54 % User time : 0.462 s
% 0.28/0.54 % System time : 0.034 s
% 0.28/0.54 % Total time : 0.496 s
% 0.28/0.54 % Maximum resident set size: 4864 pages
% 0.28/0.54 % E exiting
%------------------------------------------------------------------------------