%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM214_1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:44 PM UTC 2026
% Result : Theorem 0.25s 0.50s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 12 unt; 0 typ; 0 def)
% Number of atoms : 33 ( 21 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 29 ( 15 ~; 4 |; 6 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn 17 !; 0 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
vTy: $tType ).
tff(decl_sort2,type,
vTerm: $tType ).
tff(decl_23,type,
vNat: vTy ).
tff(decl_24,type,
vSucc: vTerm > vTerm ).
tff(decl_27,type,
vZero: vTerm ).
tff(decl_30,type,
vFalse: vTerm ).
tff(decl_38,type,
vplusop: ( vTerm * vTerm ) > vTerm ).
tff(decl_40,type,
vptchecksimple: ( vTy * vTerm ) > $o ).
tff(decl_50,type,
esk1_0: vTerm ).
tff(decl_51,type,
esk2_1: vTerm > vTerm ).
tff('DIFF-False-Succ',axiom,
! [X2: vTerm] : ( vFalse != vSucc(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','DIFF-False-Succ') ).
tff('plusop-2',axiom,
! [X17: vTerm,X16: vTerm] :
( ( ! [X18: vTerm] : ( X17 != vSucc(X18) )
& ( X17 != vZero ) )
=> ( vplusop(X16,X17) = X17 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','plusop-2') ).
tff('DIFF-False-Zero',axiom,
vFalse != vZero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p','DIFF-False-Zero') ).
tff('PlusPreservation-False',conjecture,
! [X10: vTerm] :
( ( vptchecksimple(vFalse,vNat)
& vptchecksimple(X10,vNat) )
=> vptchecksimple(vplusop(X10,vFalse),vNat) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','PlusPreservation-False') ).
tff(c_0_4,plain,
! [X2: vTerm] : ( vFalse != vSucc(X2) ),
inference(fof_simplification,[status(thm)],['DIFF-False-Succ']) ).
tff(c_0_5,plain,
! [X17: vTerm,X16: vTerm] :
( ( ! [X18: vTerm] : ( X17 != vSucc(X18) )
& ( X17 != vZero ) )
=> ( vplusop(X16,X17) = X17 ) ),
inference(fof_simplification,[status(thm)],['plusop-2']) ).
tff(c_0_6,plain,
vFalse != vZero,
inference(fof_simplification,[status(thm)],['DIFF-False-Zero']) ).
tff(c_0_7,negated_conjecture,
~ ! [X10: vTerm] :
( ( vptchecksimple(vFalse,vNat)
& vptchecksimple(X10,vNat) )
=> vptchecksimple(vplusop(X10,vFalse),vNat) ),
inference(assume_negation,[status(cth)],['PlusPreservation-False']) ).
tff(c_0_8,plain,
! [X186: vTerm] : ( vFalse != vSucc(X186) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_4])]) ).
tff(c_0_9,plain,
! [X142: vTerm,X144: vTerm] :
( ( vplusop(X144,X142) = X142 )
| ( X142 = vSucc(esk2_1(X142)) )
| ( X142 = vZero ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
tff(c_0_10,plain,
vFalse != vZero,
inference(fof_nnf,[status(thm)],[c_0_6]) ).
tff(c_0_11,negated_conjecture,
( ~ vptchecksimple(vplusop(esk1_0,vFalse),vNat)
& vptchecksimple(vFalse,vNat)
& vptchecksimple(esk1_0,vNat) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
tcf(c_0_12,plain,
! [X1: vTerm] : vFalse != vSucc(X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_13,plain,
! [X2: vTerm,X1: vTerm] :
( ( vplusop(X2,X1) = X1 )
| ( X1 = vSucc(esk2_1(X1)) )
| ( X1 = vZero ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_14,plain,
vFalse != vZero,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tcf(c_0_15,negated_conjecture,
~ vptchecksimple(vplusop(esk1_0,vFalse),vNat),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tcf(c_0_16,plain,
! [X1: vTerm] : vplusop(X1,vFalse) = vFalse,
inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13])]),c_0_14]) ).
tcf(c_0_17,negated_conjecture,
vptchecksimple(vFalse,vNat),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM214_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.38 % Computer : n014.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Mon Sep 21 14:20:05 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/0.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.25/0.50 % Version: 3.5.1
% 0.25/0.50 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.25/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.25/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.50 % Starting sh5l with 300s (1) cores
% 0.25/0.50 % sh5l with pid 95237 completed with status 0
% 0.25/0.50 % Result found by sh5l
% 0.25/0.50 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.25/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.25/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.50 % Starting sh5l with 300s (1) cores
% 0.25/0.50 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.25/0.50 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.25/0.50 % Search class: FGUSM-FSLM31-MFFFFFNN
% 0.25/0.50 % partial match(1): FGHSM-FSLM31-MFFFFFNN
% 0.25/0.50 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.50 % Starting SubtermCWHack with 28s (1) cores
% 0.25/0.50 % SubtermCWHack with pid 95247 completed with status 0
% 0.25/0.50 % Result found by SubtermCWHack
% 0.25/0.50 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.25/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.25/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.50 % Starting sh5l with 300s (1) cores
% 0.25/0.50 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.25/0.50 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.25/0.50 % Search class: FGUSM-FSLM31-MFFFFFNN
% 0.25/0.50 % partial match(1): FGHSM-FSLM31-MFFFFFNN
% 0.25/0.50 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.50 % Starting SubtermCWHack with 28s (1) cores
% 0.25/0.50 % Preprocessing time : 0.009 s
% 0.25/0.50
% 0.25/0.50 % Proof found!
% 0.25/0.50 % SZS status Theorem
% 0.25/0.50 % SZS output start CNFRefutation
% See solution above
% 0.25/0.50 % Parsed axioms : 127
% 0.25/0.50 % Removed by relevancy pruning/SinE : 22
% 0.25/0.50 % Initial clauses : 769
% 0.25/0.50 % Removed in clause preprocessing : 0
% 0.25/0.50 % Initial clauses in saturation : 769
% 0.25/0.50 % Processed clauses : 321
% 0.25/0.50 % ...of these trivial : 2
% 0.25/0.50 % ...subsumed : 115
% 0.25/0.50 % ...remaining for further processing : 204
% 0.25/0.50 % Other redundant clauses eliminated : 88
% 0.25/0.50 % Clauses deleted for lack of memory : 0
% 0.25/0.50 % Backward-subsumed : 4
% 0.25/0.50 % Backward-rewritten : 6
% 0.25/0.50 % Generated clauses : 539
% 0.25/0.50 % ...of the previous two non-redundant : 335
% 0.25/0.50 % ...aggressively subsumed : 0
% 0.25/0.50 % Contextual simplify-reflections : 2
% 0.25/0.50 % Paramodulations : 401
% 0.25/0.50 % Factorizations : 44
% 0.25/0.50 % NegExts : 0
% 0.25/0.50 % Equation resolutions : 94
% 0.25/0.50 % Disequality decompositions : 0
% 0.25/0.50 % Total rewrite steps : 75
% 0.25/0.50 % ...of those cached : 51
% 0.25/0.50 % Propositional unsat checks : 0
% 0.25/0.50 % Propositional check models : 0
% 0.25/0.50 % Propositional check unsatisfiable : 0
% 0.25/0.50 % Propositional clauses : 0
% 0.25/0.50 % Propositional clauses after purity: 0
% 0.25/0.50 % Propositional unsat core size : 0
% 0.25/0.50 % Propositional preprocessing time : 0.000
% 0.25/0.50 % Propositional encoding time : 0.000
% 0.25/0.50 % Propositional solver time : 0.000
% 0.25/0.50 % Success case prop preproc time : 0.000
% 0.25/0.50 % Success case prop encoding time : 0.000
% 0.25/0.50 % Success case prop solver time : 0.000
% 0.25/0.50 % Current number of processed clauses : 194
% 0.25/0.50 % Positive orientable unit clauses : 26
% 0.25/0.50 % Positive unorientable unit clauses: 0
% 0.25/0.50 % Negative unit clauses : 37
% 0.25/0.50 % Non-unit-clauses : 131
% 0.25/0.50 % Current number of unprocessed clauses: 777
% 0.25/0.50 % ...number of literals in the above : 3635
% 0.25/0.50 % Current number of archived formulas : 0
% 0.25/0.50 % Current number of archived clauses : 10
% 0.25/0.50 % Clause-clause subsumption calls (NU) : 4939
% 0.25/0.50 % Rec. Clause-clause subsumption calls : 3397
% 0.25/0.50 % Non-unit clause-clause subsumptions : 96
% 0.25/0.50 % Unit Clause-clause subsumption calls : 873
% 0.25/0.50 % Rewrite failures with RHS unbound : 0
% 0.25/0.50 % BW rewrite match attempts : 2
% 0.25/0.50 % BW rewrite match successes : 2
% 0.25/0.50 % Condensation attempts : 0
% 0.25/0.50 % Condensation successes : 0
% 0.25/0.50 % Termbank termtop insertions : 36696
% 0.25/0.50 % Search garbage collected termcells : 5913
% 0.25/0.50
% 0.25/0.50 % -------------------------------------------------
% 0.25/0.50 % User time : 0.040 s
% 0.25/0.50 % System time : 0.002 s
% 0.25/0.50 % Total time : 0.042 s
% 0.25/0.50 % Maximum resident set size: 5372 pages
% 0.25/0.50
% 0.25/0.50 % -------------------------------------------------
% 0.25/0.50 % User time : 0.045 s
% 0.25/0.50 % System time : 0.007 s
% 0.25/0.50 % Total time : 0.052 s
% 0.25/0.50 % Maximum resident set size: 5120 pages
% 0.25/0.50 % E exiting
%------------------------------------------------------------------------------