%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ITP183^1 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n002.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 : Wed Sep 30 08:04:37 AM UTC 2026
% Result : Theorem 3.23s 0.81s
% Output : CNFRefutation 3.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 13 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 19 ( 0 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 122 ( 8 ~; 4 |; 0 &; 108 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 12 ( 0 ^; 12 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
pi: $tType ).
thf(decl_sort2,type,
name: $tType ).
thf(decl_sort3,type,
late_freeRes: $tType ).
thf(decl_sort4,type,
late_residual: $tType ).
thf(decl_28,type,
res: name > pi > pi ).
thf(decl_29,type,
sum: pi > pi > pi ).
thf(decl_35,type,
late_FreeR: late_freeRes > pi > late_residual ).
thf(decl_38,type,
late_transitions: pi > late_residual > $o ).
thf(decl_49,type,
fresh_1641682979reeRes: name > late_freeRes > $o ).
thf(decl_102,type,
p: pi ).
thf(decl_104,type,
q: pi ).
thf(decl_105,type,
q2: pi ).
thf(decl_107,type,
alpha: late_freeRes ).
thf(decl_108,type,
x: name ).
thf(conj_0,conjecture,
late_transitions @ ( res @ x @ ( sum @ p @ q ) ) @ ( late_FreeR @ alpha @ ( res @ x @ q2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.e9o4FXEmCv/E---3.1_1791112.p',conj_0) ).
thf(fact_13_ResF,axiom,
! [X5: pi,X9: late_freeRes,X13: pi,X17: name] :
( ( late_transitions @ X5 @ ( late_FreeR @ X9 @ X13 ) )
=> ( ( fresh_1641682979reeRes @ X17 @ X9 )
=> ( late_transitions @ ( res @ X17 @ X5 ) @ ( late_FreeR @ X9 @ ( res @ X17 @ X13 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.e9o4FXEmCv/E---3.1_1791112.p',fact_13_ResF) ).
thf(fact_2__092_060open_062P_A_092_060oplus_062_AQ_A_092_060longmapsto_062_A_092_060alpha_062_A_092_060prec_062_AQ_H_092_060close_062,axiom,
late_transitions @ ( sum @ p @ q ) @ ( late_FreeR @ alpha @ q2 ),
file('/export/starexec/sandbox2/tmp/tmp.e9o4FXEmCv/E---3.1_1791112.p',fact_2__092_060open_062P_A_092_060oplus_062_AQ_A_092_060longmapsto_062_A_092_060alpha_062_A_092_060prec_062_AQ_H_092_060close_062) ).
thf(fact_0_cRes_Ohyps_I2_J,axiom,
fresh_1641682979reeRes @ x @ alpha,
file('/export/starexec/sandbox2/tmp/tmp.e9o4FXEmCv/E---3.1_1791112.p',fact_0_cRes_Ohyps_I2_J) ).
thf(c_0_4,negated_conjecture,
~ ( late_transitions @ ( res @ x @ ( sum @ p @ q ) ) @ ( late_FreeR @ alpha @ ( res @ x @ q2 ) ) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_5,negated_conjecture,
~ ( late_transitions @ ( res @ x @ ( sum @ p @ q ) ) @ ( late_FreeR @ alpha @ ( res @ x @ q2 ) ) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
~ ( late_transitions @ ( res @ x @ ( sum @ p @ q ) ) @ ( late_FreeR @ alpha @ ( res @ x @ q2 ) ) ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
thf(c_0_7,plain,
! [X1793: pi,X1794: late_freeRes,X1795: pi,X1796: name] :
( ~ ( late_transitions @ X1793 @ ( late_FreeR @ X1794 @ X1795 ) )
| ~ ( fresh_1641682979reeRes @ X1796 @ X1794 )
| ( late_transitions @ ( res @ X1796 @ X1793 ) @ ( late_FreeR @ X1794 @ ( res @ X1796 @ X1795 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_13_ResF])])]) ).
thf(c_0_8,negated_conjecture,
~ ( late_transitions @ ( res @ x @ ( sum @ p @ q ) ) @ ( late_FreeR @ alpha @ ( res @ x @ q2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,plain,
! [X1: pi,X2: pi,X3: name,X9: late_freeRes] :
( ( late_transitions @ ( res @ X3 @ X1 ) @ ( late_FreeR @ X9 @ ( res @ X3 @ X2 ) ) )
| ~ ( late_transitions @ X1 @ ( late_FreeR @ X9 @ X2 ) )
| ~ ( fresh_1641682979reeRes @ X3 @ X9 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,plain,
late_transitions @ ( sum @ p @ q ) @ ( late_FreeR @ alpha @ q2 ),
inference(split_conjunct,[status(thm)],[fact_2__092_060open_062P_A_092_060oplus_062_AQ_A_092_060longmapsto_062_A_092_060alpha_062_A_092_060prec_062_AQ_H_092_060close_062]) ).
thf(c_0_11,plain,
fresh_1641682979reeRes @ x @ alpha,
inference(split_conjunct,[status(thm)],[fact_0_cRes_Ohyps_I2_J]) ).
thf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP183^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.18 % Computer : n002.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 20:10:37 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.22 Running higher-order theorem proving
% 0.23/0.27 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.e9o4FXEmCv/E---3.1_1791112.p
% 3.23/0.81 % Version: 3.5.1-ho
% 3.23/0.81 % Preprocessing class: HSLSSMSMSSSNSFA.
% 3.23/0.81 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 3.23/0.81 % Starting new_ho_10 with 900s (3) cores
% 3.23/0.81 % Starting sh2lt with 300s (1) cores
% 3.23/0.81 % Starting new_ho_5 with 300s (1) cores
% 3.23/0.81 % Starting full_lambda_5 with 300s (1) cores
% 3.23/0.81 % Starting sh9 with 300s (1) cores
% 3.23/0.81 % Starting ehoh_best8_lambda with 300s (1) cores
% 3.23/0.81 % new_ho_10 with pid 1791125 completed with status 0
% 3.23/0.81 % Result found by new_ho_10
% 3.23/0.81 % Preprocessing class: HSLSSMSMSSSNSFA.
% 3.23/0.81 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 3.23/0.81 % Starting new_ho_10 with 900s (3) cores
% 3.23/0.81 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.23/0.81 % No SInE strategy applied
% 3.23/0.81 % Search class: HGHSM-FSLM32-MSFFFFBN
% 3.23/0.81 % Scheduled 7 strats onto 3 cores with 900 seconds (900 total)
% 3.23/0.81 % Starting SubtermCWHack with 82s (1) cores
% 3.23/0.81 % Starting new_ho_10 with 91s (1) cores
% 3.23/0.81 % Starting sh5l with 82s (1) cores
% 3.23/0.81 % new_ho_10 with pid 1791136 completed with status 0
% 3.23/0.81 % Result found by new_ho_10
% 3.23/0.81 % Preprocessing class: HSLSSMSMSSSNSFA.
% 3.23/0.81 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 3.23/0.81 % Starting new_ho_10 with 900s (3) cores
% 3.23/0.81 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.23/0.81 % No SInE strategy applied
% 3.23/0.81 % Search class: HGHSM-FSLM32-MSFFFFBN
% 3.23/0.81 % Scheduled 7 strats onto 3 cores with 900 seconds (900 total)
% 3.23/0.81 % Starting SubtermCWHack with 82s (1) cores
% 3.23/0.81 % Starting new_ho_10 with 91s (1) cores
% 3.23/0.81 % Preprocessing time : 0.017 s
% 3.23/0.81 % Presaturation interreduction done
% 3.23/0.81
% 3.23/0.81 % Proof found!
% 3.23/0.81 % SZS status Theorem
% 3.23/0.81 % SZS output start CNFRefutation
% See solution above
% 3.23/0.81 % Parsed axioms : 431
% 3.23/0.81 % Removed by relevancy pruning/SinE : 0
% 3.23/0.81 % Initial clauses : 1028
% 3.23/0.81 % Removed in clause preprocessing : 143
% 3.23/0.81 % Initial clauses in saturation : 885
% 3.23/0.81 % Processed clauses : 1341
% 3.23/0.81 % ...of these trivial : 27
% 3.23/0.81 % ...subsumed : 109
% 3.23/0.81 % ...remaining for further processing : 1205
% 3.23/0.81 % Other redundant clauses eliminated : 139
% 3.23/0.81 % Clauses deleted for lack of memory : 0
% 3.23/0.81 % Backward-subsumed : 0
% 3.23/0.81 % Backward-rewritten : 16
% 3.23/0.81 % Generated clauses : 826
% 3.23/0.81 % ...of the previous two non-redundant : 547
% 3.23/0.81 % ...aggressively subsumed : 0
% 3.23/0.81 % Contextual simplify-reflections : 0
% 3.23/0.81 % Paramodulations : 574
% 3.23/0.81 % Factorizations : 0
% 3.23/0.81 % NegExts : 1
% 3.23/0.81 % Equation resolutions : 176
% 3.23/0.81 % Disequality decompositions : 0
% 3.23/0.81 % Total rewrite steps : 150
% 3.23/0.81 % ...of those cached : 63
% 3.23/0.81 % Propositional unsat checks : 0
% 3.23/0.81 % Propositional check models : 0
% 3.23/0.81 % Propositional check unsatisfiable : 0
% 3.23/0.81 % Propositional clauses : 0
% 3.23/0.81 % Propositional clauses after purity: 0
% 3.23/0.81 % Propositional unsat core size : 0
% 3.23/0.81 % Propositional preprocessing time : 0.000
% 3.23/0.81 % Propositional encoding time : 0.000
% 3.23/0.81 % Propositional solver time : 0.000
% 3.23/0.81 % Success case prop preproc time : 0.000
% 3.23/0.81 % Success case prop encoding time : 0.000
% 3.23/0.81 % Success case prop solver time : 0.000
% 3.23/0.81 % Current number of processed clauses : 358
% 3.23/0.81 % Positive orientable unit clauses : 86
% 3.23/0.81 % Positive unorientable unit clauses: 1
% 3.23/0.81 % Negative unit clauses : 62
% 3.23/0.81 % Non-unit-clauses : 209
% 3.23/0.81 % Current number of unprocessed clauses: 853
% 3.23/0.81 % ...number of literals in the above : 2887
% 3.23/0.81 % Current number of archived formulas : 0
% 3.23/0.81 % Current number of archived clauses : 816
% 3.23/0.81 % Clause-clause subsumption calls (NU) : 261680
% 3.23/0.81 % Rec. Clause-clause subsumption calls : 80713
% 3.23/0.81 % Non-unit clause-clause subsumptions : 68
% 3.23/0.81 % Unit Clause-clause subsumption calls : 2658
% 3.23/0.81 % Rewrite failures with RHS unbound : 0
% 3.23/0.81 % BW rewrite match attempts : 37
% 3.23/0.81 % BW rewrite match successes : 17
% 3.23/0.81 % Condensation attempts : 1341
% 3.23/0.81 % Condensation successes : 2
% 3.23/0.81 % Termbank termtop insertions : 94243
% 3.23/0.81 % Search garbage collected termcells : 17520
% 3.23/0.81
% 3.23/0.81 % -------------------------------------------------
% 3.23/0.81 % User time : 0.380 s
% 3.23/0.81 % System time : 0.021 s
% 3.23/0.81 % Total time : 0.401 s
% 3.23/0.81 % Maximum resident set size: 7628 pages
% 3.23/0.81
% 3.23/0.81 % -------------------------------------------------
% 3.23/0.81 % User time : 0.971 s
% 3.23/0.81 % System time : 0.073 s
% 3.23/0.81 % Total time : 1.044 s
% 3.23/0.81 % Maximum resident set size: 5632 pages
% 3.23/0.81 % E exiting
%------------------------------------------------------------------------------