%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM233_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 : n018.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 1.33s 0.64s
% Output : CNFRefutation 1.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 43 ( 14 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 50 ( 24 ~; 6 |; 15 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn 17 !; 0 ?; 17 :)
% 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_37,type,
visValue: vTerm > $o ).
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_43,type,
vgetTerm: vOptTerm > vTerm ).
tff(decl_104,type,
esk53_0: vTy ).
tff('DIFF-noTerm-someTerm',axiom,
! [X2: vTerm] : ( vnoTerm != vsomeTerm(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','DIFF-noTerm-someTerm') ).
tff('reduce-21',axiom,
! [X14: vTerm,X16: vTerm] :
( ( visSomeTerm(vreduce(X14))
& ~ visNV(X14) )
=> ( vreduce(vPlus(X14,X16)) = vsomeTerm(vPlus(vgetTerm(vreduce(X14)),X16)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','reduce-21') ).
tff('Progress-Plus-isNV-False-isSomeTerm-True',conjecture,
! [X98: vTy] :
( ( ~ visValue(vPlus(vt1,vt2))
& vptchecksimple(vPlus(vt1,vt2),X98)
& ~ visNV(vt1)
& visSomeTerm(vreduce(vt1)) )
=> ( vreduce(vPlus(vt1,vt2)) != vnoTerm ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','Progress-Plus-isNV-False-isSomeTerm-True') ).
tff(c_0_3,plain,
! [X2: vTerm] : ( vnoTerm != vsomeTerm(X2) ),
inference(fof_simplification,[status(thm)],['DIFF-noTerm-someTerm']) ).
tff(c_0_4,plain,
! [X14: vTerm,X16: vTerm] :
( ( visSomeTerm(vreduce(X14))
& ~ visNV(X14) )
=> ( vreduce(vPlus(X14,X16)) = vsomeTerm(vPlus(vgetTerm(vreduce(X14)),X16)) ) ),
inference(fof_simplification,[status(thm)],['reduce-21']) ).
tff(c_0_5,negated_conjecture,
~ ! [X98: vTy] :
( ( ~ visValue(vPlus(vt1,vt2))
& vptchecksimple(vPlus(vt1,vt2),X98)
& ~ visNV(vt1)
& visSomeTerm(vreduce(vt1)) )
=> ( vreduce(vPlus(vt1,vt2)) != vnoTerm ) ),
inference(assume_negation,[status(cth)],['Progress-Plus-isNV-False-isSomeTerm-True']) ).
tff(c_0_6,plain,
! [X184: vTerm] : ( vnoTerm != vsomeTerm(X184) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_3])]) ).
tff(c_0_7,plain,
! [X259: vTerm,X260: vTerm] :
( ( vreduce(vPlus(X259,X260)) = vsomeTerm(vPlus(vgetTerm(vreduce(X259)),X260)) )
| ~ visSomeTerm(vreduce(X259))
| visNV(X259) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
tff(c_0_8,negated_conjecture,
~ ! [X98: vTy] :
( ( ~ visValue(vPlus(vt1,vt2))
& vptchecksimple(vPlus(vt1,vt2),X98)
& ~ visNV(vt1)
& visSomeTerm(vreduce(vt1)) )
=> ( vreduce(vPlus(vt1,vt2)) != vnoTerm ) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
tcf(c_0_9,plain,
! [X1: vTerm] : vnoTerm != vsomeTerm(X1),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_10,plain,
! [X2: vTerm,X1: vTerm] :
( ~ visSomeTerm(vreduce(X1))
| ( vreduce(vPlus(X1,X2)) = vsomeTerm(vPlus(vgetTerm(vreduce(X1)),X2)) )
| visNV(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tff(c_0_11,negated_conjecture,
( ( vreduce(vPlus(vt1,vt2)) = vnoTerm )
& ~ visValue(vPlus(vt1,vt2))
& vptchecksimple(vPlus(vt1,vt2),esk53_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_8])])])]) ).
tcf(c_0_12,plain,
! [X2: vTerm,X1: vTerm] :
( ~ visSomeTerm(vreduce(X1))
| ( vnoTerm != vreduce(vPlus(X1,X2)) )
| visNV(X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
tcf(c_0_13,negated_conjecture,
vreduce(vPlus(vt1,vt2)) = vnoTerm,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tcf(c_0_14,negated_conjecture,
visSomeTerm(vreduce(vt1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tcf(c_0_15,negated_conjecture,
~ visNV(vt1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COM233_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.10/0.36 % Computer : n018.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 14:22:44 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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
% 1.33/0.64 % Version: 3.5.1
% 1.33/0.64 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.33/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.33/0.64 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.33/0.64 % Starting new_bool_3 with 300s (1) cores
% 1.33/0.64 % Starting new_bool_1 with 300s (1) cores
% 1.33/0.64 % Starting sh5l with 300s (1) cores
% 1.33/0.64 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2124444 completed with status 0
% 1.33/0.64 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.33/0.64 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.33/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.33/0.64 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.33/0.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.33/0.64 % No SInE strategy applied
% 1.33/0.64 % Search class: FGUSM-FSLM31-MFFFFFNN
% 1.33/0.64 % partial match(1): FGHSM-FSLM31-MFFFFFNN
% 1.33/0.64 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 1.33/0.64 % Starting SubtermCWHack with 136s (1) cores
% 1.33/0.64 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.33/0.64 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 1.33/0.64 % Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 1.33/0.64 % Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.33/0.64 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2124461 completed with status 0
% 1.33/0.64 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.33/0.64 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.33/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.33/0.64 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.33/0.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.33/0.64 % No SInE strategy applied
% 1.33/0.64 % Search class: FGUSM-FSLM31-MFFFFFNN
% 1.33/0.64 % partial match(1): FGHSM-FSLM31-MFFFFFNN
% 1.33/0.64 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 1.33/0.64 % Starting SubtermCWHack with 136s (1) cores
% 1.33/0.64 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.33/0.64 % Preprocessing time : 0.012 s
% 1.33/0.64 % Presaturation interreduction done
% 1.33/0.64
% 1.33/0.64 % Proof found!
% 1.33/0.64 % SZS status Theorem
% 1.33/0.64 % SZS output start CNFRefutation
% See solution above
% 1.33/0.64 % Parsed axioms : 132
% 1.33/0.64 % Removed by relevancy pruning/SinE : 0
% 1.33/0.64 % Initial clauses : 798
% 1.33/0.64 % Removed in clause preprocessing : 24
% 1.33/0.64 % Initial clauses in saturation : 774
% 1.33/0.64 % Processed clauses : 1267
% 1.33/0.64 % ...of these trivial : 2
% 1.33/0.64 % ...subsumed : 100
% 1.33/0.64 % ...remaining for further processing : 1165
% 1.33/0.64 % Other redundant clauses eliminated : 567
% 1.33/0.64 % Clauses deleted for lack of memory : 0
% 1.33/0.64 % Backward-subsumed : 23
% 1.33/0.64 % Backward-rewritten : 6
% 1.33/0.64 % Generated clauses : 1512
% 1.33/0.64 % ...of the previous two non-redundant : 1044
% 1.33/0.64 % ...aggressively subsumed : 0
% 1.33/0.64 % Contextual simplify-reflections : 5
% 1.33/0.64 % Paramodulations : 1045
% 1.33/0.64 % Factorizations : 2
% 1.33/0.64 % NegExts : 0
% 1.33/0.64 % Equation resolutions : 577
% 1.33/0.64 % Disequality decompositions : 0
% 1.33/0.64 % Total rewrite steps : 108
% 1.33/0.64 % ...of those cached : 77
% 1.33/0.64 % Propositional unsat checks : 0
% 1.33/0.64 % Propositional check models : 0
% 1.33/0.64 % Propositional check unsatisfiable : 0
% 1.33/0.64 % Propositional clauses : 0
% 1.33/0.64 % Propositional clauses after purity: 0
% 1.33/0.64 % Propositional unsat core size : 0
% 1.33/0.64 % Propositional preprocessing time : 0.000
% 1.33/0.64 % Propositional encoding time : 0.000
% 1.33/0.64 % Propositional solver time : 0.000
% 1.33/0.64 % Success case prop preproc time : 0.000
% 1.33/0.64 % Success case prop encoding time : 0.000
% 1.33/0.64 % Success case prop solver time : 0.000
% 1.33/0.64 % Current number of processed clauses : 322
% 1.33/0.64 % Positive orientable unit clauses : 33
% 1.33/0.64 % Positive unorientable unit clauses: 0
% 1.33/0.64 % Negative unit clauses : 47
% 1.33/0.64 % Non-unit-clauses : 242
% 1.33/0.64 % Current number of unprocessed clauses: 1278
% 1.33/0.64 % ...number of literals in the above : 5388
% 1.33/0.64 % Current number of archived formulas : 0
% 1.33/0.64 % Current number of archived clauses : 763
% 1.33/0.64 % Clause-clause subsumption calls (NU) : 129466
% 1.33/0.64 % Rec. Clause-clause subsumption calls : 12803
% 1.33/0.64 % Non-unit clause-clause subsumptions : 75
% 1.33/0.64 % Unit Clause-clause subsumption calls : 1772
% 1.33/0.64 % Rewrite failures with RHS unbound : 0
% 1.33/0.64 % BW rewrite match attempts : 5
% 1.33/0.64 % BW rewrite match successes : 4
% 1.33/0.64 % Condensation attempts : 0
% 1.33/0.64 % Condensation successes : 0
% 1.33/0.64 % Termbank termtop insertions : 63511
% 1.33/0.64 % Search garbage collected termcells : 5976
% 1.33/0.64
% 1.33/0.64 % -------------------------------------------------
% 1.33/0.64 % User time : 0.183 s
% 1.33/0.64 % System time : 0.023 s
% 1.33/0.64 % Total time : 0.206 s
% 1.33/0.64 % Maximum resident set size: 5124 pages
% 1.33/0.64
% 1.33/0.64 % -------------------------------------------------
% 1.33/0.64 % User time : 0.841 s
% 1.33/0.64 % System time : 0.054 s
% 1.33/0.64 % Total time : 0.895 s
% 1.33/0.64 % Maximum resident set size: 5120 pages
% 1.33/0.64 % E exiting
%------------------------------------------------------------------------------