%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM216_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 : 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:11:44 PM UTC 2026
% Result : Theorem 0.33s 15.54s
% Output : CNFRefutation 0.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 27 unt; 0 typ; 0 def)
% Number of atoms : 84 ( 77 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 99 ( 49 ~; 22 |; 24 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 27 ( 27 usr; 6 con; 0-3 aty)
% Number of variables : 72 ( 0 sgn 72 !; 0 ?; 72 :)
% 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_28,type,
vIszero: vTerm > vTerm ).
tff(decl_29,type,
vTrue: vTerm ).
tff(decl_30,type,
vFalse: vTerm ).
tff(decl_31,type,
vnoTerm: vOptTerm ).
tff(decl_32,type,
vPlus: ( vTerm * vTerm ) > vTerm ).
tff(decl_34,type,
vIfelse: ( vTerm * ( vTerm * vTerm ) ) > vTerm ).
tff(decl_37,type,
vreduce: vTerm > vOptTerm ).
tff(decl_40,type,
vptchecksimple: ( vTy * vTerm ) > $o ).
tff(decl_42,type,
esk1_0: vTy ).
tff(decl_43,type,
esk2_0: vTerm ).
tff(decl_57,type,
esk16_1: vTerm > vTerm ).
tff(decl_58,type,
esk17_1: vTerm > vTerm ).
tff(decl_59,type,
esk18_1: vTerm > vTerm ).
tff(decl_60,type,
esk19_1: vTerm > vTerm ).
tff(decl_61,type,
esk20_1: vTerm > vTerm ).
tff(decl_62,type,
esk21_1: vTerm > vTerm ).
tff(decl_63,type,
esk22_1: vTerm > vTerm ).
tff(decl_64,type,
esk23_1: vTerm > vTerm ).
tff(decl_65,type,
esk24_1: vTerm > vTerm ).
tff(decl_66,type,
esk25_1: vTerm > vTerm ).
tff(decl_67,type,
esk26_1: vTerm > vTerm ).
tff(decl_68,type,
esk27_1: vTerm > vTerm ).
tff(decl_69,type,
esk28_1: vTerm > vTerm ).
tff(decl_70,type,
esk29_1: vTerm > vTerm ).
tff('DIFF-noTerm-someTerm',axiom,
! [X2: vTerm] : ( vnoTerm != vsomeTerm(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','DIFF-noTerm-someTerm') ).
tff('Preservation-False',conjecture,
! [X98: vTy,X99: vTerm] :
( ( ( vreduce(vFalse) = vsomeTerm(X99) )
& vptchecksimple(vFalse,X98) )
=> vptchecksimple(X99,X98) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','Preservation-False') ).
tff('DIFF-False-Ifelse',axiom,
! [X2: vTerm,X3: vTerm,X4: vTerm] : ( vFalse != vIfelse(X2,X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','DIFF-False-Ifelse') ).
tff('reduce-23',axiom,
! [X12: vTerm] :
( ( ! [X29: vTerm,X19: vTerm] : ( X12 != vPlus(X29,X19) )
& ! [X29: vTerm] : ( X12 != vIszero(X29) )
& ! [X13: vTerm] : ( X12 != vIszero(vSucc(X13)) )
& ( X12 != vIszero(vZero) )
& ! [X29: vTerm] : ( X12 != vPred(X29) )
& ! [X13: vTerm] : ( X12 != vPred(vSucc(X13)) )
& ( X12 != vPred(vZero) )
& ! [X29: vTerm] : ( X12 != vSucc(X29) )
& ! [X29: vTerm,X19: vTerm,X18: vTerm] : ( X12 != vIfelse(X29,X19,X18) )
& ! [X19: vTerm,X18: vTerm] : ( X12 != vIfelse(vFalse,X19,X18) )
& ! [X19: vTerm,X18: vTerm] : ( X12 != vIfelse(vTrue,X19,X18) ) )
=> ( vreduce(X12) = vnoTerm ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','reduce-23') ).
tff('DIFF-False-Plus',axiom,
! [X2: vTerm,X3: vTerm] : ( vFalse != vPlus(X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','DIFF-False-Plus') ).
tff('DIFF-False-Iszero',axiom,
! [X2: vTerm] : ( vFalse != vIszero(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','DIFF-False-Iszero') ).
tff('DIFF-False-Pred',axiom,
! [X2: vTerm] : ( vFalse != vPred(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','DIFF-False-Pred') ).
tff('DIFF-False-Succ',axiom,
! [X2: vTerm] : ( vFalse != vSucc(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','DIFF-False-Succ') ).
tff(c_0_8,plain,
! [X2: vTerm] : ( vnoTerm != vsomeTerm(X2) ),
inference(fof_simplification,[status(thm)],['DIFF-noTerm-someTerm']) ).
tff(c_0_9,negated_conjecture,
~ ! [X98: vTy,X99: vTerm] :
( ( ( vreduce(vFalse) = vsomeTerm(X99) )
& vptchecksimple(vFalse,X98) )
=> vptchecksimple(X99,X98) ),
inference(assume_negation,[status(cth)],['Preservation-False']) ).
tff(c_0_10,plain,
! [X2: vTerm,X3: vTerm,X4: vTerm] : ( vFalse != vIfelse(X2,X3,X4) ),
inference(fof_simplification,[status(thm)],['DIFF-False-Ifelse']) ).
tff(c_0_11,plain,
! [X12: vTerm] :
( ( ! [X29: vTerm,X19: vTerm] : ( X12 != vPlus(X29,X19) )
& ! [X29: vTerm] : ( X12 != vIszero(X29) )
& ! [X13: vTerm] : ( X12 != vIszero(vSucc(X13)) )
& ( X12 != vIszero(vZero) )
& ! [X29: vTerm] : ( X12 != vPred(X29) )
& ! [X13: vTerm] : ( X12 != vPred(vSucc(X13)) )
& ( X12 != vPred(vZero) )
& ! [X29: vTerm] : ( X12 != vSucc(X29) )
& ! [X29: vTerm,X19: vTerm,X18: vTerm] : ( X12 != vIfelse(X29,X19,X18) )
& ! [X19: vTerm,X18: vTerm] : ( X12 != vIfelse(vFalse,X19,X18) )
& ! [X19: vTerm,X18: vTerm] : ( X12 != vIfelse(vTrue,X19,X18) ) )
=> ( vreduce(X12) = vnoTerm ) ),
inference(fof_simplification,[status(thm)],['reduce-23']) ).
tff(c_0_12,plain,
! [X2: vTerm,X3: vTerm] : ( vFalse != vPlus(X2,X3) ),
inference(fof_simplification,[status(thm)],['DIFF-False-Plus']) ).
tff(c_0_13,plain,
! [X2: vTerm] : ( vFalse != vIszero(X2) ),
inference(fof_simplification,[status(thm)],['DIFF-False-Iszero']) ).
tff(c_0_14,plain,
! [X2: vTerm] : ( vFalse != vPred(X2) ),
inference(fof_simplification,[status(thm)],['DIFF-False-Pred']) ).
tff(c_0_15,plain,
! [X2: vTerm] : ( vFalse != vSucc(X2) ),
inference(fof_simplification,[status(thm)],['DIFF-False-Succ']) ).
tff(c_0_16,plain,
! [X265: vTerm] : ( vnoTerm != vsomeTerm(X265) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_8])]) ).
tff(c_0_17,negated_conjecture,
( ~ vptchecksimple(esk2_0,esk1_0)
& ( vreduce(vFalse) = vsomeTerm(esk2_0) )
& vptchecksimple(vFalse,esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
tff(c_0_18,plain,
! [X148: vTerm,X149: vTerm,X150: vTerm] : ( vFalse != vIfelse(X148,X149,X150) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_10])]) ).
tff(c_0_19,plain,
! [X163: vTerm] :
( ( vreduce(X163) = vnoTerm )
| ( X163 = vPlus(esk28_1(X163),esk29_1(X163)) )
| ( X163 = vIszero(esk27_1(X163)) )
| ( X163 = vIszero(vSucc(esk26_1(X163))) )
| ( X163 = vIszero(vZero) )
| ( X163 = vPred(esk25_1(X163)) )
| ( X163 = vPred(vSucc(esk24_1(X163))) )
| ( X163 = vPred(vZero) )
| ( X163 = vSucc(esk23_1(X163)) )
| ( X163 = vIfelse(esk20_1(X163),esk21_1(X163),esk22_1(X163)) )
| ( X163 = vIfelse(vFalse,esk18_1(X163),esk19_1(X163)) )
| ( X163 = vIfelse(vTrue,esk16_1(X163),esk17_1(X163)) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
tff(c_0_20,plain,
! [X154: vTerm,X155: vTerm] : ( vFalse != vPlus(X154,X155) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_12])]) ).
tff(c_0_21,plain,
! [X153: vTerm] : ( vFalse != vIszero(X153) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_13])]) ).
tff(c_0_22,plain,
! [X152: vTerm] : ( vFalse != vPred(X152) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_14])]) ).
tff(c_0_23,plain,
! [X151: vTerm] : ( vFalse != vSucc(X151) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_15])]) ).
tcf(c_0_24,plain,
! [X1: vTerm] : vnoTerm != vsomeTerm(X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
tcf(c_0_25,negated_conjecture,
vreduce(vFalse) = vsomeTerm(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
tcf(c_0_26,plain,
! [X1: vTerm,X2: vTerm,X3: vTerm] : vFalse != vIfelse(X1,X2,X3),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
tcf(c_0_27,plain,
! [X1: vTerm] :
( ( vreduce(X1) = vnoTerm )
| ( X1 = vPlus(esk28_1(X1),esk29_1(X1)) )
| ( X1 = vIszero(esk27_1(X1)) )
| ( X1 = vIszero(vSucc(esk26_1(X1))) )
| ( X1 = vIszero(vZero) )
| ( X1 = vPred(esk25_1(X1)) )
| ( X1 = vPred(vSucc(esk24_1(X1))) )
| ( X1 = vPred(vZero) )
| ( X1 = vSucc(esk23_1(X1)) )
| ( X1 = vIfelse(esk20_1(X1),esk21_1(X1),esk22_1(X1)) )
| ( X1 = vIfelse(vFalse,esk18_1(X1),esk19_1(X1)) )
| ( X1 = vIfelse(vTrue,esk16_1(X1),esk17_1(X1)) ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
tcf(c_0_28,plain,
! [X1: vTerm,X2: vTerm] : vFalse != vPlus(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
tcf(c_0_29,plain,
! [X1: vTerm] : vFalse != vIszero(X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
tcf(c_0_30,plain,
! [X1: vTerm] : vFalse != vPred(X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
tcf(c_0_31,plain,
! [X1: vTerm] : vFalse != vSucc(X1),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
tcf(c_0_32,negated_conjecture,
vreduce(vFalse) != vnoTerm,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_33,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27])]),c_0_26]),c_0_26]),c_0_28]),c_0_29]),c_0_30]),c_0_29]),c_0_30]),c_0_31]),c_0_32]),c_0_29]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COM216_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.34 % Computer : n011.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/15.44 % CPULimit : 300
% 0.07/15.44 % WCLimit : 300
% 0.07/15.44 % DateTime : Mon Sep 21 14:19:52 UTC 2026
% 0.07/15.44 % CPUTime :
% 0.07/15.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/15.48 Running first-order theorem proving
% 0.07/15.48 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.33/15.54 % Version: 3.5.1
% 0.33/15.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.33/15.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/15.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.33/15.54 % Starting new_bool_3 with 300s (1) cores
% 0.33/15.54 % Starting new_bool_1 with 300s (1) cores
% 0.33/15.54 % Starting sh5l with 300s (1) cores
% 0.33/15.54 % new_bool_3 with pid 982609 completed with status 0
% 0.33/15.54 % Result found by new_bool_3
% 0.33/15.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.33/15.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/15.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.33/15.54 % Starting new_bool_3 with 300s (1) cores
% 0.33/15.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.33/15.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.33/15.54 % Search class: FGUSS-FFMM31-MFFFFFNN
% 0.33/15.54 % partial match(2): FGHSM-FFMM31-MFFFFFNN
% 0.33/15.54 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.33/15.54 % Starting SubtermCWHack with 28s (1) cores
% 0.33/15.54 % SubtermCWHack with pid 982612 completed with status 0
% 0.33/15.54 % Result found by SubtermCWHack
% 0.33/15.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.33/15.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/15.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.33/15.54 % Starting new_bool_3 with 300s (1) cores
% 0.33/15.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.33/15.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.33/15.54 % Search class: FGUSS-FFMM31-MFFFFFNN
% 0.33/15.54 % partial match(2): FGHSM-FFMM31-MFFFFFNN
% 0.33/15.54 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.33/15.54 % Starting SubtermCWHack with 28s (1) cores
% 0.33/15.54 % Preprocessing time : 0.002 s
% 0.33/15.54
% 0.33/15.54 % Proof found!
% 0.33/15.54 % SZS status Theorem
% 0.33/15.54 % SZS output start CNFRefutation
% See solution above
% 0.33/15.54 % Parsed axioms : 127
% 0.33/15.54 % Removed by relevancy pruning/SinE : 51
% 0.33/15.54 % Initial clauses : 96
% 0.33/15.54 % Removed in clause preprocessing : 0
% 0.33/15.54 % Initial clauses in saturation : 96
% 0.33/15.54 % Processed clauses : 396
% 0.33/15.54 % ...of these trivial : 5
% 0.33/15.54 % ...subsumed : 175
% 0.33/15.54 % ...remaining for further processing : 216
% 0.33/15.54 % Other redundant clauses eliminated : 121
% 0.33/15.54 % Clauses deleted for lack of memory : 0
% 0.33/15.54 % Backward-subsumed : 0
% 0.33/15.54 % Backward-rewritten : 16
% 0.33/15.54 % Generated clauses : 998
% 0.33/15.54 % ...of the previous two non-redundant : 660
% 0.33/15.54 % ...aggressively subsumed : 0
% 0.33/15.54 % Contextual simplify-reflections : 0
% 0.33/15.54 % Paramodulations : 865
% 0.33/15.54 % Factorizations : 0
% 0.33/15.54 % NegExts : 0
% 0.33/15.54 % Equation resolutions : 133
% 0.33/15.54 % Disequality decompositions : 0
% 0.33/15.54 % Total rewrite steps : 228
% 0.33/15.54 % ...of those cached : 164
% 0.33/15.54 % Propositional unsat checks : 0
% 0.33/15.54 % Propositional check models : 0
% 0.33/15.54 % Propositional check unsatisfiable : 0
% 0.33/15.54 % Propositional clauses : 0
% 0.33/15.54 % Propositional clauses after purity: 0
% 0.33/15.54 % Propositional unsat core size : 0
% 0.33/15.54 % Propositional preprocessing time : 0.000
% 0.33/15.54 % Propositional encoding time : 0.000
% 0.33/15.54 % Propositional solver time : 0.000
% 0.33/15.54 % Success case prop preproc time : 0.000
% 0.33/15.54 % Success case prop encoding time : 0.000
% 0.33/15.54 % Success case prop solver time : 0.000
% 0.33/15.54 % Current number of processed clauses : 200
% 0.33/15.54 % Positive orientable unit clauses : 39
% 0.33/15.54 % Positive unorientable unit clauses: 6
% 0.33/15.54 % Negative unit clauses : 45
% 0.33/15.54 % Non-unit-clauses : 110
% 0.33/15.54 % Current number of unprocessed clauses: 331
% 0.33/15.54 % ...number of literals in the above : 1133
% 0.33/15.54 % Current number of archived formulas : 0
% 0.33/15.54 % Current number of archived clauses : 16
% 0.33/15.54 % Clause-clause subsumption calls (NU) : 3287
% 0.33/15.54 % Rec. Clause-clause subsumption calls : 2404
% 0.33/15.54 % Non-unit clause-clause subsumptions : 74
% 0.33/15.54 % Unit Clause-clause subsumption calls : 510
% 0.33/15.54 % Rewrite failures with RHS unbound : 46
% 0.33/15.54 % BW rewrite match attempts : 36
% 0.33/15.54 % BW rewrite match successes : 26
% 0.33/15.54 % Condensation attempts : 0
% 0.33/15.54 % Condensation successes : 0
% 0.33/15.54 % Termbank termtop insertions : 16708
% 0.33/15.54 % Search garbage collected termcells : 1788
% 0.33/15.54
% 0.33/15.54 % -------------------------------------------------
% 0.33/15.54 % User time : 0.027 s
% 0.33/15.54 % System time : 0.005 s
% 0.33/15.54 % Total time : 0.032 s
% 0.33/15.54 % Maximum resident set size: 4096 pages
% 0.33/15.54
% 0.33/15.54 % -------------------------------------------------
% 0.33/15.54 % User time : 0.031 s
% 0.33/15.54 % System time : 0.010 s
% 0.33/15.54 % Total time : 0.042 s
% 0.33/15.54 % Maximum resident set size: 4864 pages
% 0.33/15.54 % E exiting
%------------------------------------------------------------------------------