%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM228_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 : n017.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:46 PM UTC 2026
% Result : Theorem 0.16s 0.68s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 78 ( 39 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 107 ( 50 ~; 21 |; 29 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 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 : 9 ( 9 usr; 7 con; 0-3 aty)
% Number of variables : 13 ( 0 sgn 13 !; 0 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
vOptTerm: $tType ).
tff(decl_sort2,type,
vTy: $tType ).
tff(decl_sort3,type,
vTerm: $tType ).
tff(decl_29,type,
vTrue: vTerm ).
tff(decl_30,type,
vFalse: vTerm ).
tff(decl_31,type,
vt3: vTerm ).
tff(decl_32,type,
vnoTerm: vOptTerm ).
tff(decl_34,type,
vt2: vTerm ).
tff(decl_36,type,
vIfelse: ( vTerm * ( vTerm * vTerm ) ) > vTerm ).
tff(decl_37,type,
vt1: vTerm ).
tff(decl_38,type,
visValue: vTerm > $o ).
tff(decl_40,type,
vreduce: vTerm > vOptTerm ).
tff(decl_42,type,
visSomeTerm: vOptTerm > $o ).
tff(decl_43,type,
vptchecksimple: ( vTy * vTerm ) > $o ).
tff(decl_45,type,
esk1_0: vTy ).
tff('Progress-Ifelse-t1',conjecture,
! [X98: vTy] :
( ( ~ visValue(vIfelse(vt1,vt2,vt3))
& vptchecksimple(vIfelse(vt1,vt2,vt3),X98)
& ( vt1 != vFalse )
& ( vt1 != vTrue ) )
=> ( vreduce(vIfelse(vt1,vt2,vt3)) != vnoTerm ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Progress-Ifelse-t1') ).
tff('Progress-Ifelse-t1-isSomeTerm-False',axiom,
! [X98: vTy] :
( ( ~ visValue(vIfelse(vt1,vt2,vt3))
& vptchecksimple(vIfelse(vt1,vt2,vt3),X98)
& ( vt1 != vFalse )
& ( vt1 != vTrue )
& ~ visSomeTerm(vreduce(vt1)) )
=> ( vreduce(vIfelse(vt1,vt2,vt3)) != vnoTerm ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Progress-Ifelse-t1-isSomeTerm-False') ).
tff('Progress-Ifelse-t1-isSomeTerm-True',axiom,
! [X98: vTy] :
( ( ~ visValue(vIfelse(vt1,vt2,vt3))
& vptchecksimple(vIfelse(vt1,vt2,vt3),X98)
& ( vt1 != vFalse )
& ( vt1 != vTrue )
& visSomeTerm(vreduce(vt1)) )
=> ( vreduce(vIfelse(vt1,vt2,vt3)) != vnoTerm ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Progress-Ifelse-t1-isSomeTerm-True') ).
tff(c_0_3,negated_conjecture,
~ ! [X98: vTy] :
( ( ~ visValue(vIfelse(vt1,vt2,vt3))
& vptchecksimple(vIfelse(vt1,vt2,vt3),X98)
& ( vt1 != vFalse )
& ( vt1 != vTrue ) )
=> ( vreduce(vIfelse(vt1,vt2,vt3)) != vnoTerm ) ),
inference(assume_negation,[status(cth)],['Progress-Ifelse-t1']) ).
tff(c_0_4,plain,
! [X98: vTy] :
( ( ~ visValue(vIfelse(vt1,vt2,vt3))
& vptchecksimple(vIfelse(vt1,vt2,vt3),X98)
& ( vt1 != vFalse )
& ( vt1 != vTrue )
& ~ visSomeTerm(vreduce(vt1)) )
=> ( vreduce(vIfelse(vt1,vt2,vt3)) != vnoTerm ) ),
inference(fof_simplification,[status(thm)],['Progress-Ifelse-t1-isSomeTerm-False']) ).
tff(c_0_5,negated_conjecture,
~ ! [X98: vTy] :
( ( ~ visValue(vIfelse(vt1,vt2,vt3))
& vptchecksimple(vIfelse(vt1,vt2,vt3),X98)
& ( vt1 != vFalse )
& ( vt1 != vTrue ) )
=> ( vreduce(vIfelse(vt1,vt2,vt3)) != vnoTerm ) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
tff(c_0_6,plain,
! [X190: vTy] :
( ( vreduce(vIfelse(vt1,vt2,vt3)) != vnoTerm )
| visValue(vIfelse(vt1,vt2,vt3))
| ~ vptchecksimple(vIfelse(vt1,vt2,vt3),X190)
| ( vt1 = vFalse )
| ( vt1 = vTrue )
| visSomeTerm(vreduce(vt1)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
tff(c_0_7,negated_conjecture,
( ( vreduce(vIfelse(vt1,vt2,vt3)) = vnoTerm )
& ~ visValue(vIfelse(vt1,vt2,vt3))
& vptchecksimple(vIfelse(vt1,vt2,vt3),esk1_0)
& ( vt1 != vFalse )
& ( vt1 != vTrue ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
tff(c_0_8,plain,
! [X98: vTy] :
( ( ~ visValue(vIfelse(vt1,vt2,vt3))
& vptchecksimple(vIfelse(vt1,vt2,vt3),X98)
& ( vt1 != vFalse )
& ( vt1 != vTrue )
& visSomeTerm(vreduce(vt1)) )
=> ( vreduce(vIfelse(vt1,vt2,vt3)) != vnoTerm ) ),
inference(fof_simplification,[status(thm)],['Progress-Ifelse-t1-isSomeTerm-True']) ).
tcf(c_0_9,plain,
! [X9: vTy] :
( ( vreduce(vIfelse(vt1,vt2,vt3)) != vnoTerm )
| ~ vptchecksimple(vIfelse(vt1,vt2,vt3),X9)
| visValue(vIfelse(vt1,vt2,vt3))
| ( vt1 = vFalse )
| ( vt1 = vTrue )
| visSomeTerm(vreduce(vt1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_10,negated_conjecture,
vreduce(vIfelse(vt1,vt2,vt3)) = vnoTerm,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_11,negated_conjecture,
vt1 != vTrue,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_12,negated_conjecture,
vt1 != vFalse,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_13,negated_conjecture,
~ visValue(vIfelse(vt1,vt2,vt3)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tff(c_0_14,plain,
! [X191: vTy] :
( ( vreduce(vIfelse(vt1,vt2,vt3)) != vnoTerm )
| visValue(vIfelse(vt1,vt2,vt3))
| ~ vptchecksimple(vIfelse(vt1,vt2,vt3),X191)
| ( vt1 = vFalse )
| ( vt1 = vTrue )
| ~ visSomeTerm(vreduce(vt1)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
tcf(c_0_15,plain,
! [X9: vTy] :
( ~ vptchecksimple(vIfelse(vt1,vt2,vt3),X9)
| visSomeTerm(vreduce(vt1)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]),c_0_11]),c_0_12]),c_0_13]) ).
tcf(c_0_16,negated_conjecture,
vptchecksimple(vIfelse(vt1,vt2,vt3),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_17,plain,
! [X9: vTy] :
( ( vreduce(vIfelse(vt1,vt2,vt3)) != vnoTerm )
| ~ vptchecksimple(vIfelse(vt1,vt2,vt3),X9)
| ~ visSomeTerm(vreduce(vt1))
| visValue(vIfelse(vt1,vt2,vt3))
| ( vt1 = vFalse )
| ( vt1 = vTrue ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
tcf(c_0_18,negated_conjecture,
visSomeTerm(vreduce(vt1)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
tcf(c_0_19,plain,
! [X9: vTy] : ~ vptchecksimple(vIfelse(vt1,vt2,vt3),X9),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_10]),c_0_18])]),c_0_11]),c_0_12]),c_0_13]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_16,c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM228_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.12/0.58 % Computer : n017.cluster.edu
% 0.12/0.58 % Model : x86_64 x86_64
% 0.12/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.58 % Memory : 8046.5625MB
% 0.12/0.58 % OS : Linux 6.8.0-71-generic
% 0.12/0.58 % CPULimit : 300
% 0.12/0.58 % WCLimit : 300
% 0.12/0.58 % DateTime : Mon Sep 21 14:15:43 UTC 2026
% 0.12/0.58 % CPUTime :
% 0.12/0.58 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.63 Running first-order theorem proving
% 0.16/0.63 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.16/0.68 % Version: 3.5.1
% 0.16/0.68 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.68 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.68 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.68 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.68 % Starting sh5l with 300s (1) cores
% 0.16/0.68 % new_bool_3 with pid 2537433 completed with status 0
% 0.16/0.68 % Result found by new_bool_3
% 0.16/0.68 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.68 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.68 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.68 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.68 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.68 % Search class: FGUSS-FFMM31-MFFFFFNN
% 0.16/0.68 % partial match(2): FGHSM-FFMM31-MFFFFFNN
% 0.16/0.68 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.68 % Starting SubtermCWHack with 28s (1) cores
% 0.16/0.68 % SubtermCWHack with pid 2537436 completed with status 0
% 0.16/0.68 % Result found by SubtermCWHack
% 0.16/0.68 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.68 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.68 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.68 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.68 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.68 % Search class: FGUSS-FFMM31-MFFFFFNN
% 0.16/0.68 % partial match(2): FGHSM-FFMM31-MFFFFFNN
% 0.16/0.68 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.68 % Starting SubtermCWHack with 28s (1) cores
% 0.16/0.68 % Preprocessing time : 0.003 s
% 0.16/0.68
% 0.16/0.68 % Proof found!
% 0.16/0.68 % SZS status Theorem
% 0.16/0.68 % SZS output start CNFRefutation
% See solution above
% 0.16/0.68 % Parsed axioms : 135
% 0.16/0.68 % Removed by relevancy pruning/SinE : 49
% 0.16/0.68 % Initial clauses : 115
% 0.16/0.68 % Removed in clause preprocessing : 0
% 0.16/0.68 % Initial clauses in saturation : 115
% 0.16/0.68 % Processed clauses : 440
% 0.16/0.68 % ...of these trivial : 11
% 0.16/0.68 % ...subsumed : 186
% 0.16/0.68 % ...remaining for further processing : 243
% 0.16/0.68 % Other redundant clauses eliminated : 126
% 0.16/0.68 % Clauses deleted for lack of memory : 0
% 0.16/0.68 % Backward-subsumed : 3
% 0.16/0.68 % Backward-rewritten : 27
% 0.16/0.68 % Generated clauses : 946
% 0.16/0.68 % ...of the previous two non-redundant : 656
% 0.16/0.68 % ...aggressively subsumed : 0
% 0.16/0.68 % Contextual simplify-reflections : 0
% 0.16/0.68 % Paramodulations : 807
% 0.16/0.68 % Factorizations : 0
% 0.16/0.68 % NegExts : 0
% 0.16/0.68 % Equation resolutions : 138
% 0.16/0.68 % Disequality decompositions : 0
% 0.16/0.68 % Total rewrite steps : 213
% 0.16/0.68 % ...of those cached : 144
% 0.16/0.68 % Propositional unsat checks : 0
% 0.16/0.68 % Propositional check models : 0
% 0.16/0.68 % Propositional check unsatisfiable : 0
% 0.16/0.68 % Propositional clauses : 0
% 0.16/0.68 % Propositional clauses after purity: 0
% 0.16/0.68 % Propositional unsat core size : 0
% 0.16/0.68 % Propositional preprocessing time : 0.000
% 0.16/0.68 % Propositional encoding time : 0.000
% 0.16/0.68 % Propositional solver time : 0.000
% 0.16/0.68 % Success case prop preproc time : 0.000
% 0.16/0.68 % Success case prop encoding time : 0.000
% 0.16/0.68 % Success case prop solver time : 0.000
% 0.16/0.68 % Current number of processed clauses : 212
% 0.16/0.68 % Positive orientable unit clauses : 57
% 0.16/0.68 % Positive unorientable unit clauses: 7
% 0.16/0.68 % Negative unit clauses : 47
% 0.16/0.68 % Non-unit-clauses : 101
% 0.16/0.68 % Current number of unprocessed clauses: 312
% 0.16/0.68 % ...number of literals in the above : 1035
% 0.16/0.68 % Current number of archived formulas : 0
% 0.16/0.68 % Current number of archived clauses : 31
% 0.16/0.68 % Clause-clause subsumption calls (NU) : 3853
% 0.16/0.68 % Rec. Clause-clause subsumption calls : 2828
% 0.16/0.68 % Non-unit clause-clause subsumptions : 80
% 0.16/0.68 % Unit Clause-clause subsumption calls : 1469
% 0.16/0.68 % Rewrite failures with RHS unbound : 76
% 0.16/0.68 % BW rewrite match attempts : 50
% 0.16/0.68 % BW rewrite match successes : 38
% 0.16/0.68 % Condensation attempts : 0
% 0.16/0.68 % Condensation successes : 0
% 0.16/0.68 % Termbank termtop insertions : 17688
% 0.16/0.68 % Search garbage collected termcells : 2015
% 0.16/0.68
% 0.16/0.68 % -------------------------------------------------
% 0.16/0.68 % User time : 0.029 s
% 0.16/0.68 % System time : 0.005 s
% 0.16/0.68 % Total time : 0.034 s
% 0.16/0.68 % Maximum resident set size: 4104 pages
% 0.16/0.68
% 0.16/0.68 % -------------------------------------------------
% 0.16/0.68 % User time : 0.035 s
% 0.16/0.68 % System time : 0.009 s
% 0.16/0.68 % Total time : 0.044 s
% 0.16/0.68 % Maximum resident set size: 5120 pages
% 0.16/0.68 % E exiting
%------------------------------------------------------------------------------