%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM277_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 : n007.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:51 PM UTC 2026
% Result : Theorem 0.22s 0.48s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 43 ( 20 unt; 0 typ; 0 def)
% Number of atoms : 82 ( 42 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 77 ( 38 ~; 15 |; 15 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 8 ( 7 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 56 ( 0 sgn 50 !; 6 ?; 56 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
vAnsMap: $tType ).
tff(decl_sort2,type,
vExp: $tType ).
tff(decl_sort3,type,
vAType: $tType ).
tff(decl_sort4,type,
vOptExp: $tType ).
tff(decl_sort5,type,
vUnOpT: $tType ).
tff(decl_sort6,type,
vOptAType: $tType ).
tff(decl_sort7,type,
vATMap: $tType ).
tff(decl_27,type,
vsomeExp: vExp > vOptExp ).
tff(decl_33,type,
vnoAType: vOptAType ).
tff(decl_35,type,
ve1: vExp ).
tff(decl_45,type,
vunop: ( vExp * vUnOpT ) > vExp ).
tff(decl_54,type,
vnoExp: vOptExp ).
tff(decl_75,type,
vsomeAType: vAType > vOptAType ).
tff(decl_82,type,
vecheck: ( vExp * vATMap ) > vOptAType ).
tff(decl_92,type,
vexpIsValue: vExp > $o ).
tff(decl_95,type,
vtypeAM: vAnsMap > vATMap ).
tff(decl_102,type,
visSomeAType: vOptAType > $o ).
tff(decl_119,type,
visSomeExp: vOptExp > $o ).
tff(decl_127,type,
vreduceExp: ( vAnsMap * vExp ) > vOptExp ).
tff(decl_149,type,
esk1_0: vAnsMap ).
tff(decl_150,type,
esk2_0: vUnOpT ).
tff(decl_151,type,
esk3_0: vAType ).
tff(decl_159,type,
esk11_1: vAnsMap > vExp ).
tff(decl_172,type,
esk24_1: vOptAType > vAType ).
tff('reduceExpProgress-unop-expIsValue-False-isSomeExp-False',conjecture,
! [X126: vAnsMap,X501: vUnOpT,X73: vAType] :
( ( ( vecheck(vtypeAM(X126),vunop(X501,ve1)) = vsomeAType(X73) )
& ~ vexpIsValue(vunop(X501,ve1))
& ~ vexpIsValue(ve1)
& ~ visSomeExp(vreduceExp(ve1,X126)) )
=> ? [X502: vExp] : ( vreduceExp(vunop(X501,ve1),X126) = vsomeExp(X502) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','reduceExpProgress-unop-expIsValue-False-isSomeExp-False') ).
tff('reduceExpProgress-unop-IH0',axiom,
! [X126: vAnsMap,X73: vAType] :
( ( ( vecheck(vtypeAM(X126),ve1) = vsomeAType(X73) )
& ~ vexpIsValue(ve1) )
=> ? [X500: vExp] : ( vreduceExp(ve1,X126) = vsomeExp(X500) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','reduceExpProgress-unop-IH0') ).
tff('dom-OptAType',axiom,
! [X46: vOptAType] :
( ? [X4: vAType] : ( X46 = vsomeAType(X4) )
| ( X46 = vnoAType ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','dom-OptAType') ).
tff('echeck-7',axiom,
! [X355: vATMap,X75: vExp,X397: vUnOpT] :
( ~ visSomeAType(vecheck(X355,X75))
=> ( vecheck(X355,vunop(X397,X75)) = vnoAType ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','echeck-7') ).
tff('isSomeExp-1',axiom,
! [X170: vExp] : visSomeExp(vsomeExp(X170)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','isSomeExp-1') ).
tff('isSomeAType-0',axiom,
~ visSomeAType(vnoAType),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','isSomeAType-0') ).
tff('isSomeExp-false-INV',axiom,
! [X171: vOptExp] :
( ~ visSomeExp(X171)
=> ( X171 = vnoExp ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','isSomeExp-false-INV') ).
tff('DIFF-noAType-someAType',axiom,
! [X4: vAType] : ( vnoAType != vsomeAType(X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','DIFF-noAType-someAType') ).
tff('isSomeExp-0',axiom,
~ visSomeExp(vnoExp),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','isSomeExp-0') ).
tff(c_0_9,negated_conjecture,
~ ! [X126: vAnsMap,X501: vUnOpT,X73: vAType] :
( ( ( vecheck(vtypeAM(X126),vunop(X501,ve1)) = vsomeAType(X73) )
& ~ vexpIsValue(vunop(X501,ve1))
& ~ vexpIsValue(ve1)
& ~ visSomeExp(vreduceExp(ve1,X126)) )
=> ? [X502: vExp] : ( vreduceExp(vunop(X501,ve1),X126) = vsomeExp(X502) ) ),
inference(assume_negation,[status(cth)],['reduceExpProgress-unop-expIsValue-False-isSomeExp-False']) ).
tff(c_0_10,plain,
! [X126: vAnsMap,X73: vAType] :
( ( ( vecheck(vtypeAM(X126),ve1) = vsomeAType(X73) )
& ~ vexpIsValue(ve1) )
=> ? [X500: vExp] : ( vreduceExp(ve1,X126) = vsomeExp(X500) ) ),
inference(fof_simplification,[status(thm)],['reduceExpProgress-unop-IH0']) ).
tff(c_0_11,negated_conjecture,
~ ! [X126: vAnsMap,X501: vUnOpT,X73: vAType] :
( ( ( vecheck(vtypeAM(X126),vunop(X501,ve1)) = vsomeAType(X73) )
& ~ vexpIsValue(vunop(X501,ve1))
& ~ vexpIsValue(ve1)
& ~ visSomeExp(vreduceExp(ve1,X126)) )
=> ? [X502: vExp] : ( vreduceExp(vunop(X501,ve1),X126) = vsomeExp(X502) ) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
tff(c_0_12,plain,
! [X548: vAnsMap,X549: vAType] :
( ( vreduceExp(ve1,X548) = vsomeExp(esk11_1(X548)) )
| ( vecheck(vtypeAM(X548),ve1) != vsomeAType(X549) )
| vexpIsValue(ve1) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])])]) ).
tff(c_0_13,negated_conjecture,
! [X506: vExp] :
( ( vreduceExp(vunop(esk2_0,ve1),esk1_0) != vsomeExp(X506) )
& ( vecheck(vtypeAM(esk1_0),vunop(esk2_0,ve1)) = vsomeAType(esk3_0) )
& ~ vexpIsValue(vunop(esk2_0,ve1))
& ~ vexpIsValue(ve1)
& ~ visSomeExp(vreduceExp(ve1,esk1_0)) ),
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_11])])])])]) ).
tcf(c_0_14,plain,
! [X55: vAnsMap,X4: vAType] :
( ( vecheck(vtypeAM(X55),ve1) != vsomeAType(X4) )
| ( vreduceExp(ve1,X55) = vsomeExp(esk11_1(X55)) )
| vexpIsValue(ve1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tcf(c_0_15,negated_conjecture,
~ vexpIsValue(ve1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tff(c_0_16,plain,
! [X640: vOptAType] :
( ( X640 = vsomeAType(esk24_1(X640)) )
| ( X640 = vnoAType ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['dom-OptAType'])]) ).
tff(c_0_17,plain,
! [X355: vATMap,X75: vExp,X397: vUnOpT] :
( ~ visSomeAType(vecheck(X355,X75))
=> ( vecheck(X355,vunop(X397,X75)) = vnoAType ) ),
inference(fof_simplification,[status(thm)],['echeck-7']) ).
tff(c_0_18,plain,
! [X604: vExp] : visSomeExp(vsomeExp(X604)),
inference(variable_rename,[status(thm)],['isSomeExp-1']) ).
tcf(c_0_19,plain,
! [X55: vAnsMap,X4: vAType] :
( ( vecheck(vtypeAM(X55),ve1) != vsomeAType(X4) )
| ( vsomeExp(esk11_1(X55)) = vreduceExp(ve1,X55) ) ),
inference(sr,[status(thm)],[c_0_14,c_0_15]) ).
tcf(c_0_20,plain,
! [X46: vOptAType] :
( ( X46 = vsomeAType(esk24_1(X46)) )
| ( X46 = vnoAType ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
tff(c_0_21,plain,
~ visSomeAType(vnoAType),
inference(fof_simplification,[status(thm)],['isSomeAType-0']) ).
tff(c_0_22,plain,
! [X171: vOptExp] :
( ~ visSomeExp(X171)
=> ( X171 = vnoExp ) ),
inference(fof_simplification,[status(thm)],['isSomeExp-false-INV']) ).
tff(c_0_23,plain,
! [X545: vATMap,X546: vExp,X547: vUnOpT] :
( ( vecheck(X545,vunop(X547,X546)) = vnoAType )
| visSomeAType(vecheck(X545,X546)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])]) ).
tcf(c_0_24,plain,
! [X5: vExp] : visSomeExp(vsomeExp(X5)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
tcf(c_0_25,plain,
! [X55: vAnsMap] :
( ( vecheck(vtypeAM(X55),ve1) = vnoAType )
| ( vsomeExp(esk11_1(X55)) = vreduceExp(ve1,X55) ) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20])]) ).
tff(c_0_26,plain,
~ visSomeAType(vnoAType),
inference(fof_nnf,[status(thm)],[c_0_21]) ).
tff(c_0_27,plain,
! [X607: vOptExp] :
( ( X607 = vnoExp )
| visSomeExp(X607) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])]) ).
tff(c_0_28,plain,
! [X4: vAType] : ( vnoAType != vsomeAType(X4) ),
inference(fof_simplification,[status(thm)],['DIFF-noAType-someAType']) ).
tff(c_0_29,plain,
~ visSomeExp(vnoExp),
inference(fof_simplification,[status(thm)],['isSomeExp-0']) ).
tcf(c_0_30,plain,
! [X23: vUnOpT,X15: vATMap,X5: vExp] :
( ( vecheck(X15,vunop(X23,X5)) = vnoAType )
| visSomeAType(vecheck(X15,X5)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
tcf(c_0_31,plain,
! [X55: vAnsMap] :
( visSomeExp(vreduceExp(ve1,X55))
| ( vecheck(vtypeAM(X55),ve1) = vnoAType ) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
tcf(c_0_32,plain,
~ visSomeAType(vnoAType),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
tcf(c_0_33,negated_conjecture,
~ visSomeExp(vreduceExp(ve1,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tcf(c_0_34,plain,
! [X53: vOptExp] :
( ( X53 = vnoExp )
| visSomeExp(X53) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
tff(c_0_35,plain,
! [X642: vAType] : ( vnoAType != vsomeAType(X642) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_28])]) ).
tff(c_0_36,plain,
~ visSomeExp(vnoExp),
inference(fof_nnf,[status(thm)],[c_0_29]) ).
tcf(c_0_37,negated_conjecture,
vecheck(vtypeAM(esk1_0),vunop(esk2_0,ve1)) = vsomeAType(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tcf(c_0_38,plain,
! [X23: vUnOpT,X55: vAnsMap] :
( visSomeExp(vreduceExp(ve1,X55))
| ( vecheck(vtypeAM(X55),vunop(X23,ve1)) = vnoAType ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
tcf(c_0_39,negated_conjecture,
vreduceExp(ve1,esk1_0) = vnoExp,
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
tcf(c_0_40,plain,
! [X4: vAType] : vnoAType != vsomeAType(X4),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
tcf(c_0_41,plain,
~ visSomeExp(vnoExp),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_40]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM277_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.10/0.37 % Computer : n007.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 14:20:21 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.22/0.48 % Version: 3.5.1
% 0.22/0.48 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.22/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.48 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.22/0.48 % Starting new_bool_3 with 600s (2) cores
% 0.22/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.48 % Starting sh5l with 300s (1) cores
% 0.22/0.48 % new_bool_1 with pid 1320904 completed with status 0
% 0.22/0.48 % Result found by new_bool_1
% 0.22/0.48 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.22/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.48 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.22/0.48 % Starting new_bool_3 with 600s (2) cores
% 0.22/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.22/0.48 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.48 % Search class: FGUSM-FSLM32-MFFFFFNN
% 0.22/0.48 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.48 % Starting SubtermCWHack with 31s (1) cores
% 0.22/0.48 % SubtermCWHack with pid 1320912 completed with status 0
% 0.22/0.48 % Result found by SubtermCWHack
% 0.22/0.48 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.22/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.48 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.22/0.48 % Starting new_bool_3 with 600s (2) cores
% 0.22/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.22/0.48 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.48 % Search class: FGUSM-FSLM32-MFFFFFNN
% 0.22/0.48 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.48 % Starting SubtermCWHack with 31s (1) cores
% 0.22/0.48 % Preprocessing time : 0.004 s
% 0.22/0.48
% 0.22/0.48 % Proof found!
% 0.22/0.48 % SZS status Theorem
% 0.22/0.48 % SZS output start CNFRefutation
% See solution above
% 0.22/0.49 % Parsed axioms : 506
% 0.22/0.49 % Removed by relevancy pruning/SinE : 300
% 0.22/0.49 % Initial clauses : 672
% 0.22/0.49 % Removed in clause preprocessing : 0
% 0.22/0.49 % Initial clauses in saturation : 672
% 0.22/0.49 % Processed clauses : 719
% 0.22/0.49 % ...of these trivial : 33
% 0.22/0.49 % ...subsumed : 278
% 0.22/0.49 % ...remaining for further processing : 408
% 0.22/0.49 % Other redundant clauses eliminated : 159
% 0.22/0.49 % Clauses deleted for lack of memory : 0
% 0.22/0.49 % Backward-subsumed : 1
% 0.22/0.49 % Backward-rewritten : 7
% 0.22/0.49 % Generated clauses : 1423
% 0.22/0.49 % ...of the previous two non-redundant : 799
% 0.22/0.49 % ...aggressively subsumed : 0
% 0.22/0.49 % Contextual simplify-reflections : 4
% 0.22/0.49 % Paramodulations : 1176
% 0.22/0.49 % Factorizations : 46
% 0.22/0.49 % NegExts : 0
% 0.22/0.49 % Equation resolutions : 201
% 0.22/0.49 % Disequality decompositions : 0
% 0.22/0.49 % Total rewrite steps : 690
% 0.22/0.49 % ...of those cached : 565
% 0.22/0.49 % Propositional unsat checks : 0
% 0.22/0.49 % Propositional check models : 0
% 0.22/0.49 % Propositional check unsatisfiable : 0
% 0.22/0.49 % Propositional clauses : 0
% 0.22/0.49 % Propositional clauses after purity: 0
% 0.22/0.49 % Propositional unsat core size : 0
% 0.22/0.49 % Propositional preprocessing time : 0.000
% 0.22/0.49 % Propositional encoding time : 0.000
% 0.22/0.49 % Propositional solver time : 0.000
% 0.22/0.49 % Success case prop preproc time : 0.000
% 0.22/0.49 % Success case prop encoding time : 0.000
% 0.22/0.49 % Success case prop solver time : 0.000
% 0.22/0.49 % Current number of processed clauses : 400
% 0.22/0.49 % Positive orientable unit clauses : 78
% 0.22/0.49 % Positive unorientable unit clauses: 2
% 0.22/0.49 % Negative unit clauses : 78
% 0.22/0.49 % Non-unit-clauses : 242
% 0.22/0.49 % Current number of unprocessed clauses: 733
% 0.22/0.49 % ...number of literals in the above : 2623
% 0.22/0.49 % Current number of archived formulas : 0
% 0.22/0.49 % Current number of archived clauses : 8
% 0.22/0.49 % Clause-clause subsumption calls (NU) : 14756
% 0.22/0.49 % Rec. Clause-clause subsumption calls : 12167
% 0.22/0.49 % Non-unit clause-clause subsumptions : 222
% 0.22/0.49 % Unit Clause-clause subsumption calls : 2306
% 0.22/0.49 % Rewrite failures with RHS unbound : 16
% 0.22/0.49 % BW rewrite match attempts : 9
% 0.22/0.49 % BW rewrite match successes : 8
% 0.22/0.49 % Condensation attempts : 0
% 0.22/0.49 % Condensation successes : 0
% 0.22/0.49 % Termbank termtop insertions : 41045
% 0.22/0.49 % Search garbage collected termcells : 7688
% 0.22/0.49
% 0.22/0.49 % -------------------------------------------------
% 0.22/0.49 % User time : 0.042 s
% 0.22/0.49 % System time : 0.005 s
% 0.22/0.49 % Total time : 0.047 s
% 0.22/0.49 % Maximum resident set size: 5812 pages
% 0.22/0.49
% 0.22/0.49 % -------------------------------------------------
% 0.22/0.49 % User time : 0.057 s
% 0.22/0.49 % System time : 0.010 s
% 0.22/0.49 % Total time : 0.067 s
% 0.22/0.49 % Maximum resident set size: 5632 pages
% 0.22/0.49 % E exiting
%------------------------------------------------------------------------------