%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM271_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 : n001.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:50 PM UTC 2026
% Result : Theorem 0.16s 0.97s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 86 ( 50 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 101 ( 37 ~; 28 |; 29 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 7 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of types : 8 ( 7 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-3 aty)
% Number of variables : 55 ( 0 sgn 55 !; 0 ?; 55 :)
% 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,
vBinOpT: $tType ).
tff(decl_sort6,type,
vOptAType: $tType ).
tff(decl_sort7,type,
vATMap: $tType ).
tff(decl_27,type,
vsomeExp: vExp > vOptExp ).
tff(decl_35,type,
ve1: vExp ).
tff(decl_55,type,
vbinop: ( vExp * ( vBinOpT * vExp ) ) > vExp ).
tff(decl_75,type,
vsomeAType: vAType > vOptAType ).
tff(decl_76,type,
ve2: vExp ).
tff(decl_83,type,
vecheck: ( vExp * vATMap ) > vOptAType ).
tff(decl_93,type,
vexpIsValue: vExp > $o ).
tff(decl_96,type,
vtypeAM: vAnsMap > vATMap ).
tff(decl_120,type,
visSomeExp: vOptExp > $o ).
tff(decl_128,type,
vreduceExp: ( vAnsMap * vExp ) > vOptExp ).
tff(decl_150,type,
esk1_0: vAnsMap ).
tff(decl_151,type,
esk2_0: vBinOpT ).
tff(decl_152,type,
esk3_0: vAType ).
tff(decl_153,type,
esk4_0: vExp ).
tff('reduceExpPreservation-binop-expIsValue-True-expIsValue-False',conjecture,
! [X126: vAnsMap,X501: vBinOpT,X73: vAType,X500: vExp] :
( ( ( vreduceExp(vbinop(ve1,X501,ve2),X126) = vsomeExp(X500) )
& ( vecheck(vtypeAM(X126),vbinop(ve1,X501,ve2)) = vsomeAType(X73) )
& vexpIsValue(ve1)
& ~ vexpIsValue(ve2) )
=> ( vecheck(vtypeAM(X126),X500) = vsomeAType(X73) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','reduceExpPreservation-binop-expIsValue-True-expIsValue-False') ).
tff('reduceExpPreservation-binop-expIsValue-True-expIsValue-False-isSomeExp-True',axiom,
! [X126: vAnsMap,X501: vBinOpT,X73: vAType,X500: vExp] :
( ( ( vreduceExp(vbinop(ve1,X501,ve2),X126) = vsomeExp(X500) )
& ( vecheck(vtypeAM(X126),vbinop(ve1,X501,ve2)) = vsomeAType(X73) )
& vexpIsValue(ve1)
& ~ vexpIsValue(ve2)
& visSomeExp(vreduceExp(ve2,X126)) )
=> ( vecheck(vtypeAM(X126),X500) = vsomeAType(X73) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','reduceExpPreservation-binop-expIsValue-True-expIsValue-False-isSomeExp-True') ).
tff('reduceExpPreservation-binop-expIsValue-True-expIsValue-False-isSomeExp-False',axiom,
! [X126: vAnsMap,X501: vBinOpT,X73: vAType,X500: vExp] :
( ( ( vreduceExp(vbinop(ve1,X501,ve2),X126) = vsomeExp(X500) )
& ( vecheck(vtypeAM(X126),vbinop(ve1,X501,ve2)) = vsomeAType(X73) )
& vexpIsValue(ve1)
& ~ vexpIsValue(ve2)
& ~ visSomeExp(vreduceExp(ve2,X126)) )
=> ( vecheck(vtypeAM(X126),X500) = vsomeAType(X73) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','reduceExpPreservation-binop-expIsValue-True-expIsValue-False-isSomeExp-False') ).
tff(c_0_3,negated_conjecture,
~ ! [X126: vAnsMap,X501: vBinOpT,X73: vAType,X500: vExp] :
( ( ( vreduceExp(vbinop(ve1,X501,ve2),X126) = vsomeExp(X500) )
& ( vecheck(vtypeAM(X126),vbinop(ve1,X501,ve2)) = vsomeAType(X73) )
& vexpIsValue(ve1)
& ~ vexpIsValue(ve2) )
=> ( vecheck(vtypeAM(X126),X500) = vsomeAType(X73) ) ),
inference(assume_negation,[status(cth)],['reduceExpPreservation-binop-expIsValue-True-expIsValue-False']) ).
tff(c_0_4,plain,
! [X126: vAnsMap,X501: vBinOpT,X73: vAType,X500: vExp] :
( ( ( vreduceExp(vbinop(ve1,X501,ve2),X126) = vsomeExp(X500) )
& ( vecheck(vtypeAM(X126),vbinop(ve1,X501,ve2)) = vsomeAType(X73) )
& vexpIsValue(ve1)
& ~ vexpIsValue(ve2)
& visSomeExp(vreduceExp(ve2,X126)) )
=> ( vecheck(vtypeAM(X126),X500) = vsomeAType(X73) ) ),
inference(fof_simplification,[status(thm)],['reduceExpPreservation-binop-expIsValue-True-expIsValue-False-isSomeExp-True']) ).
tff(c_0_5,negated_conjecture,
~ ! [X126: vAnsMap,X501: vBinOpT,X73: vAType,X500: vExp] :
( ( ( vreduceExp(vbinop(ve1,X501,ve2),X126) = vsomeExp(X500) )
& ( vecheck(vtypeAM(X126),vbinop(ve1,X501,ve2)) = vsomeAType(X73) )
& vexpIsValue(ve1)
& ~ vexpIsValue(ve2) )
=> ( vecheck(vtypeAM(X126),X500) = vsomeAType(X73) ) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
tff(c_0_6,plain,
! [X126: vAnsMap,X501: vBinOpT,X73: vAType,X500: vExp] :
( ( ( vreduceExp(vbinop(ve1,X501,ve2),X126) = vsomeExp(X500) )
& ( vecheck(vtypeAM(X126),vbinop(ve1,X501,ve2)) = vsomeAType(X73) )
& vexpIsValue(ve1)
& ~ vexpIsValue(ve2)
& ~ visSomeExp(vreduceExp(ve2,X126)) )
=> ( vecheck(vtypeAM(X126),X500) = vsomeAType(X73) ) ),
inference(fof_simplification,[status(thm)],['reduceExpPreservation-binop-expIsValue-True-expIsValue-False-isSomeExp-False']) ).
tff(c_0_7,plain,
! [X580: vAnsMap,X581: vBinOpT,X582: vAType,X583: vExp] :
( ( vecheck(vtypeAM(X580),X583) = vsomeAType(X582) )
| ( vreduceExp(vbinop(ve1,X581,ve2),X580) != vsomeExp(X583) )
| ( vecheck(vtypeAM(X580),vbinop(ve1,X581,ve2)) != vsomeAType(X582) )
| ~ vexpIsValue(ve1)
| vexpIsValue(ve2)
| ~ visSomeExp(vreduceExp(ve2,X580)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
tff(c_0_8,negated_conjecture,
( ( vecheck(vtypeAM(esk1_0),esk4_0) != vsomeAType(esk3_0) )
& ( vreduceExp(vbinop(ve1,esk2_0,ve2),esk1_0) = vsomeExp(esk4_0) )
& ( vecheck(vtypeAM(esk1_0),vbinop(ve1,esk2_0,ve2)) = vsomeAType(esk3_0) )
& vexpIsValue(ve1)
& ~ vexpIsValue(ve2) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
tff(c_0_9,plain,
! [X584: vAnsMap,X585: vBinOpT,X586: vAType,X587: vExp] :
( ( vecheck(vtypeAM(X584),X587) = vsomeAType(X586) )
| ( vreduceExp(vbinop(ve1,X585,ve2),X584) != vsomeExp(X587) )
| ( vecheck(vtypeAM(X584),vbinop(ve1,X585,ve2)) != vsomeAType(X586) )
| ~ vexpIsValue(ve1)
| vexpIsValue(ve2)
| visSomeExp(vreduceExp(ve2,X584)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
tcf(c_0_10,plain,
! [X4: vAType,X55: vAnsMap,X22: vBinOpT,X5: vExp] :
( ( vreduceExp(vbinop(ve1,X22,ve2),X55) != vsomeExp(X5) )
| ( vecheck(vtypeAM(X55),vbinop(ve1,X22,ve2)) != vsomeAType(X4) )
| ~ vexpIsValue(ve1)
| ~ visSomeExp(vreduceExp(ve2,X55))
| ( vecheck(vtypeAM(X55),X5) = vsomeAType(X4) )
| vexpIsValue(ve2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_11,negated_conjecture,
vexpIsValue(ve1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_12,negated_conjecture,
~ vexpIsValue(ve2),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_13,plain,
! [X4: vAType,X55: vAnsMap,X22: vBinOpT,X5: vExp] :
( ( vreduceExp(vbinop(ve1,X22,ve2),X55) != vsomeExp(X5) )
| ( vecheck(vtypeAM(X55),vbinop(ve1,X22,ve2)) != vsomeAType(X4) )
| ~ vexpIsValue(ve1)
| ( vecheck(vtypeAM(X55),X5) = vsomeAType(X4) )
| vexpIsValue(ve2)
| visSomeExp(vreduceExp(ve2,X55)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_14,plain,
! [X4: vAType,X5: vExp,X22: vBinOpT,X55: vAnsMap] :
( ~ visSomeExp(vreduceExp(ve2,X55))
| ( vreduceExp(vbinop(ve1,X22,ve2),X55) != vsomeExp(X5) )
| ( vecheck(vtypeAM(X55),vbinop(ve1,X22,ve2)) != vsomeAType(X4) )
| ( vecheck(vtypeAM(X55),X5) = vsomeAType(X4) ) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]),c_0_12]) ).
tcf(c_0_15,plain,
! [X4: vAType,X55: vAnsMap,X22: vBinOpT,X5: vExp] :
( ( vreduceExp(vbinop(ve1,X22,ve2),X55) != vsomeExp(X5) )
| ( vecheck(vtypeAM(X55),vbinop(ve1,X22,ve2)) != vsomeAType(X4) )
| ( vecheck(vtypeAM(X55),X5) = vsomeAType(X4) ) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_11])]),c_0_12]),c_0_14]) ).
tcf(c_0_16,negated_conjecture,
vecheck(vtypeAM(esk1_0),vbinop(ve1,esk2_0,ve2)) = vsomeAType(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_17,negated_conjecture,
vreduceExp(vbinop(ve1,esk2_0,ve2),esk1_0) = vsomeExp(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_18,negated_conjecture,
! [X4: vAType,X5: vExp] :
( ( vsomeExp(esk4_0) != vsomeExp(X5) )
| ( vsomeAType(esk3_0) != vsomeAType(X4) )
| ( vecheck(vtypeAM(esk1_0),X5) = vsomeAType(X4) ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
tcf(c_0_19,negated_conjecture,
vecheck(vtypeAM(esk1_0),esk4_0) != vsomeAType(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_20,negated_conjecture,
! [X5: vExp] :
( ( vsomeExp(esk4_0) != vsomeExp(X5) )
| ( vecheck(vtypeAM(esk1_0),X5) = vsomeAType(esk3_0) ) ),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_19,c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COM271_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.57 % Computer : n001.cluster.edu
% 0.10/0.57 % Model : x86_64 x86_64
% 0.10/0.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.57 % Memory : 8046.5625MB
% 0.10/0.57 % OS : Linux 6.8.0-71-generic
% 0.10/0.58 % CPULimit : 300
% 0.10/0.58 % WCLimit : 300
% 0.10/0.58 % DateTime : Mon Sep 21 14:27:30 UTC 2026
% 0.10/0.58 % CPUTime :
% 0.10/0.58 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.65 Running first-order theorem proving
% 0.16/0.65 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.16/0.97 % Version: 3.5.1
% 0.16/0.97 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.16/0.97 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.97 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.16/0.97 % Starting new_bool_3 with 600s (2) cores
% 0.16/0.97 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.97 % Starting sh5l with 300s (1) cores
% 0.16/0.97 % new_bool_3 with pid 3362663 completed with status 0
% 0.16/0.97 % Result found by new_bool_3
% 0.16/0.97 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.16/0.97 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.97 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.16/0.97 % Starting new_bool_3 with 600s (2) cores
% 0.16/0.97 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.97 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.97 % Search class: FGUSM-FSLM32-DFFFFFNN
% 0.16/0.97 % Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.16/0.97 % Starting SubtermCWHack with 61s (1) cores
% 0.16/0.97 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 361s (1) cores
% 0.16/0.97 % G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 3362667 completed with status 0
% 0.16/0.97 % Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.97 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.16/0.97 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.97 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.16/0.97 % Starting new_bool_3 with 600s (2) cores
% 0.16/0.97 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.97 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.97 % Search class: FGUSM-FSLM32-DFFFFFNN
% 0.16/0.97 % Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.16/0.97 % Starting SubtermCWHack with 61s (1) cores
% 0.16/0.97 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 361s (1) cores
% 0.16/0.97 % Preprocessing time : 0.015 s
% 0.16/0.97 % Presaturation interreduction done
% 0.16/0.97
% 0.16/0.97 % Proof found!
% 0.16/0.97 % SZS status Theorem
% 0.16/0.97 % SZS output start CNFRefutation
% See solution above
% 0.16/0.97 % Parsed axioms : 510
% 0.16/0.97 % Removed by relevancy pruning/SinE : 295
% 0.16/0.97 % Initial clauses : 689
% 0.16/0.97 % Removed in clause preprocessing : 0
% 0.16/0.97 % Initial clauses in saturation : 689
% 0.16/0.97 % Processed clauses : 1659
% 0.16/0.97 % ...of these trivial : 34
% 0.16/0.97 % ...subsumed : 668
% 0.16/0.97 % ...remaining for further processing : 957
% 0.16/0.97 % Other redundant clauses eliminated : 271
% 0.16/0.97 % Clauses deleted for lack of memory : 0
% 0.16/0.97 % Backward-subsumed : 14
% 0.16/0.97 % Backward-rewritten : 3
% 0.16/0.97 % Generated clauses : 2572
% 0.16/0.97 % ...of the previous two non-redundant : 1787
% 0.16/0.97 % ...aggressively subsumed : 0
% 0.16/0.97 % Contextual simplify-reflections : 8
% 0.16/0.97 % Paramodulations : 2143
% 0.16/0.97 % Factorizations : 99
% 0.16/0.97 % NegExts : 0
% 0.16/0.97 % Equation resolutions : 330
% 0.16/0.97 % Disequality decompositions : 0
% 0.16/0.97 % Total rewrite steps : 742
% 0.16/0.97 % ...of those cached : 630
% 0.16/0.97 % Propositional unsat checks : 0
% 0.16/0.97 % Propositional check models : 0
% 0.16/0.97 % Propositional check unsatisfiable : 0
% 0.16/0.97 % Propositional clauses : 0
% 0.16/0.97 % Propositional clauses after purity: 0
% 0.16/0.97 % Propositional unsat core size : 0
% 0.16/0.97 % Propositional preprocessing time : 0.000
% 0.16/0.97 % Propositional encoding time : 0.000
% 0.16/0.97 % Propositional solver time : 0.000
% 0.16/0.97 % Success case prop preproc time : 0.000
% 0.16/0.97 % Success case prop encoding time : 0.000
% 0.16/0.97 % Success case prop solver time : 0.000
% 0.16/0.97 % Current number of processed clauses : 479
% 0.16/0.97 % Positive orientable unit clauses : 79
% 0.16/0.97 % Positive unorientable unit clauses: 2
% 0.16/0.97 % Negative unit clauses : 80
% 0.16/0.97 % Non-unit-clauses : 318
% 0.16/0.97 % Current number of unprocessed clauses: 1192
% 0.16/0.97 % ...number of literals in the above : 5878
% 0.16/0.97 % Current number of archived formulas : 0
% 0.16/0.97 % Current number of archived clauses : 478
% 0.16/0.97 % Clause-clause subsumption calls (NU) : 86553
% 0.16/0.97 % Rec. Clause-clause subsumption calls : 45037
% 0.16/0.97 % Non-unit clause-clause subsumptions : 626
% 0.16/0.97 % Unit Clause-clause subsumption calls : 4126
% 0.16/0.97 % Rewrite failures with RHS unbound : 0
% 0.16/0.97 % BW rewrite match attempts : 15
% 0.16/0.97 % BW rewrite match successes : 8
% 0.16/0.97 % Condensation attempts : 0
% 0.16/0.97 % Condensation successes : 0
% 0.16/0.97 % Termbank termtop insertions : 60181
% 0.16/0.97 % Search garbage collected termcells : 7895
% 0.16/0.97
% 0.16/0.97 % -------------------------------------------------
% 0.16/0.97 % User time : 0.230 s
% 0.16/0.97 % System time : 0.026 s
% 0.16/0.97 % Total time : 0.256 s
% 0.16/0.97 % Maximum resident set size: 5820 pages
% 0.16/0.97
% 0.16/0.97 % -------------------------------------------------
% 0.16/0.97 % User time : 0.459 s
% 0.16/0.97 % System time : 0.051 s
% 0.16/0.97 % Total time : 0.510 s
% 0.16/0.97 % Maximum resident set size: 5632 pages
% 0.16/0.97 % E exiting
%------------------------------------------------------------------------------