%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ITP057^1 : TPTP v9.3.1. Bugfixed v9.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:13 AM UTC 2026
% Result : Theorem 0.64s 0.42s
% Output : CNFRefutation 0.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 21 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 60 ( 6 equ; 0 cnn)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 306 ( 15 ~; 11 |; 0 &; 272 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 8 avg)
% Number of types : 9 ( 8 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 15 usr; 6 con; 0-6 aty)
% Number of variables : 20 ( 20 ^; 0 !; 0 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
p: $tType ).
thf(decl_sort2,type,
s: $tType ).
thf(decl_sort3,type,
messageValue_v: $tType ).
thf(decl_sort4,type,
message_p_v: $tType ).
thf(decl_sort5,type,
nat: $tType ).
thf(decl_sort6,type,
config256849571t_unit: $tType ).
thf(decl_sort7,type,
list_c1059388851t_unit: $tType ).
thf(decl_sort8,type,
set_o: $tType ).
thf(decl_23,type,
initReachable_p_s_v: ( p > s > messageValue_v > s ) > ( p > s > messageValue_v > message_p_v > nat ) > ( p > s ) > config256849571t_unit > $o ).
thf(decl_28,type,
steps_p_s_v: ( p > s > messageValue_v > s ) > ( p > s > messageValue_v > message_p_v > nat ) > config256849571t_unit > message_p_v > config256849571t_unit > $o ).
thf(decl_32,type,
isReceiverOf_p_v: p > message_p_v > $o ).
thf(decl_40,type,
pSilDecVal_p_s_v: ( p > s > messageValue_v > s ) > ( p > s > messageValue_v > message_p_v > nat ) > ( p > s ) > $o > p > config256849571t_unit > $o ).
thf(decl_49,type,
last_c571238084t_unit: list_c1059388851t_unit > config256849571t_unit ).
thf(decl_60,type,
ord_less_eq_set_o: set_o > set_o > $o ).
thf(decl_62,type,
collect_o: ( $o > $o ) > set_o ).
thf(decl_68,type,
cMsg: config256849571t_unit ).
thf(decl_69,type,
c: config256849571t_unit ).
thf(decl_72,type,
exec2: list_c1059388851t_unit ).
thf(decl_73,type,
msg: message_p_v ).
thf(decl_74,type,
p2: p ).
thf(decl_75,type,
sends: p > s > messageValue_v > message_p_v > nat ).
thf(decl_76,type,
start: p > s ).
thf(decl_80,type,
trans: p > s > messageValue_v > s ).
thf(fact_6__092_060open_062_092_060lbrakk_062p_A_061_Ap_059_Alast_Aexec_H_A_092_060turnstile_062_Amsg_A_092_060mapsto_062_AcMsg_059_AisReceiverOf_Ap_Amsg_059_AinitReachable_A_Ilast_Aexec_H_J_092_060rbrakk_062_A_092_060Longrightarrow_062_Aval_091p_Mlast_Aexec_H_093_A_092_060subseteq_062_Aval_091p_McMsg_093_092_060close_062,axiom,
( ( p2 = p2 )
=> ( ( steps_p_s_v @ trans @ sends @ ( last_c571238084t_unit @ exec2 ) @ msg @ cMsg )
=> ( ( isReceiverOf_p_v @ p2 @ msg )
=> ( ( initReachable_p_s_v @ trans @ sends @ start @ ( last_c571238084t_unit @ exec2 ) )
=> ( ord_less_eq_set_o
@ ( collect_o
@ ^ [X1: $o] : ( pSilDecVal_p_s_v @ trans @ sends @ start @ X1 @ p2 @ ( last_c571238084t_unit @ exec2 ) ) )
@ ( collect_o
@ ^ [X1: $o] : ( pSilDecVal_p_s_v @ trans @ sends @ start @ X1 @ p2 @ cMsg ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.vwbsz6CDJi/E---3.1_820173.p',fact_6__092_060open_062_092_060lbrakk_062p_A_061_Ap_059_Alast_Aexec_H_A_092_060turnstile_062_Amsg_A_092_060mapsto_062_AcMsg_059_AisReceiverOf_Ap_Amsg_059_AinitReachable_A_Ilast_Aexec_H_J_092_060rbrakk_062_A_092_060Longrightarrow_062_Aval_091p_Mlast_Aexec_H_093_A_092_060subseteq_062_Aval_091p_McMsg_093_092_060close_062) ).
thf(conj_0,conjecture,
( ord_less_eq_set_o
@ ( collect_o
@ ^ [X1: $o] : ( pSilDecVal_p_s_v @ trans @ sends @ start @ X1 @ p2 @ ( last_c571238084t_unit @ exec2 ) ) )
@ ( collect_o
@ ^ [X1: $o] : ( pSilDecVal_p_s_v @ trans @ sends @ start @ X1 @ p2 @ cMsg ) ) ),
file('/export/starexec/sandbox/tmp/tmp.vwbsz6CDJi/E---3.1_820173.p',conj_0) ).
thf(fact_1_InitReachLastExec_H,axiom,
initReachable_p_s_v @ trans @ sends @ start @ ( last_c571238084t_unit @ exec2 ),
file('/export/starexec/sandbox/tmp/tmp.vwbsz6CDJi/E---3.1_820173.p',fact_1_InitReachLastExec_H) ).
thf(fact_2_NewExec_I3_J,axiom,
( ( last_c571238084t_unit @ exec2 )
= c ),
file('/export/starexec/sandbox/tmp/tmp.vwbsz6CDJi/E---3.1_820173.p',fact_2_NewExec_I3_J) ).
thf(fact_3_CMsg,axiom,
steps_p_s_v @ trans @ sends @ ( last_c571238084t_unit @ exec2 ) @ msg @ cMsg,
file('/export/starexec/sandbox/tmp/tmp.vwbsz6CDJi/E---3.1_820173.p',fact_3_CMsg) ).
thf(fact_0_PisReceiverOf,axiom,
isReceiverOf_p_v @ p2 @ msg,
file('/export/starexec/sandbox/tmp/tmp.vwbsz6CDJi/E---3.1_820173.p',fact_0_PisReceiverOf) ).
thf(c_0_6,plain,
( ( p2 = p2 )
=> ( ( steps_p_s_v @ trans @ sends @ ( last_c571238084t_unit @ exec2 ) @ msg @ cMsg )
=> ( ( isReceiverOf_p_v @ p2 @ msg )
=> ( ( initReachable_p_s_v @ trans @ sends @ start @ ( last_c571238084t_unit @ exec2 ) )
=> ( ord_less_eq_set_o
@ ( collect_o
@ ^ [Z0: $o] : ( pSilDecVal_p_s_v @ trans @ sends @ start @ Z0 @ p2 @ ( last_c571238084t_unit @ exec2 ) ) )
@ ( collect_o
@ ^ [Z0: $o] : ( pSilDecVal_p_s_v @ trans @ sends @ start @ Z0 @ p2 @ cMsg ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[fact_6__092_060open_062_092_060lbrakk_062p_A_061_Ap_059_Alast_Aexec_H_A_092_060turnstile_062_Amsg_A_092_060mapsto_062_AcMsg_059_AisReceiverOf_Ap_Amsg_059_AinitReachable_A_Ilast_Aexec_H_J_092_060rbrakk_062_A_092_060Longrightarrow_062_Aval_091p_Mlast_Aexec_H_093_A_092_060subseteq_062_Aval_091p_McMsg_093_092_060close_062]) ).
thf(c_0_7,negated_conjecture,
~ ( ord_less_eq_set_o
@ ( collect_o
@ ^ [X1: $o] : ( pSilDecVal_p_s_v @ trans @ sends @ start @ X1 @ p2 @ ( last_c571238084t_unit @ exec2 ) ) )
@ ( collect_o
@ ^ [X1: $o] : ( pSilDecVal_p_s_v @ trans @ sends @ start @ X1 @ p2 @ cMsg ) ) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_8,plain,
( ( p2 != p2 )
| ~ ( steps_p_s_v @ trans @ sends @ ( last_c571238084t_unit @ exec2 ) @ msg @ cMsg )
| ~ ( isReceiverOf_p_v @ p2 @ msg )
| ~ ( initReachable_p_s_v @ trans @ sends @ start @ ( last_c571238084t_unit @ exec2 ) )
| ( ord_less_eq_set_o
@ ( collect_o
@ ^ [Z0: $o] : ( pSilDecVal_p_s_v @ trans @ sends @ start @ Z0 @ p2 @ ( last_c571238084t_unit @ exec2 ) ) )
@ ( collect_o
@ ^ [Z0: $o] : ( pSilDecVal_p_s_v @ trans @ sends @ start @ Z0 @ p2 @ cMsg ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
thf(c_0_9,negated_conjecture,
~ ( ord_less_eq_set_o
@ ( collect_o
@ ^ [Z0: $o] : ( pSilDecVal_p_s_v @ trans @ sends @ start @ Z0 @ p2 @ ( last_c571238084t_unit @ exec2 ) ) )
@ ( collect_o
@ ^ [Z0: $o] : ( pSilDecVal_p_s_v @ trans @ sends @ start @ Z0 @ p2 @ cMsg ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_7])]) ).
thf(c_0_10,plain,
( ( ord_less_eq_set_o
@ ( collect_o
@ ^ [Z0: $o] : ( pSilDecVal_p_s_v @ trans @ sends @ start @ Z0 @ p2 @ ( last_c571238084t_unit @ exec2 ) ) )
@ ( collect_o
@ ^ [Z0: $o] : ( pSilDecVal_p_s_v @ trans @ sends @ start @ Z0 @ p2 @ cMsg ) ) )
| ( p2 != p2 )
| ~ ( steps_p_s_v @ trans @ sends @ ( last_c571238084t_unit @ exec2 ) @ msg @ cMsg )
| ~ ( isReceiverOf_p_v @ p2 @ msg )
| ~ ( initReachable_p_s_v @ trans @ sends @ start @ ( last_c571238084t_unit @ exec2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_11,plain,
initReachable_p_s_v @ trans @ sends @ start @ ( last_c571238084t_unit @ exec2 ),
inference(split_conjunct,[status(thm)],[fact_1_InitReachLastExec_H]) ).
thf(c_0_12,plain,
( ( last_c571238084t_unit @ exec2 )
= c ),
inference(split_conjunct,[status(thm)],[fact_2_NewExec_I3_J]) ).
thf(c_0_13,plain,
steps_p_s_v @ trans @ sends @ ( last_c571238084t_unit @ exec2 ) @ msg @ cMsg,
inference(split_conjunct,[status(thm)],[fact_3_CMsg]) ).
thf(c_0_14,negated_conjecture,
~ ( ord_less_eq_set_o
@ ( collect_o
@ ^ [Z0: $o] : ( pSilDecVal_p_s_v @ trans @ sends @ start @ Z0 @ p2 @ ( last_c571238084t_unit @ exec2 ) ) )
@ ( collect_o
@ ^ [Z0: $o] : ( pSilDecVal_p_s_v @ trans @ sends @ start @ Z0 @ p2 @ cMsg ) ) ),
inference(fof_nnf,[status(thm)],[c_0_9]) ).
thf(c_0_15,plain,
( ( ord_less_eq_set_o
@ ( collect_o
@ ^ [Z0: $o] : ( pSilDecVal_p_s_v @ trans @ sends @ start @ Z0 @ p2 @ ( last_c571238084t_unit @ exec2 ) ) )
@ ( collect_o
@ ^ [Z0: $o] : ( pSilDecVal_p_s_v @ trans @ sends @ start @ Z0 @ p2 @ cMsg ) ) )
| ~ ( isReceiverOf_p_v @ p2 @ msg )
| ~ ( initReachable_p_s_v @ trans @ sends @ start @ ( last_c571238084t_unit @ exec2 ) )
| ~ ( steps_p_s_v @ trans @ sends @ ( last_c571238084t_unit @ exec2 ) @ msg @ cMsg ) ),
inference(cn,[status(thm)],[c_0_10]) ).
thf(c_0_16,plain,
isReceiverOf_p_v @ p2 @ msg,
inference(split_conjunct,[status(thm)],[fact_0_PisReceiverOf]) ).
thf(c_0_17,plain,
initReachable_p_s_v @ trans @ sends @ start @ c,
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_18,plain,
steps_p_s_v @ trans @ sends @ c @ msg @ cMsg,
inference(rw,[status(thm)],[c_0_13,c_0_12]) ).
thf(c_0_19,negated_conjecture,
~ ( ord_less_eq_set_o
@ ( collect_o
@ ^ [Z0: $o] : ( pSilDecVal_p_s_v @ trans @ sends @ start @ Z0 @ p2 @ ( last_c571238084t_unit @ exec2 ) ) )
@ ( collect_o
@ ^ [Z0: $o] : ( pSilDecVal_p_s_v @ trans @ sends @ start @ Z0 @ p2 @ cMsg ) ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_20,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_12]),c_0_17]),c_0_12]),c_0_18])]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ITP057^1 : TPTP v9.3.1. Bugfixed v9.2.1.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.17 % Computer : n016.cluster.edu
% 0.11/0.17 % Model : x86_64 x86_64
% 0.11/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.17 % Memory : 8046.5625MB
% 0.11/0.17 % OS : Linux 6.8.0-71-generic
% 0.11/0.17 % CPULimit : 300
% 0.11/0.17 % WCLimit : 300
% 0.11/0.17 % DateTime : Tue Sep 29 19:49:19 UTC 2026
% 0.11/0.17 % CPUTime :
% 0.11/0.17 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.21 Running higher-order theorem proving
% 0.11/0.27 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.vwbsz6CDJi/E---3.1_820173.p
% 0.64/0.42 % Version: 3.5.1-ho
% 0.64/0.42 % Preprocessing class: HSLSSMSMSSLNHSA.
% 0.64/0.42 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.42 % Starting ho_unfolding_8 with 900s (3) cores
% 0.64/0.42 % Starting new_bool_8 with 300s (1) cores
% 0.64/0.42 % Starting post_as_ho6 with 300s (1) cores
% 0.64/0.42 % Starting ho_unfolding_1 with 300s (1) cores
% 0.64/0.42 % Starting full_lambda_4 with 300s (1) cores
% 0.64/0.42 % Starting pre_casc_5 with 300s (1) cores
% 0.64/0.42 % ho_unfolding_8 with pid 820186 completed with status 0
% 0.64/0.42 % Result found by ho_unfolding_8
% 0.64/0.42 % Preprocessing class: HSLSSMSMSSLNHSA.
% 0.64/0.42 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.42 % Starting ho_unfolding_8 with 900s (3) cores
% 0.64/0.42 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.64/0.42 % No SInE strategy applied
% 0.64/0.42 % Search class: HGHSM-FSLM33-DHSFFFBN
% 0.64/0.42 % partial match(1): HGHSM-FSLM31-DHSFFFBN
% 0.64/0.42 % Scheduled 7 strats onto 3 cores with 900 seconds (900 total)
% 0.64/0.42 % Starting SubtermCWHack with 82s (1) cores
% 0.64/0.42 % Starting ho_unfolding_8 with 91s (1) cores
% 0.64/0.42 % Starting full_lambda_10 with 159s (1) cores
% 0.64/0.42 % full_lambda_10 with pid 820199 completed with status 0
% 0.64/0.42 % Result found by full_lambda_10
% 0.64/0.42 % Preprocessing class: HSLSSMSMSSLNHSA.
% 0.64/0.42 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.42 % Starting ho_unfolding_8 with 900s (3) cores
% 0.64/0.42 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.64/0.42 % No SInE strategy applied
% 0.64/0.42 % Search class: HGHSM-FSLM33-DHSFFFBN
% 0.64/0.42 % partial match(1): HGHSM-FSLM31-DHSFFFBN
% 0.64/0.42 % Scheduled 7 strats onto 3 cores with 900 seconds (900 total)
% 0.64/0.42 % Starting SubtermCWHack with 82s (1) cores
% 0.64/0.42 % Starting ho_unfolding_8 with 91s (1) cores
% 0.64/0.42 % Starting full_lambda_10 with 159s (1) cores
% 0.64/0.42 % Preprocessing time : 0.017 s
% 0.64/0.42 % Presaturation interreduction done
% 0.64/0.42
% 0.64/0.42 % Proof found!
% 0.64/0.42 % SZS status Theorem
% 0.64/0.42 % SZS output start CNFRefutation
% See solution above
% 0.64/0.42 % Parsed axioms : 424
% 0.64/0.42 % Removed by relevancy pruning/SinE : 0
% 0.64/0.42 % Initial clauses : 910
% 0.64/0.42 % Removed in clause preprocessing : 180
% 0.64/0.42 % Initial clauses in saturation : 730
% 0.64/0.42 % Processed clauses : 217
% 0.64/0.42 % ...of these trivial : 9
% 0.64/0.42 % ...subsumed : 45
% 0.64/0.42 % ...remaining for further processing : 162
% 0.64/0.42 % Other redundant clauses eliminated : 51
% 0.64/0.42 % Clauses deleted for lack of memory : 0
% 0.64/0.42 % Backward-subsumed : 1
% 0.64/0.42 % Backward-rewritten : 2
% 0.64/0.42 % Generated clauses : 51
% 0.64/0.42 % ...of the previous two non-redundant : 10
% 0.64/0.42 % ...aggressively subsumed : 0
% 0.64/0.42 % Contextual simplify-reflections : 0
% 0.64/0.42 % Paramodulations : 0
% 0.64/0.42 % Factorizations : 0
% 0.64/0.42 % NegExts : 0
% 0.64/0.42 % Equation resolutions : 51
% 0.64/0.42 % Disequality decompositions : 0
% 0.64/0.42 % Total rewrite steps : 78
% 0.64/0.42 % ...of those cached : 59
% 0.64/0.42 % Propositional unsat checks : 0
% 0.64/0.42 % Propositional check models : 0
% 0.64/0.42 % Propositional check unsatisfiable : 0
% 0.64/0.42 % Propositional clauses : 0
% 0.64/0.42 % Propositional clauses after purity: 0
% 0.64/0.42 % Propositional unsat core size : 0
% 0.64/0.42 % Propositional preprocessing time : 0.000
% 0.64/0.42 % Propositional encoding time : 0.000
% 0.64/0.42 % Propositional solver time : 0.000
% 0.64/0.42 % Success case prop preproc time : 0.000
% 0.64/0.42 % Success case prop encoding time : 0.000
% 0.64/0.42 % Success case prop solver time : 0.000
% 0.64/0.42 % Current number of processed clauses : 108
% 0.64/0.42 % Positive orientable unit clauses : 47
% 0.64/0.42 % Positive unorientable unit clauses: 0
% 0.64/0.42 % Negative unit clauses : 18
% 0.64/0.42 % Non-unit-clauses : 43
% 0.64/0.42 % Current number of unprocessed clauses: 523
% 0.64/0.42 % ...number of literals in the above : 1784
% 0.64/0.42 % Current number of archived formulas : 0
% 0.64/0.42 % Current number of archived clauses : 5
% 0.64/0.42 % Clause-clause subsumption calls (NU) : 421
% 0.64/0.42 % Rec. Clause-clause subsumption calls : 245
% 0.64/0.42 % Non-unit clause-clause subsumptions : 26
% 0.64/0.42 % Unit Clause-clause subsumption calls : 59
% 0.64/0.42 % Rewrite failures with RHS unbound : 0
% 0.64/0.42 % BW rewrite match attempts : 36
% 0.64/0.42 % BW rewrite match successes : 3
% 0.64/0.42 % Condensation attempts : 217
% 0.64/0.42 % Condensation successes : 0
% 0.64/0.42 % Termbank termtop insertions : 87109
% 0.64/0.42 % Search garbage collected termcells : 19009
% 0.64/0.42
% 0.64/0.42 % -------------------------------------------------
% 0.64/0.42 % User time : 0.079 s
% 0.64/0.42 % System time : 0.013 s
% 0.64/0.42 % Total time : 0.093 s
% 0.64/0.42 % Maximum resident set size: 7656 pages
% 0.64/0.42
% 0.64/0.42 % -------------------------------------------------
% 0.64/0.42 % User time : 0.165 s
% 0.64/0.42 % System time : 0.038 s
% 0.64/0.42 % Total time : 0.203 s
% 0.64/0.42 % Maximum resident set size: 5888 pages
% 0.64/0.42 % E exiting
%------------------------------------------------------------------------------