%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM222_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 : n004.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:45 PM UTC 2026
% Result : Theorem 0.26s 0.46s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 53 ( 14 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 51 ( 23 ~; 6 |; 15 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 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 : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn 21 !; 0 ?; 21 :)
% 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_31,type,
vnoTerm: vOptTerm ).
tff(decl_32,type,
vPlus: ( vTerm * vTerm ) > vTerm ).
tff(decl_33,type,
vt2: vTerm ).
tff(decl_36,type,
vt1: vTerm ).
tff(decl_38,type,
visNV: vTerm > $o ).
tff(decl_39,type,
vreduce: vTerm > vOptTerm ).
tff(decl_41,type,
visSomeTerm: vOptTerm > $o ).
tff(decl_42,type,
vptchecksimple: ( vTy * vTerm ) > $o ).
tff(decl_44,type,
esk1_0: vTy ).
tff(decl_45,type,
esk2_0: vTerm ).
tff('Preservation-Plus-isNV-False-isSomeTerm-False',conjecture,
! [X98: vTy,X99: vTerm] :
( ( ( vreduce(vPlus(vt1,vt2)) = vsomeTerm(X99) )
& vptchecksimple(vPlus(vt1,vt2),X98)
& ~ visNV(vt1)
& ~ visSomeTerm(vreduce(vt1)) )
=> vptchecksimple(X99,X98) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','Preservation-Plus-isNV-False-isSomeTerm-False') ).
tff('isSomeTerm-false-INV',axiom,
! [X15: vOptTerm] :
( ~ visSomeTerm(X15)
=> ( X15 = vnoTerm ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','isSomeTerm-false-INV') ).
tff('isSomeTerm-1',axiom,
! [X12: vTerm] : visSomeTerm(vsomeTerm(X12)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','isSomeTerm-1') ).
tff('reduce-22',axiom,
! [X14: vTerm,X16: vTerm] :
( ( ~ visSomeTerm(vreduce(X14))
& ~ visNV(X14) )
=> ( vreduce(vPlus(X14,X16)) = vnoTerm ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','reduce-22') ).
tff('isSomeTerm-0',axiom,
~ visSomeTerm(vnoTerm),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','isSomeTerm-0') ).
tff(c_0_5,negated_conjecture,
~ ! [X98: vTy,X99: vTerm] :
( ( ( vreduce(vPlus(vt1,vt2)) = vsomeTerm(X99) )
& vptchecksimple(vPlus(vt1,vt2),X98)
& ~ visNV(vt1)
& ~ visSomeTerm(vreduce(vt1)) )
=> vptchecksimple(X99,X98) ),
inference(assume_negation,[status(cth)],['Preservation-Plus-isNV-False-isSomeTerm-False']) ).
tff(c_0_6,negated_conjecture,
~ ! [X98: vTy,X99: vTerm] :
( ( ( vreduce(vPlus(vt1,vt2)) = vsomeTerm(X99) )
& vptchecksimple(vPlus(vt1,vt2),X98)
& ~ visNV(vt1)
& ~ visSomeTerm(vreduce(vt1)) )
=> vptchecksimple(X99,X98) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
tff(c_0_7,plain,
! [X15: vOptTerm] :
( ~ visSomeTerm(X15)
=> ( X15 = vnoTerm ) ),
inference(fof_simplification,[status(thm)],['isSomeTerm-false-INV']) ).
tff(c_0_8,plain,
! [X131: vTerm] : visSomeTerm(vsomeTerm(X131)),
inference(variable_rename,[status(thm)],['isSomeTerm-1']) ).
tff(c_0_9,negated_conjecture,
( ~ vptchecksimple(esk2_0,esk1_0)
& ( vreduce(vPlus(vt1,vt2)) = vsomeTerm(esk2_0) )
& vptchecksimple(vPlus(vt1,vt2),esk1_0)
& ~ visNV(vt1)
& ~ visSomeTerm(vreduce(vt1)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
tff(c_0_10,plain,
! [X14: vTerm,X16: vTerm] :
( ( ~ visSomeTerm(vreduce(X14))
& ~ visNV(X14) )
=> ( vreduce(vPlus(X14,X16)) = vnoTerm ) ),
inference(fof_simplification,[status(thm)],['reduce-22']) ).
tff(c_0_11,plain,
! [X269: vOptTerm] :
( ( X269 = vnoTerm )
| visSomeTerm(X269) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).
tff(c_0_12,plain,
~ visSomeTerm(vnoTerm),
inference(fof_simplification,[status(thm)],['isSomeTerm-0']) ).
tcf(c_0_13,plain,
! [X1: vTerm] : visSomeTerm(vsomeTerm(X1)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_14,negated_conjecture,
vreduce(vPlus(vt1,vt2)) = vsomeTerm(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tff(c_0_15,plain,
! [X175: vTerm,X176: vTerm] :
( ( vreduce(vPlus(X175,X176)) = vnoTerm )
| visSomeTerm(vreduce(X175))
| visNV(X175) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])]) ).
tcf(c_0_16,negated_conjecture,
~ visSomeTerm(vreduce(vt1)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_17,plain,
! [X8: vOptTerm] :
( ( X8 = vnoTerm )
| visSomeTerm(X8) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tff(c_0_18,plain,
~ visSomeTerm(vnoTerm),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
tcf(c_0_19,negated_conjecture,
visSomeTerm(vreduce(vPlus(vt1,vt2))),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
tcf(c_0_20,plain,
! [X1: vTerm,X2: vTerm] :
( ( vreduce(vPlus(X1,X2)) = vnoTerm )
| visSomeTerm(vreduce(X1))
| visNV(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
tcf(c_0_21,negated_conjecture,
vreduce(vt1) = vnoTerm,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
tcf(c_0_22,plain,
~ visSomeTerm(vnoTerm),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
tcf(c_0_23,negated_conjecture,
~ visNV(vt1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM222_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.11/0.38 % Computer : n004.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 14:20:21 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.26/0.46 % Version: 3.5.1
% 0.26/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.26/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.26/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.46 % Starting sh5l with 300s (1) cores
% 0.26/0.46 % new_bool_3 with pid 3360889 completed with status 0
% 0.26/0.46 % Result found by new_bool_3
% 0.26/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.26/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.26/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.46 % Search class: FGUSS-FFMM31-MFFFFFNN
% 0.26/0.46 % partial match(2): FGHSM-FFMM31-MFFFFFNN
% 0.26/0.46 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.46 % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.46 % SubtermCWHack with pid 3360892 completed with status 0
% 0.26/0.46 % Result found by SubtermCWHack
% 0.26/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.26/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.26/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.46 % Search class: FGUSS-FFMM31-MFFFFFNN
% 0.26/0.46 % partial match(2): FGHSM-FFMM31-MFFFFFNN
% 0.26/0.46 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.46 % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.46 % Preprocessing time : 0.002 s
% 0.26/0.46
% 0.26/0.46 % Proof found!
% 0.26/0.46 % SZS status Theorem
% 0.26/0.46 % SZS output start CNFRefutation
% See solution above
% 0.26/0.46 % Parsed axioms : 132
% 0.26/0.46 % Removed by relevancy pruning/SinE : 53
% 0.26/0.46 % Initial clauses : 101
% 0.26/0.46 % Removed in clause preprocessing : 0
% 0.26/0.46 % Initial clauses in saturation : 101
% 0.26/0.46 % Processed clauses : 220
% 0.26/0.46 % ...of these trivial : 2
% 0.26/0.46 % ...subsumed : 58
% 0.26/0.46 % ...remaining for further processing : 160
% 0.26/0.46 % Other redundant clauses eliminated : 73
% 0.26/0.46 % Clauses deleted for lack of memory : 0
% 0.26/0.46 % Backward-subsumed : 0
% 0.26/0.46 % Backward-rewritten : 4
% 0.26/0.46 % Generated clauses : 432
% 0.26/0.46 % ...of the previous two non-redundant : 254
% 0.26/0.46 % ...aggressively subsumed : 0
% 0.26/0.46 % Contextual simplify-reflections : 0
% 0.26/0.46 % Paramodulations : 354
% 0.26/0.46 % Factorizations : 0
% 0.26/0.46 % NegExts : 0
% 0.26/0.46 % Equation resolutions : 78
% 0.26/0.46 % Disequality decompositions : 0
% 0.26/0.46 % Total rewrite steps : 117
% 0.26/0.46 % ...of those cached : 74
% 0.26/0.46 % Propositional unsat checks : 0
% 0.26/0.46 % Propositional check models : 0
% 0.26/0.46 % Propositional check unsatisfiable : 0
% 0.26/0.46 % Propositional clauses : 0
% 0.26/0.46 % Propositional clauses after purity: 0
% 0.26/0.46 % Propositional unsat core size : 0
% 0.26/0.46 % Propositional preprocessing time : 0.000
% 0.26/0.46 % Propositional encoding time : 0.000
% 0.26/0.46 % Propositional solver time : 0.000
% 0.26/0.46 % Success case prop preproc time : 0.000
% 0.26/0.46 % Success case prop encoding time : 0.000
% 0.26/0.46 % Success case prop solver time : 0.000
% 0.26/0.46 % Current number of processed clauses : 156
% 0.26/0.46 % Positive orientable unit clauses : 38
% 0.26/0.46 % Positive unorientable unit clauses: 6
% 0.26/0.46 % Negative unit clauses : 48
% 0.26/0.46 % Non-unit-clauses : 64
% 0.26/0.46 % Current number of unprocessed clauses: 134
% 0.26/0.46 % ...number of literals in the above : 430
% 0.26/0.46 % Current number of archived formulas : 0
% 0.26/0.46 % Current number of archived clauses : 4
% 0.26/0.46 % Clause-clause subsumption calls (NU) : 285
% 0.26/0.46 % Rec. Clause-clause subsumption calls : 261
% 0.26/0.46 % Non-unit clause-clause subsumptions : 17
% 0.26/0.46 % Unit Clause-clause subsumption calls : 307
% 0.26/0.46 % Rewrite failures with RHS unbound : 38
% 0.26/0.46 % BW rewrite match attempts : 33
% 0.26/0.46 % BW rewrite match successes : 21
% 0.26/0.46 % Condensation attempts : 0
% 0.26/0.46 % Condensation successes : 0
% 0.26/0.46 % Termbank termtop insertions : 10249
% 0.26/0.46 % Search garbage collected termcells : 1868
% 0.26/0.46
% 0.26/0.46 % -------------------------------------------------
% 0.26/0.46 % User time : 0.012 s
% 0.26/0.46 % System time : 0.005 s
% 0.26/0.46 % Total time : 0.017 s
% 0.26/0.46 % Maximum resident set size: 4100 pages
% 0.26/0.46
% 0.26/0.46 % -------------------------------------------------
% 0.26/0.46 % User time : 0.015 s
% 0.26/0.46 % System time : 0.011 s
% 0.26/0.46 % Total time : 0.026 s
% 0.26/0.46 % Maximum resident set size: 5120 pages
% 0.26/0.46 % E exiting
%------------------------------------------------------------------------------