%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM251_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 : n026.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 3.87s 1.12s
% Output : CNFRefutation 3.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 16 unt; 0 typ; 0 def)
% Number of atoms : 37 ( 36 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 25 ( 10 ~; 3 |; 10 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 8 ( 8 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 9 con; 0-3 aty)
% Number of variables : 36 ( 0 sgn 33 !; 3 ?; 36 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
vAval: $tType ).
tff(decl_sort2,type,
vExp: $tType ).
tff(decl_sort3,type,
vAType: $tType ).
tff(decl_sort4,type,
vOptExp: $tType ).
tff(decl_sort5,type,
vBinOpT: $tType ).
tff(decl_sort6,type,
vnat: $tType ).
tff(decl_sort7,type,
vOptAType: $tType ).
tff(decl_sort8,type,
vATMap: $tType ).
tff(decl_23,type,
vconstant: vAval > vExp ).
tff(decl_27,type,
vsomeExp: vExp > vOptExp ).
tff(decl_32,type,
vNum: vnat > vAval ).
tff(decl_53,type,
vnoExp: vOptExp ).
tff(decl_54,type,
vbinop: ( vExp * ( vBinOpT * vExp ) ) > vExp ).
tff(decl_64,type,
vaddop: vBinOpT ).
tff(decl_74,type,
vsomeAType: vAType > vOptAType ).
tff(decl_81,type,
vecheck: ( vExp * vATMap ) > vOptAType ).
tff(decl_87,type,
vevalBinOp: ( vAval * ( vAval * vBinOpT ) ) > vOptExp ).
tff(decl_90,type,
vplus: ( vnat * vnat ) > vnat ).
tff(decl_200,type,
esk38_1: vOptExp > vExp ).
tff(decl_398,type,
esk236_0: vnat ).
tff(decl_399,type,
esk237_0: vnat ).
tff(decl_400,type,
esk238_0: vBinOpT ).
tff(decl_401,type,
esk239_0: vAval ).
tff(decl_402,type,
esk240_0: vATMap ).
tff(decl_403,type,
esk241_0: vAval ).
tff(decl_404,type,
esk242_0: vAType ).
tff('DIFF-noExp-someExp',axiom,
! [X5: vExp] : ( vnoExp != vsomeExp(X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','DIFF-noExp-someExp') ).
tff('evalBinOpProgress-addop-Num-Num',conjecture,
! [X86: vnat,X87: vnat,X500: vBinOpT,X181: vAval,X355: vATMap,X180: vAval,X73: vAType] :
( ( ( vecheck(X355,vbinop(vconstant(X181),X500,vconstant(X180))) = vsomeAType(X73) )
& ( X180 = vNum(X87) )
& ( X181 = vNum(X86) )
& ( X500 = vaddop ) )
=> ? [X501: vExp] : ( vevalBinOp(X500,X181,X180) = vsomeExp(X501) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','evalBinOpProgress-addop-Num-Num') ).
tff('evalBinOp-0',axiom,
! [X86: vnat,X87: vnat] : ( vevalBinOp(vaddop,vNum(X86),vNum(X87)) = vsomeExp(vconstant(vNum(vplus(X86,X87)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','evalBinOp-0') ).
tff('dom-OptExp',axiom,
! [X53: vOptExp] :
( ? [X5: vExp] : ( X53 = vsomeExp(X5) )
| ( X53 = vnoExp ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','dom-OptExp') ).
tff(c_0_4,plain,
! [X5: vExp] : ( vnoExp != vsomeExp(X5) ),
inference(fof_simplification,[status(thm)],['DIFF-noExp-someExp']) ).
tff(c_0_5,negated_conjecture,
~ ! [X86: vnat,X87: vnat,X500: vBinOpT,X181: vAval,X355: vATMap,X180: vAval,X73: vAType] :
( ( ( vecheck(X355,vbinop(vconstant(X181),X500,vconstant(X180))) = vsomeAType(X73) )
& ( X180 = vNum(X87) )
& ( X181 = vNum(X86) )
& ( X500 = vaddop ) )
=> ? [X501: vExp] : ( vevalBinOp(X500,X181,X180) = vsomeExp(X501) ) ),
inference(assume_negation,[status(cth)],['evalBinOpProgress-addop-Num-Num']) ).
tff(c_0_6,plain,
! [X731: vExp] : ( vnoExp != vsomeExp(X731) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_4])]) ).
tff(c_0_7,plain,
! [X1047: vnat,X1048: vnat] : ( vevalBinOp(vaddop,vNum(X1047),vNum(X1048)) = vsomeExp(vconstant(vNum(vplus(X1047,X1048)))) ),
inference(variable_rename,[status(thm)],['evalBinOp-0']) ).
tff(c_0_8,negated_conjecture,
! [X1623: vExp] :
( ( vevalBinOp(esk238_0,esk239_0,esk241_0) != vsomeExp(X1623) )
& ( vecheck(esk240_0,vbinop(vconstant(esk239_0),esk238_0,vconstant(esk241_0))) = vsomeAType(esk242_0) )
& ( esk241_0 = vNum(esk237_0) )
& ( esk239_0 = vNum(esk236_0) )
& ( esk238_0 = vaddop ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
tcf(c_0_9,plain,
! [X5: vExp] : vnoExp != vsomeExp(X5),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_10,plain,
! [X29: vnat,X30: vnat] : vevalBinOp(vaddop,vNum(X29),vNum(X30)) = vsomeExp(vconstant(vNum(vplus(X29,X30)))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_11,negated_conjecture,
! [X5: vExp] : vevalBinOp(esk238_0,esk239_0,esk241_0) != vsomeExp(X5),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_12,negated_conjecture,
esk238_0 = vaddop,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tff(c_0_13,plain,
! [X727: vOptExp] :
( ( X727 = vsomeExp(esk38_1(X727)) )
| ( X727 = vnoExp ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['dom-OptExp'])]) ).
tcf(c_0_14,plain,
! [X29: vnat,X30: vnat] : vevalBinOp(vaddop,vNum(X29),vNum(X30)) != vnoExp,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
tcf(c_0_15,negated_conjecture,
esk241_0 = vNum(esk237_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_16,negated_conjecture,
! [X5: vExp] : vevalBinOp(vaddop,esk239_0,esk241_0) != vsomeExp(X5),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
tcf(c_0_17,plain,
! [X53: vOptExp] :
( ( X53 = vsomeExp(esk38_1(X53)) )
| ( X53 = vnoExp ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tcf(c_0_18,negated_conjecture,
! [X29: vnat] : vevalBinOp(vaddop,vNum(X29),esk241_0) != vnoExp,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
tcf(c_0_19,negated_conjecture,
esk239_0 = vNum(esk236_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_20,negated_conjecture,
vevalBinOp(vaddop,esk239_0,esk241_0) = vnoExp,
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17])]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : COM251_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.43 % Computer : n026.cluster.edu
% 0.16/0.43 % Model : x86_64 x86_64
% 0.16/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.43 % Memory : 8046.5625MB
% 0.16/0.43 % OS : Linux 6.8.0-71-generic
% 0.16/0.43 % CPULimit : 300
% 0.16/0.43 % WCLimit : 300
% 0.16/0.43 % DateTime : Mon Sep 21 14:23:52 UTC 2026
% 0.16/0.43 % CPUTime :
% 0.16/0.43 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.50 Running first-order theorem proving
% 0.16/0.50 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
% 3.87/1.12 % Version: 3.5.1
% 3.87/1.12 % Preprocessing class: FSLMSMSMSSSNFFN.
% 3.87/1.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.87/1.12 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 3.87/1.12 % Starting new_bool_3 with 600s (2) cores
% 3.87/1.12 % Starting new_bool_1 with 300s (1) cores
% 3.87/1.12 % Starting sh5l with 300s (1) cores
% 3.87/1.12 % G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with pid 2502693 completed with status 0
% 3.87/1.12 % Result found by G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S
% 3.87/1.12 % Preprocessing class: FSLMSMSMSSSNFFN.
% 3.87/1.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.87/1.12 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 3.87/1.12 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.87/1.12 % No SInE strategy applied
% 3.87/1.12 % Search class: FGUSM-SMLM32-DFFFFFNN
% 3.87/1.12 % Scheduled 7 strats onto 4 cores with 1200 seconds (1200 total)
% 3.87/1.12 % Starting SubtermCWHack with 109s (1) cores
% 3.87/1.12 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 121s (1) cores
% 3.87/1.12 % Starting sh3 with 217s (1) cores
% 3.87/1.12 % Starting ho_unfolding_3 with 217s (1) cores
% 3.87/1.12 % ho_unfolding_3 with pid 2502703 completed with status 0
% 3.87/1.12 % Result found by ho_unfolding_3
% 3.87/1.12 % Preprocessing class: FSLMSMSMSSSNFFN.
% 3.87/1.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.87/1.12 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 3.87/1.12 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.87/1.12 % No SInE strategy applied
% 3.87/1.12 % Search class: FGUSM-SMLM32-DFFFFFNN
% 3.87/1.12 % Scheduled 7 strats onto 4 cores with 1200 seconds (1200 total)
% 3.87/1.12 % Starting SubtermCWHack with 109s (1) cores
% 3.87/1.12 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 121s (1) cores
% 3.87/1.12 % Starting sh3 with 217s (1) cores
% 3.87/1.12 % Starting ho_unfolding_3 with 217s (1) cores
% 3.87/1.12 % Preprocessing time : 0.028 s
% 3.87/1.12 % Presaturation interreduction done
% 3.87/1.12
% 3.87/1.12 % Proof found!
% 3.87/1.12 % SZS status Theorem
% 3.87/1.12 % SZS output start CNFRefutation
% See solution above
% 3.87/1.12 % Parsed axioms : 504
% 3.87/1.12 % Removed by relevancy pruning/SinE : 0
% 3.87/1.12 % Initial clauses : 2526
% 3.87/1.12 % Removed in clause preprocessing : 150
% 3.87/1.12 % Initial clauses in saturation : 2376
% 3.87/1.12 % Processed clauses : 2740
% 3.87/1.12 % ...of these trivial : 8
% 3.87/1.12 % ...subsumed : 356
% 3.87/1.12 % ...remaining for further processing : 2376
% 3.87/1.12 % Other redundant clauses eliminated : 101
% 3.87/1.12 % Clauses deleted for lack of memory : 0
% 3.87/1.12 % Backward-subsumed : 2
% 3.87/1.12 % Backward-rewritten : 7
% 3.87/1.12 % Generated clauses : 440
% 3.87/1.12 % ...of the previous two non-redundant : 262
% 3.87/1.12 % ...aggressively subsumed : 0
% 3.87/1.12 % Contextual simplify-reflections : 30
% 3.87/1.12 % Paramodulations : 326
% 3.87/1.12 % Factorizations : 6
% 3.87/1.12 % NegExts : 0
% 3.87/1.12 % Equation resolutions : 124
% 3.87/1.12 % Disequality decompositions : 0
% 3.87/1.12 % Total rewrite steps : 440
% 3.87/1.12 % ...of those cached : 367
% 3.87/1.12 % Propositional unsat checks : 0
% 3.87/1.12 % Propositional check models : 0
% 3.87/1.12 % Propositional check unsatisfiable : 0
% 3.87/1.12 % Propositional clauses : 0
% 3.87/1.12 % Propositional clauses after purity: 0
% 3.87/1.12 % Propositional unsat core size : 0
% 3.87/1.12 % Propositional preprocessing time : 0.000
% 3.87/1.12 % Propositional encoding time : 0.000
% 3.87/1.12 % Propositional solver time : 0.000
% 3.87/1.12 % Success case prop preproc time : 0.000
% 3.87/1.12 % Success case prop encoding time : 0.000
% 3.87/1.12 % Success case prop solver time : 0.000
% 3.87/1.12 % Current number of processed clauses : 254
% 3.87/1.12 % Positive orientable unit clauses : 72
% 3.87/1.12 % Positive unorientable unit clauses: 6
% 3.87/1.12 % Negative unit clauses : 107
% 3.87/1.12 % Non-unit-clauses : 69
% 3.87/1.12 % Current number of unprocessed clauses: 1982
% 3.87/1.12 % ...number of literals in the above : 7376
% 3.87/1.12 % Current number of archived formulas : 0
% 3.87/1.12 % Current number of archived clauses : 2103
% 3.87/1.12 % Clause-clause subsumption calls (NU) : 687485
% 3.87/1.12 % Rec. Clause-clause subsumption calls : 197840
% 3.87/1.12 % Non-unit clause-clause subsumptions : 326
% 3.87/1.12 % Unit Clause-clause subsumption calls : 7411
% 3.87/1.12 % Rewrite failures with RHS unbound : 0
% 3.87/1.12 % BW rewrite match attempts : 141
% 3.87/1.12 % BW rewrite match successes : 26
% 3.87/1.12 % Condensation attempts : 2740
% 3.87/1.12 % Condensation successes : 0
% 3.87/1.12 % Termbank termtop insertions : 126779
% 3.87/1.12 % Search garbage collected termcells : 16352
% 3.87/1.12
% 3.87/1.12 % -------------------------------------------------
% 3.87/1.12 % User time : 0.521 s
% 3.87/1.12 % System time : 0.026 s
% 3.87/1.12 % Total time : 0.547 s
% 3.87/1.12 % Maximum resident set size: 8884 pages
% 3.87/1.12
% 3.87/1.12 % -------------------------------------------------
% 3.87/1.12 % User time : 1.889 s
% 3.87/1.12 % System time : 0.094 s
% 3.87/1.12 % Total time : 1.983 s
% 3.87/1.12 % Maximum resident set size: 5376 pages
% 3.87/1.12 % E exiting
%------------------------------------------------------------------------------