%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM244_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 : n009.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:48 PM UTC 2026
% Result : Theorem 0.23s 0.57s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 40 ( 14 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 49 ( 23 ~; 7 |; 14 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-1 aty)
% Number of variables : 11 ( 0 sgn 9 !; 2 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
vOptTerm: $tType ).
tff(decl_sort2,type,
vTy: $tType ).
tff(decl_sort3,type,
vTerm: $tType ).
tff(decl_27,type,
vZero: vTerm ).
tff(decl_29,type,
vTrue: vTerm ).
tff(decl_30,type,
vFalse: vTerm ).
tff(decl_31,type,
vnoTerm: vOptTerm ).
tff(decl_35,type,
visValue: vTerm > $o ).
tff(decl_36,type,
visNV: vTerm > $o ).
tff(decl_37,type,
vreduce: vTerm > vOptTerm ).
tff(decl_40,type,
vptchecksimple: ( vTy * vTerm ) > $o ).
tff(decl_42,type,
esk1_0: vTy ).
tff(decl_77,type,
esk36_1: vTerm > vTerm ).
tff('Progress-Zero',conjecture,
! [X98: vTy] :
( ( ~ visValue(vZero)
& vptchecksimple(vZero,X98) )
=> ( vreduce(vZero) != vnoTerm ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','Progress-Zero') ).
tff('isValue-false-INV',axiom,
! [X2: vTerm] :
( ~ visValue(X2)
=> ? [X14: vTerm] :
( ~ visNV(X14)
& ( X2 = X14 )
& ( X14 != vFalse )
& ( X14 != vTrue ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','isValue-false-INV') ).
tff('isNV-0',axiom,
visNV(vZero),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','isNV-0') ).
tff(c_0_3,negated_conjecture,
~ ! [X98: vTy] :
( ( ~ visValue(vZero)
& vptchecksimple(vZero,X98) )
=> ( vreduce(vZero) != vnoTerm ) ),
inference(assume_negation,[status(cth)],['Progress-Zero']) ).
tff(c_0_4,plain,
! [X2: vTerm] :
( ~ visValue(X2)
=> ? [X14: vTerm] :
( ~ visNV(X14)
& ( X2 = X14 )
& ( X14 != vFalse )
& ( X14 != vTrue ) ) ),
inference(fof_simplification,[status(thm)],['isValue-false-INV']) ).
tff(c_0_5,negated_conjecture,
~ ! [X98: vTy] :
( ( ~ visValue(vZero)
& vptchecksimple(vZero,X98) )
=> ( vreduce(vZero) != vnoTerm ) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
tff(c_0_6,plain,
! [X171: vTerm] :
( ( visValue(X171)
| ~ visNV(esk36_1(X171)) )
& ( visValue(X171)
| ( X171 = esk36_1(X171) ) )
& ( visValue(X171)
| ( esk36_1(X171) != vFalse ) )
& ( visValue(X171)
| ( esk36_1(X171) != vTrue ) ) ),
inference(distribute,[status(thm)],[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,negated_conjecture,
( ( vreduce(vZero) = vnoTerm )
& ~ visValue(vZero)
& vptchecksimple(vZero,esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
tcf(c_0_8,plain,
! [X1: vTerm] :
( ~ visNV(esk36_1(X1))
| visValue(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_9,plain,
! [X1: vTerm] :
( visValue(X1)
| ( X1 = esk36_1(X1) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_10,negated_conjecture,
~ visValue(vZero),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_11,plain,
! [X1: vTerm] :
( ~ visNV(X1)
| visValue(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
tcf(c_0_12,plain,
visNV(vZero),
inference(split_conjunct,[status(thm)],['isNV-0']) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : COM244_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.45 % Computer : n009.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Mon Sep 21 14:21:28 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.53 Running first-order theorem proving
% 0.23/0.53 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.23/0.57 % Version: 3.5.1
% 0.23/0.57 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.57 % Starting sh5l with 300s (1) cores
% 0.23/0.57 % new_bool_3 with pid 1993488 completed with status 0
% 0.23/0.57 % Result found by new_bool_3
% 0.23/0.57 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.57 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.57 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.57 % Search class: FGUSS-FFMM31-MFFFFFNN
% 0.23/0.57 % partial match(2): FGHSM-FFMM31-MFFFFFNN
% 0.23/0.57 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.57 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.57 % SubtermCWHack with pid 1993491 completed with status 0
% 0.23/0.57 % Result found by SubtermCWHack
% 0.23/0.57 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.57 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.57 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.57 % Search class: FGUSS-FFMM31-MFFFFFNN
% 0.23/0.57 % partial match(2): FGHSM-FFMM31-MFFFFFNN
% 0.23/0.57 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.57 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.57 % Preprocessing time : 0.002 s
% 0.23/0.57
% 0.23/0.57 % Proof found!
% 0.23/0.57 % SZS status Theorem
% 0.23/0.57 % SZS output start CNFRefutation
% See solution above
% 0.23/0.57 % Parsed axioms : 127
% 0.23/0.57 % Removed by relevancy pruning/SinE : 46
% 0.23/0.57 % Initial clauses : 108
% 0.23/0.57 % Removed in clause preprocessing : 0
% 0.23/0.57 % Initial clauses in saturation : 108
% 0.23/0.57 % Processed clauses : 40
% 0.23/0.57 % ...of these trivial : 0
% 0.23/0.57 % ...subsumed : 0
% 0.23/0.57 % ...remaining for further processing : 40
% 0.23/0.57 % Other redundant clauses eliminated : 0
% 0.23/0.57 % Clauses deleted for lack of memory : 0
% 0.23/0.57 % Backward-subsumed : 0
% 0.23/0.57 % Backward-rewritten : 0
% 0.23/0.57 % Generated clauses : 7
% 0.23/0.57 % ...of the previous two non-redundant : 5
% 0.23/0.57 % ...aggressively subsumed : 0
% 0.23/0.57 % Contextual simplify-reflections : 0
% 0.23/0.57 % Paramodulations : 7
% 0.23/0.57 % Factorizations : 0
% 0.23/0.57 % NegExts : 0
% 0.23/0.57 % Equation resolutions : 0
% 0.23/0.57 % Disequality decompositions : 0
% 0.23/0.57 % Total rewrite steps : 1
% 0.23/0.57 % ...of those cached : 0
% 0.23/0.57 % Propositional unsat checks : 0
% 0.23/0.57 % Propositional check models : 0
% 0.23/0.57 % Propositional check unsatisfiable : 0
% 0.23/0.57 % Propositional clauses : 0
% 0.23/0.57 % Propositional clauses after purity: 0
% 0.23/0.57 % Propositional unsat core size : 0
% 0.23/0.57 % Propositional preprocessing time : 0.000
% 0.23/0.57 % Propositional encoding time : 0.000
% 0.23/0.57 % Propositional solver time : 0.000
% 0.23/0.57 % Success case prop preproc time : 0.000
% 0.23/0.57 % Success case prop encoding time : 0.000
% 0.23/0.57 % Success case prop solver time : 0.000
% 0.23/0.57 % Current number of processed clauses : 40
% 0.23/0.57 % Positive orientable unit clauses : 11
% 0.23/0.57 % Positive unorientable unit clauses: 0
% 0.23/0.57 % Negative unit clauses : 23
% 0.23/0.57 % Non-unit-clauses : 6
% 0.23/0.57 % Current number of unprocessed clauses: 73
% 0.23/0.57 % ...number of literals in the above : 199
% 0.23/0.57 % Current number of archived formulas : 0
% 0.23/0.57 % Current number of archived clauses : 0
% 0.23/0.57 % Clause-clause subsumption calls (NU) : 3
% 0.23/0.57 % Rec. Clause-clause subsumption calls : 2
% 0.23/0.57 % Non-unit clause-clause subsumptions : 0
% 0.23/0.57 % Unit Clause-clause subsumption calls : 223
% 0.23/0.57 % Rewrite failures with RHS unbound : 0
% 0.23/0.57 % BW rewrite match attempts : 0
% 0.23/0.57 % BW rewrite match successes : 0
% 0.23/0.57 % Condensation attempts : 0
% 0.23/0.57 % Condensation successes : 0
% 0.23/0.57 % Termbank termtop insertions : 6972
% 0.23/0.57 % Search garbage collected termcells : 1872
% 0.23/0.57
% 0.23/0.57 % -------------------------------------------------
% 0.23/0.57 % User time : 0.011 s
% 0.23/0.57 % System time : 0.004 s
% 0.23/0.57 % Total time : 0.015 s
% 0.23/0.57 % Maximum resident set size: 4092 pages
% 0.23/0.57
% 0.23/0.57 % -------------------------------------------------
% 0.23/0.57 % User time : 0.019 s
% 0.23/0.57 % System time : 0.011 s
% 0.23/0.57 % Total time : 0.030 s
% 0.23/0.57 % Maximum resident set size: 5120 pages
% 0.23/0.57 % E exiting
%------------------------------------------------------------------------------