%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM217_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 : n006.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.15s 5.51s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 74 ( 38 equ)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 83 ( 30 ~; 28 |; 18 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 6 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 : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-3 aty)
% Number of variables : 31 ( 0 sgn 31 !; 0 ?; 31 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
vOptTerm: $tType ).
tff(decl_sort2,type,
vTy: $tType ).
tff(decl_sort3,type,
vTerm: $tType ).
tff(decl_26,type,
vsomeTerm: vTerm > vOptTerm ).
tff(decl_29,type,
vTrue: vTerm ).
tff(decl_30,type,
vFalse: vTerm ).
tff(decl_31,type,
vt3: vTerm ).
tff(decl_34,type,
vt2: vTerm ).
tff(decl_36,type,
vIfelse: ( vTerm * ( vTerm * vTerm ) ) > vTerm ).
tff(decl_37,type,
vt1: vTerm ).
tff(decl_40,type,
vreduce: vTerm > vOptTerm ).
tff(decl_43,type,
vptchecksimple: ( vTy * vTerm ) > $o ).
tff(decl_45,type,
esk1_0: vTy ).
tff(decl_46,type,
esk2_0: vTerm ).
tff('Preservation-Ifelse-t1',axiom,
! [X98: vTy,X99: vTerm] :
( ( ( vreduce(vIfelse(vt1,vt2,vt3)) = vsomeTerm(X99) )
& vptchecksimple(vIfelse(vt1,vt2,vt3),X98)
& ( vt1 != vFalse )
& ( vt1 != vTrue ) )
=> vptchecksimple(X99,X98) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Preservation-Ifelse-t1') ).
tff('Preservation-Ifelse-False',axiom,
! [X98: vTy,X99: vTerm] :
( ( ( vreduce(vIfelse(vt1,vt2,vt3)) = vsomeTerm(X99) )
& vptchecksimple(vIfelse(vt1,vt2,vt3),X98)
& ( vt1 = vFalse )
& ( vt1 != vTrue ) )
=> vptchecksimple(X99,X98) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Preservation-Ifelse-False') ).
tff('Preservation-Ifelse-True',axiom,
! [X98: vTy,X99: vTerm] :
( ( ( vreduce(vIfelse(vt1,vt2,vt3)) = vsomeTerm(X99) )
& vptchecksimple(vIfelse(vt1,vt2,vt3),X98)
& ( vt1 = vTrue ) )
=> vptchecksimple(X99,X98) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Preservation-Ifelse-True') ).
tff('Preservation-Ifelse',conjecture,
! [X98: vTy,X99: vTerm] :
( ( ( vreduce(vIfelse(vt1,vt2,vt3)) = vsomeTerm(X99) )
& vptchecksimple(vIfelse(vt1,vt2,vt3),X98) )
=> vptchecksimple(X99,X98) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','Preservation-Ifelse') ).
tff(c_0_4,plain,
! [X98: vTy,X99: vTerm] :
( ( ( vreduce(vIfelse(vt1,vt2,vt3)) = vsomeTerm(X99) )
& vptchecksimple(vIfelse(vt1,vt2,vt3),X98)
& ( vt1 != vFalse )
& ( vt1 != vTrue ) )
=> vptchecksimple(X99,X98) ),
inference(fof_simplification,[status(thm)],['Preservation-Ifelse-t1']) ).
tff(c_0_5,plain,
! [X98: vTy,X99: vTerm] :
( ( ( vreduce(vIfelse(vt1,vt2,vt3)) = vsomeTerm(X99) )
& vptchecksimple(vIfelse(vt1,vt2,vt3),X98)
& ( vt1 = vFalse )
& ( vt1 != vTrue ) )
=> vptchecksimple(X99,X98) ),
inference(fof_simplification,[status(thm)],['Preservation-Ifelse-False']) ).
tff(c_0_6,plain,
! [X168: vTy,X169: vTerm] :
( vptchecksimple(X169,X168)
| ( vreduce(vIfelse(vt1,vt2,vt3)) != vsomeTerm(X169) )
| ~ vptchecksimple(vIfelse(vt1,vt2,vt3),X168)
| ( vt1 = vFalse )
| ( vt1 = vTrue ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
tff(c_0_7,plain,
! [X166: vTy,X167: vTerm] :
( vptchecksimple(X167,X166)
| ( vreduce(vIfelse(vt1,vt2,vt3)) != vsomeTerm(X167) )
| ~ vptchecksimple(vIfelse(vt1,vt2,vt3),X166)
| ( vt1 != vTrue ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['Preservation-Ifelse-True'])])]) ).
tff(c_0_8,plain,
! [X164: vTy,X165: vTerm] :
( vptchecksimple(X165,X164)
| ( vreduce(vIfelse(vt1,vt2,vt3)) != vsomeTerm(X165) )
| ~ vptchecksimple(vIfelse(vt1,vt2,vt3),X164)
| ( vt1 != vFalse )
| ( vt1 = vTrue ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
tcf(c_0_9,plain,
! [X9: vTy,X1: vTerm] :
( ( vreduce(vIfelse(vt1,vt2,vt3)) != vsomeTerm(X1) )
| ~ vptchecksimple(vIfelse(vt1,vt2,vt3),X9)
| vptchecksimple(X1,X9)
| ( vt1 = vFalse )
| ( vt1 = vTrue ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_10,plain,
! [X9: vTy,X1: vTerm] :
( ( vreduce(vIfelse(vt1,vt2,vt3)) != vsomeTerm(X1) )
| ~ vptchecksimple(vIfelse(vt1,vt2,vt3),X9)
| ( vt1 != vTrue )
| vptchecksimple(X1,X9) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tff(c_0_11,negated_conjecture,
~ ! [X98: vTy,X99: vTerm] :
( ( ( vreduce(vIfelse(vt1,vt2,vt3)) = vsomeTerm(X99) )
& vptchecksimple(vIfelse(vt1,vt2,vt3),X98) )
=> vptchecksimple(X99,X98) ),
inference(assume_negation,[status(cth)],['Preservation-Ifelse']) ).
tcf(c_0_12,plain,
! [X9: vTy,X1: vTerm] :
( ( vreduce(vIfelse(vt1,vt2,vt3)) != vsomeTerm(X1) )
| ~ vptchecksimple(vIfelse(vt1,vt2,vt3),X9)
| ( vt1 != vFalse )
| vptchecksimple(X1,X9)
| ( vt1 = vTrue ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_13,plain,
! [X1: vTerm,X9: vTy] :
( ~ vptchecksimple(vIfelse(vt1,vt2,vt3),X9)
| ( vsomeTerm(X1) != vreduce(vIfelse(vt1,vt2,vt3)) )
| vptchecksimple(X1,X9)
| ( vt1 = vFalse ) ),
inference(csr,[status(thm)],[c_0_9,c_0_10]) ).
tff(c_0_14,negated_conjecture,
( ~ vptchecksimple(esk2_0,esk1_0)
& ( vreduce(vIfelse(vt1,vt2,vt3)) = vsomeTerm(esk2_0) )
& vptchecksimple(vIfelse(vt1,vt2,vt3),esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
tcf(c_0_15,plain,
! [X1: vTerm,X9: vTy] :
( ~ vptchecksimple(vIfelse(vt1,vt2,vt3),X9)
| ( vsomeTerm(X1) != vreduce(vIfelse(vt1,vt2,vt3)) )
| vptchecksimple(X1,X9) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_12,c_0_13]),c_0_10]) ).
tcf(c_0_16,negated_conjecture,
vptchecksimple(vIfelse(vt1,vt2,vt3),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
tcf(c_0_17,negated_conjecture,
! [X1: vTerm] :
( ( vsomeTerm(X1) != vreduce(vIfelse(vt1,vt2,vt3)) )
| vptchecksimple(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
tcf(c_0_18,negated_conjecture,
vreduce(vIfelse(vt1,vt2,vt3)) = vsomeTerm(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
tcf(c_0_19,negated_conjecture,
~ vptchecksimple(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM217_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/5.38 % Computer : n006.cluster.edu
% 0.12/5.38 % Model : x86_64 x86_64
% 0.12/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.38 % Memory : 8046.5625MB
% 0.12/5.38 % OS : Linux 6.8.0-71-generic
% 0.12/5.38 % CPULimit : 300
% 0.12/5.38 % WCLimit : 300
% 0.12/5.38 % DateTime : Mon Sep 21 14:20:03 UTC 2026
% 0.12/5.38 % CPUTime :
% 0.12/5.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.43 Running first-order theorem proving
% 0.15/5.43 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.15/5.51 % Version: 3.5.1
% 0.15/5.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/5.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/5.51 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.51 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.51 % Starting sh5l with 300s (1) cores
% 0.15/5.51 % new_bool_1 with pid 3064657 completed with status 0
% 0.15/5.51 % Result found by new_bool_1
% 0.15/5.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/5.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/5.51 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.51 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.51 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.51 % Search class: FGUSS-FFMM31-MFFFFFNN
% 0.15/5.51 % partial match(2): FGHSM-FFMM31-MFFFFFNN
% 0.15/5.51 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.51 % Starting SubtermCWHack with 28s (1) cores
% 0.15/5.51 % SubtermCWHack with pid 3064660 completed with status 0
% 0.15/5.51 % Result found by SubtermCWHack
% 0.15/5.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/5.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/5.51 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.51 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.51 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.51 % Search class: FGUSS-FFMM31-MFFFFFNN
% 0.15/5.51 % partial match(2): FGHSM-FFMM31-MFFFFFNN
% 0.15/5.51 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.51 % Starting SubtermCWHack with 28s (1) cores
% 0.15/5.51 % Preprocessing time : 0.002 s
% 0.15/5.51
% 0.15/5.51 % Proof found!
% 0.15/5.51 % SZS status Theorem
% 0.15/5.51 % SZS output start CNFRefutation
% See solution above
% 0.15/5.51 % Parsed axioms : 136
% 0.15/5.51 % Removed by relevancy pruning/SinE : 54
% 0.15/5.51 % Initial clauses : 102
% 0.15/5.51 % Removed in clause preprocessing : 0
% 0.15/5.51 % Initial clauses in saturation : 102
% 0.15/5.51 % Processed clauses : 1527
% 0.15/5.51 % ...of these trivial : 17
% 0.15/5.51 % ...subsumed : 743
% 0.15/5.51 % ...remaining for further processing : 767
% 0.15/5.51 % Other redundant clauses eliminated : 161
% 0.15/5.51 % Clauses deleted for lack of memory : 0
% 0.15/5.51 % Backward-subsumed : 3
% 0.15/5.51 % Backward-rewritten : 30
% 0.15/5.51 % Generated clauses : 3182
% 0.15/5.51 % ...of the previous two non-redundant : 2743
% 0.15/5.51 % ...aggressively subsumed : 0
% 0.15/5.51 % Contextual simplify-reflections : 12
% 0.15/5.51 % Paramodulations : 3007
% 0.15/5.51 % Factorizations : 0
% 0.15/5.51 % NegExts : 0
% 0.15/5.51 % Equation resolutions : 173
% 0.15/5.51 % Disequality decompositions : 0
% 0.15/5.51 % Total rewrite steps : 314
% 0.15/5.51 % ...of those cached : 219
% 0.15/5.51 % Propositional unsat checks : 0
% 0.15/5.51 % Propositional check models : 0
% 0.15/5.51 % Propositional check unsatisfiable : 0
% 0.15/5.51 % Propositional clauses : 0
% 0.15/5.51 % Propositional clauses after purity: 0
% 0.15/5.51 % Propositional unsat core size : 0
% 0.15/5.51 % Propositional preprocessing time : 0.000
% 0.15/5.51 % Propositional encoding time : 0.000
% 0.15/5.51 % Propositional solver time : 0.000
% 0.15/5.51 % Success case prop preproc time : 0.000
% 0.15/5.51 % Success case prop encoding time : 0.000
% 0.15/5.51 % Success case prop solver time : 0.000
% 0.15/5.51 % Current number of processed clauses : 732
% 0.15/5.51 % Positive orientable unit clauses : 448
% 0.15/5.51 % Positive unorientable unit clauses: 9
% 0.15/5.51 % Negative unit clauses : 100
% 0.15/5.51 % Non-unit-clauses : 175
% 0.15/5.51 % Current number of unprocessed clauses: 1273
% 0.15/5.51 % ...number of literals in the above : 2722
% 0.15/5.51 % Current number of archived formulas : 0
% 0.15/5.51 % Current number of archived clauses : 35
% 0.15/5.51 % Clause-clause subsumption calls (NU) : 8471
% 0.15/5.51 % Rec. Clause-clause subsumption calls : 3657
% 0.15/5.51 % Non-unit clause-clause subsumptions : 164
% 0.15/5.51 % Unit Clause-clause subsumption calls : 1562
% 0.15/5.51 % Rewrite failures with RHS unbound : 253
% 0.15/5.51 % BW rewrite match attempts : 13563
% 0.15/5.51 % BW rewrite match successes : 65
% 0.15/5.51 % Condensation attempts : 0
% 0.15/5.51 % Condensation successes : 0
% 0.15/5.51 % Termbank termtop insertions : 54776
% 0.15/5.51 % Search garbage collected termcells : 1924
% 0.15/5.51
% 0.15/5.51 % -------------------------------------------------
% 0.15/5.51 % User time : 0.052 s
% 0.15/5.51 % System time : 0.007 s
% 0.15/5.51 % Total time : 0.058 s
% 0.15/5.51 % Maximum resident set size: 4104 pages
% 0.15/5.51
% 0.15/5.51 % -------------------------------------------------
% 0.15/5.51 % User time : 0.058 s
% 0.15/5.51 % System time : 0.010 s
% 0.15/5.51 % Total time : 0.068 s
% 0.15/5.51 % Maximum resident set size: 5120 pages
% 0.15/5.51 % E exiting
%------------------------------------------------------------------------------