%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM275_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 : n010.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.21s 1.03s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 69 ( 27 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 72 ( 31 ~; 12 |; 21 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 5 ( 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 : 14 ( 14 usr; 6 con; 0-3 aty)
% Number of variables : 46 ( 0 sgn 42 !; 4 ?; 46 :)
% 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_54,type,
vnoExp: vOptExp ).
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_142,type,
vgetExp: vOptExp > vExp ).
tff(decl_150,type,
esk1_0: vAnsMap ).
tff(decl_151,type,
esk2_0: vBinOpT ).
tff(decl_152,type,
esk3_0: vAType ).
tff(decl_168,type,
esk19_1: vOptExp > vExp ).
tff('reduceExpProgress-binop-expIsValue-True-expIsValue-False-isSomeExp-True',conjecture,
! [X126: vAnsMap,X501: vBinOpT,X73: vAType] :
( ( ( vecheck(vtypeAM(X126),vbinop(ve1,X501,ve2)) = vsomeAType(X73) )
& ~ vexpIsValue(vbinop(ve1,X501,ve2))
& vexpIsValue(ve1)
& ~ vexpIsValue(ve2)
& visSomeExp(vreduceExp(ve2,X126)) )
=> ? [X502: vExp] : ( vreduceExp(vbinop(ve1,X501,ve2),X126) = vsomeExp(X502) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','reduceExpProgress-binop-expIsValue-True-expIsValue-False-isSomeExp-True') ).
tff('reduceExp-4',axiom,
! [X228: vExp,X229: vExp,X126: vAnsMap,X230: vBinOpT] :
( ( visSomeExp(vreduceExp(X229,X126))
& ~ vexpIsValue(X229)
& vexpIsValue(X228) )
=> ( vreduceExp(vbinop(X228,X230,X229),X126) = vsomeExp(vbinop(X228,X230,vgetExp(vreduceExp(X229,X126)))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','reduceExp-4') ).
tff('DIFF-noExp-someExp',axiom,
! [X5: vExp] : ( vnoExp != vsomeExp(X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','DIFF-noExp-someExp') ).
tff('isSomeExp-true-INV',axiom,
! [X171: vOptExp] :
( visSomeExp(X171)
=> ? [X172: vExp] : ( X171 = vsomeExp(X172) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','isSomeExp-true-INV') ).
tff('isSomeExp-false-INV',axiom,
! [X171: vOptExp] :
( ~ visSomeExp(X171)
=> ( X171 = vnoExp ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','isSomeExp-false-INV') ).
tff(c_0_5,negated_conjecture,
~ ! [X126: vAnsMap,X501: vBinOpT,X73: vAType] :
( ( ( vecheck(vtypeAM(X126),vbinop(ve1,X501,ve2)) = vsomeAType(X73) )
& ~ vexpIsValue(vbinop(ve1,X501,ve2))
& vexpIsValue(ve1)
& ~ vexpIsValue(ve2)
& visSomeExp(vreduceExp(ve2,X126)) )
=> ? [X502: vExp] : ( vreduceExp(vbinop(ve1,X501,ve2),X126) = vsomeExp(X502) ) ),
inference(assume_negation,[status(cth)],['reduceExpProgress-binop-expIsValue-True-expIsValue-False-isSomeExp-True']) ).
tff(c_0_6,plain,
! [X228: vExp,X229: vExp,X126: vAnsMap,X230: vBinOpT] :
( ( visSomeExp(vreduceExp(X229,X126))
& ~ vexpIsValue(X229)
& vexpIsValue(X228) )
=> ( vreduceExp(vbinop(X228,X230,X229),X126) = vsomeExp(vbinop(X228,X230,vgetExp(vreduceExp(X229,X126)))) ) ),
inference(fof_simplification,[status(thm)],['reduceExp-4']) ).
tff(c_0_7,negated_conjecture,
~ ! [X126: vAnsMap,X501: vBinOpT,X73: vAType] :
( ( ( vecheck(vtypeAM(X126),vbinop(ve1,X501,ve2)) = vsomeAType(X73) )
& ~ vexpIsValue(vbinop(ve1,X501,ve2))
& vexpIsValue(ve1)
& ~ vexpIsValue(ve2)
& visSomeExp(vreduceExp(ve2,X126)) )
=> ? [X502: vExp] : ( vreduceExp(vbinop(ve1,X501,ve2),X126) = vsomeExp(X502) ) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
tff(c_0_8,plain,
! [X5: vExp] : ( vnoExp != vsomeExp(X5) ),
inference(fof_simplification,[status(thm)],['DIFF-noExp-someExp']) ).
tff(c_0_9,plain,
! [X912: vExp,X913: vExp,X914: vAnsMap,X915: vBinOpT] :
( ( vreduceExp(vbinop(X912,X915,X913),X914) = vsomeExp(vbinop(X912,X915,vgetExp(vreduceExp(X913,X914)))) )
| ~ visSomeExp(vreduceExp(X913,X914))
| vexpIsValue(X913)
| ~ vexpIsValue(X912) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
tff(c_0_10,negated_conjecture,
! [X506: vExp] :
( ( vreduceExp(vbinop(ve1,esk2_0,ve2),esk1_0) != vsomeExp(X506) )
& ( vecheck(vtypeAM(esk1_0),vbinop(ve1,esk2_0,ve2)) = vsomeAType(esk3_0) )
& ~ vexpIsValue(vbinop(ve1,esk2_0,ve2))
& vexpIsValue(ve1)
& ~ vexpIsValue(ve2)
& visSomeExp(vreduceExp(ve2,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_7])])])])]) ).
tff(c_0_11,plain,
! [X607: vOptExp] :
( ( X607 = vsomeExp(esk19_1(X607)) )
| ~ visSomeExp(X607) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['isSomeExp-true-INV'])])])]) ).
tff(c_0_12,plain,
! [X171: vOptExp] :
( ~ visSomeExp(X171)
=> ( X171 = vnoExp ) ),
inference(fof_simplification,[status(thm)],['isSomeExp-false-INV']) ).
tff(c_0_13,plain,
! [X615: vExp] : ( vnoExp != vsomeExp(X615) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_8])]) ).
tcf(c_0_14,plain,
! [X5: vExp,X9: vExp,X22: vBinOpT,X55: vAnsMap] :
( ~ visSomeExp(vreduceExp(X9,X55))
| ~ vexpIsValue(X5)
| ( vreduceExp(vbinop(X5,X22,X9),X55) = vsomeExp(vbinop(X5,X22,vgetExp(vreduceExp(X9,X55)))) )
| vexpIsValue(X9) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_15,negated_conjecture,
visSomeExp(vreduceExp(ve2,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tcf(c_0_16,negated_conjecture,
~ vexpIsValue(ve2),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tcf(c_0_17,negated_conjecture,
! [X5: vExp] : vreduceExp(vbinop(ve1,esk2_0,ve2),esk1_0) != vsomeExp(X5),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tcf(c_0_18,plain,
! [X53: vOptExp] :
( ~ visSomeExp(X53)
| ( X53 = vsomeExp(esk19_1(X53)) ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tff(c_0_19,plain,
! [X609: vOptExp] :
( ( X609 = vnoExp )
| visSomeExp(X609) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])]) ).
tcf(c_0_20,plain,
! [X5: vExp] : vnoExp != vsomeExp(X5),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tcf(c_0_21,negated_conjecture,
! [X22: vBinOpT,X5: vExp] :
( ~ vexpIsValue(X5)
| ( vsomeExp(vbinop(X5,X22,vgetExp(vreduceExp(ve2,esk1_0)))) = vreduceExp(vbinop(X5,X22,ve2),esk1_0) ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
tcf(c_0_22,negated_conjecture,
~ visSomeExp(vreduceExp(vbinop(ve1,esk2_0,ve2),esk1_0)),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18])]) ).
tcf(c_0_23,plain,
! [X53: vOptExp] :
( ( X53 = vnoExp )
| visSomeExp(X53) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
tcf(c_0_24,negated_conjecture,
! [X22: vBinOpT,X5: vExp] :
( ~ vexpIsValue(X5)
| ( vreduceExp(vbinop(X5,X22,ve2),esk1_0) != vnoExp ) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
tcf(c_0_25,negated_conjecture,
vreduceExp(vbinop(ve1,esk2_0,ve2),esk1_0) = vnoExp,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
tcf(c_0_26,negated_conjecture,
vexpIsValue(ve1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : COM275_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.19/0.64 % Computer : n010.cluster.edu
% 0.19/0.64 % Model : x86_64 x86_64
% 0.19/0.64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.64 % Memory : 8046.5625MB
% 0.19/0.64 % OS : Linux 6.8.0-71-generic
% 0.19/0.64 % CPULimit : 300
% 0.19/0.64 % WCLimit : 300
% 0.19/0.64 % DateTime : Mon Sep 21 14:22:57 UTC 2026
% 0.19/0.65 % CPUTime :
% 0.19/0.65 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.71 Running first-order theorem proving
% 0.21/0.71 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.21/1.03 % Version: 3.5.1
% 0.21/1.03 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.21/1.03 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/1.03 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.21/1.03 % Starting new_bool_3 with 600s (2) cores
% 0.21/1.03 % Starting new_bool_1 with 300s (1) cores
% 0.21/1.03 % Starting sh5l with 300s (1) cores
% 0.21/1.03 % new_bool_3 with pid 1092127 completed with status 0
% 0.21/1.03 % Result found by new_bool_3
% 0.21/1.03 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.21/1.03 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/1.03 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.21/1.03 % Starting new_bool_3 with 600s (2) cores
% 0.21/1.03 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/1.03 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/1.03 % Search class: FGUSM-FSLM32-DFFFFFNN
% 0.21/1.03 % Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.21/1.03 % Starting SubtermCWHack with 61s (1) cores
% 0.21/1.03 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 361s (1) cores
% 0.21/1.03 % G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 1092132 completed with status 0
% 0.21/1.03 % Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.21/1.03 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.21/1.03 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/1.03 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.21/1.03 % Starting new_bool_3 with 600s (2) cores
% 0.21/1.03 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/1.03 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/1.03 % Search class: FGUSM-FSLM32-DFFFFFNN
% 0.21/1.03 % Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.21/1.03 % Starting SubtermCWHack with 61s (1) cores
% 0.21/1.03 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 361s (1) cores
% 0.21/1.03 % Preprocessing time : 0.014 s
% 0.21/1.03 % Presaturation interreduction done
% 0.21/1.03
% 0.21/1.03 % Proof found!
% 0.21/1.03 % SZS status Theorem
% 0.21/1.03 % SZS output start CNFRefutation
% See solution above
% 0.21/1.03 % Parsed axioms : 508
% 0.21/1.03 % Removed by relevancy pruning/SinE : 295
% 0.21/1.03 % Initial clauses : 688
% 0.21/1.03 % Removed in clause preprocessing : 0
% 0.21/1.03 % Initial clauses in saturation : 688
% 0.21/1.03 % Processed clauses : 1785
% 0.21/1.03 % ...of these trivial : 42
% 0.21/1.03 % ...subsumed : 740
% 0.21/1.03 % ...remaining for further processing : 1003
% 0.21/1.03 % Other redundant clauses eliminated : 266
% 0.21/1.03 % Clauses deleted for lack of memory : 0
% 0.21/1.03 % Backward-subsumed : 11
% 0.21/1.03 % Backward-rewritten : 7
% 0.21/1.03 % Generated clauses : 2758
% 0.21/1.03 % ...of the previous two non-redundant : 1996
% 0.21/1.03 % ...aggressively subsumed : 0
% 0.21/1.03 % Contextual simplify-reflections : 8
% 0.21/1.03 % Paramodulations : 2339
% 0.21/1.03 % Factorizations : 96
% 0.21/1.03 % NegExts : 0
% 0.21/1.03 % Equation resolutions : 323
% 0.21/1.03 % Disequality decompositions : 0
% 0.21/1.03 % Total rewrite steps : 781
% 0.21/1.03 % ...of those cached : 662
% 0.21/1.03 % Propositional unsat checks : 0
% 0.21/1.03 % Propositional check models : 0
% 0.21/1.03 % Propositional check unsatisfiable : 0
% 0.21/1.03 % Propositional clauses : 0
% 0.21/1.03 % Propositional clauses after purity: 0
% 0.21/1.03 % Propositional unsat core size : 0
% 0.21/1.03 % Propositional preprocessing time : 0.000
% 0.21/1.03 % Propositional encoding time : 0.000
% 0.21/1.03 % Propositional solver time : 0.000
% 0.21/1.03 % Success case prop preproc time : 0.000
% 0.21/1.03 % Success case prop encoding time : 0.000
% 0.21/1.03 % Success case prop solver time : 0.000
% 0.21/1.03 % Current number of processed clauses : 525
% 0.21/1.03 % Positive orientable unit clauses : 89
% 0.21/1.03 % Positive unorientable unit clauses: 2
% 0.21/1.03 % Negative unit clauses : 89
% 0.21/1.03 % Non-unit-clauses : 345
% 0.21/1.03 % Current number of unprocessed clauses: 1317
% 0.21/1.03 % ...number of literals in the above : 5983
% 0.21/1.03 % Current number of archived formulas : 0
% 0.21/1.03 % Current number of archived clauses : 478
% 0.21/1.03 % Clause-clause subsumption calls (NU) : 89774
% 0.21/1.03 % Rec. Clause-clause subsumption calls : 49813
% 0.21/1.03 % Non-unit clause-clause subsumptions : 663
% 0.21/1.03 % Unit Clause-clause subsumption calls : 6834
% 0.21/1.03 % Rewrite failures with RHS unbound : 0
% 0.21/1.03 % BW rewrite match attempts : 20
% 0.21/1.03 % BW rewrite match successes : 10
% 0.21/1.03 % Condensation attempts : 0
% 0.21/1.03 % Condensation successes : 0
% 0.21/1.03 % Termbank termtop insertions : 61162
% 0.21/1.03 % Search garbage collected termcells : 7865
% 0.21/1.03
% 0.21/1.03 % -------------------------------------------------
% 0.21/1.03 % User time : 0.240 s
% 0.21/1.03 % System time : 0.016 s
% 0.21/1.03 % Total time : 0.256 s
% 0.21/1.03 % Maximum resident set size: 5816 pages
% 0.21/1.03
% 0.21/1.03 % -------------------------------------------------
% 0.21/1.03 % User time : 0.473 s
% 0.21/1.03 % System time : 0.034 s
% 0.21/1.03 % Total time : 0.507 s
% 0.21/1.03 % Maximum resident set size: 5376 pages
% 0.21/1.03 % E exiting
%------------------------------------------------------------------------------