TSTP Solution File: ITP057^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP057^1 : TPTP v8.2.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 22:16:06 EDT 2024
% Result : Theorem 0.54s 0.58s
% Output : CNFRefutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 29
% Syntax : Number of formulae : 43 ( 11 unt; 23 typ; 0 def)
% Number of atoms : 57 ( 6 equ; 0 cnn)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 288 ( 14 ~; 11 |; 0 &; 255 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 8 avg)
% Number of types : 9 ( 8 usr)
% Number of type conns : 53 ( 53 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 15 usr; 6 con; 0-6 aty)
% Number of variables : 18 ( 18 ^ 0 !; 0 ?; 18 :)
% 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_22,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_27,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_31,type,
isReceiverOf_p_v: p > message_p_v > $o ).
thf(decl_39,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_48,type,
last_c571238084t_unit: list_c1059388851t_unit > config256849571t_unit ).
thf(decl_59,type,
ord_less_eq_set_o: set_o > set_o > $o ).
thf(decl_61,type,
collect_o: ( $o > $o ) > set_o ).
thf(decl_67,type,
cMsg: config256849571t_unit ).
thf(decl_68,type,
c: config256849571t_unit ).
thf(decl_71,type,
exec2: list_c1059388851t_unit ).
thf(decl_72,type,
msg: message_p_v ).
thf(decl_73,type,
p2: p ).
thf(decl_74,type,
sends: p > s > messageValue_v > message_p_v > nat ).
thf(decl_75,type,
start: p > s ).
thf(decl_79,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/benchmark/theBenchmark.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/benchmark/theBenchmark.p',conj_0) ).
thf(fact_1_InitReachLastExec_H,axiom,
initReachable_p_s_v @ trans @ sends @ start @ ( last_c571238084t_unit @ exec2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_InitReachLastExec_H) ).
thf(fact_2_NewExec_I3_J,axiom,
( ( last_c571238084t_unit @ exec2 )
= c ),
file('/export/starexec/sandbox/benchmark/theBenchmark.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/benchmark/theBenchmark.p',fact_3_CMsg) ).
thf(fact_0_PisReceiverOf,axiom,
isReceiverOf_p_v @ p2 @ msg,
file('/export/starexec/sandbox/benchmark/theBenchmark.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,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_8,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)],[inference(assume_negation,[status(cth)],[conj_0])])]) ).
thf(c_0_9,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_7]) ).
thf(c_0_10,plain,
initReachable_p_s_v @ trans @ sends @ start @ ( last_c571238084t_unit @ exec2 ),
inference(split_conjunct,[status(thm)],[fact_1_InitReachLastExec_H]) ).
thf(c_0_11,plain,
( ( last_c571238084t_unit @ exec2 )
= c ),
inference(split_conjunct,[status(thm)],[fact_2_NewExec_I3_J]) ).
thf(c_0_12,plain,
steps_p_s_v @ trans @ sends @ ( last_c571238084t_unit @ exec2 ) @ msg @ cMsg,
inference(split_conjunct,[status(thm)],[fact_3_CMsg]) ).
thf(c_0_13,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_8]) ).
thf(c_0_14,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_9]) ).
thf(c_0_15,plain,
isReceiverOf_p_v @ p2 @ msg,
inference(split_conjunct,[status(thm)],[fact_0_PisReceiverOf]) ).
thf(c_0_16,plain,
initReachable_p_s_v @ trans @ sends @ start @ c,
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_17,plain,
steps_p_s_v @ trans @ sends @ c @ msg @ cMsg,
inference(rw,[status(thm)],[c_0_12,c_0_11]) ).
thf(c_0_18,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_13]) ).
thf(c_0_19,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_14,c_0_15]),c_0_11]),c_0_16]),c_0_11]),c_0_17])]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : ITP057^1 : TPTP v8.2.0. Released v7.5.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat May 18 17:39:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.21/0.47 Running higher-order theorem proving
% 0.21/0.47 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/benchmark/theBenchmark.p
% 0.54/0.58 # Version: 3.1.0-ho
% 0.54/0.58 # Preprocessing class: HSLSSMSMSSLNHSA.
% 0.54/0.58 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.58 # Starting ho_unfolding_8 with 900s (3) cores
% 0.54/0.58 # Starting new_bool_8 with 300s (1) cores
% 0.54/0.58 # Starting post_as_ho6 with 300s (1) cores
% 0.54/0.58 # Starting ho_unfolding_1 with 300s (1) cores
% 0.54/0.58 # Starting full_lambda_4 with 300s (1) cores
% 0.54/0.58 # Starting pre_casc_5 with 300s (1) cores
% 0.54/0.58 # ho_unfolding_8 with pid 5477 completed with status 0
% 0.54/0.58 # Result found by ho_unfolding_8
% 0.54/0.58 # Preprocessing class: HSLSSMSMSSLNHSA.
% 0.54/0.58 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.58 # Starting ho_unfolding_8 with 900s (3) cores
% 0.54/0.58 # No SInE strategy applied
% 0.54/0.58 # Search class: HGHSM-FSLM33-DHSFFFBN
% 0.54/0.58 # partial match(1): HGHSM-FSLM31-DHSFFFBN
% 0.54/0.58 # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 0.54/0.58 # Starting sh1l with 268s (1) cores
% 0.54/0.58 # Starting ho_unfolding_8 with 91s (1) cores
% 0.54/0.58 # Starting new_bool_8 with 157s (1) cores
% 0.54/0.58 # new_bool_8 with pid 5518 completed with status 0
% 0.54/0.58 # Result found by new_bool_8
% 0.54/0.58 # Preprocessing class: HSLSSMSMSSLNHSA.
% 0.54/0.58 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.58 # Starting ho_unfolding_8 with 900s (3) cores
% 0.54/0.58 # No SInE strategy applied
% 0.54/0.58 # Search class: HGHSM-FSLM33-DHSFFFBN
% 0.54/0.58 # partial match(1): HGHSM-FSLM31-DHSFFFBN
% 0.54/0.58 # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 0.54/0.58 # Starting sh1l with 268s (1) cores
% 0.54/0.58 # Starting ho_unfolding_8 with 91s (1) cores
% 0.54/0.58 # Starting new_bool_8 with 157s (1) cores
% 0.54/0.58 # Preprocessing time : 0.010 s
% 0.54/0.58 # Presaturation interreduction done
% 0.54/0.58
% 0.54/0.58 # Proof found!
% 0.54/0.58 # SZS status Theorem
% 0.54/0.58 # SZS output start CNFRefutation
% See solution above
% 0.54/0.58 # Parsed axioms : 424
% 0.54/0.58 # Removed by relevancy pruning/SinE : 0
% 0.54/0.58 # Initial clauses : 910
% 0.54/0.58 # Removed in clause preprocessing : 180
% 0.54/0.58 # Initial clauses in saturation : 730
% 0.54/0.58 # Processed clauses : 387
% 0.54/0.58 # ...of these trivial : 11
% 0.54/0.58 # ...subsumed : 109
% 0.54/0.58 # ...remaining for further processing : 266
% 0.54/0.58 # Other redundant clauses eliminated : 57
% 0.54/0.58 # Clauses deleted for lack of memory : 0
% 0.54/0.58 # Backward-subsumed : 7
% 0.54/0.58 # Backward-rewritten : 4
% 0.54/0.58 # Generated clauses : 55
% 0.54/0.58 # ...of the previous two non-redundant : 10
% 0.54/0.58 # ...aggressively subsumed : 0
% 0.54/0.58 # Contextual simplify-reflections : 4
% 0.54/0.58 # Paramodulations : 0
% 0.54/0.58 # Factorizations : 0
% 0.54/0.58 # NegExts : 0
% 0.54/0.58 # Equation resolutions : 57
% 0.54/0.58 # Disequality decompositions : 0
% 0.54/0.58 # Total rewrite steps : 90
% 0.54/0.58 # ...of those cached : 65
% 0.54/0.58 # Propositional unsat checks : 0
% 0.54/0.58 # Propositional check models : 0
% 0.54/0.58 # Propositional check unsatisfiable : 0
% 0.54/0.58 # Propositional clauses : 0
% 0.54/0.58 # Propositional clauses after purity: 0
% 0.54/0.58 # Propositional unsat core size : 0
% 0.54/0.58 # Propositional preprocessing time : 0.000
% 0.54/0.58 # Propositional encoding time : 0.000
% 0.54/0.58 # Propositional solver time : 0.000
% 0.54/0.58 # Success case prop preproc time : 0.000
% 0.54/0.58 # Success case prop encoding time : 0.000
% 0.54/0.58 # Success case prop solver time : 0.000
% 0.54/0.58 # Current number of processed clauses : 200
% 0.54/0.58 # Positive orientable unit clauses : 50
% 0.54/0.58 # Positive unorientable unit clauses: 0
% 0.54/0.58 # Negative unit clauses : 17
% 0.54/0.58 # Non-unit-clauses : 133
% 0.54/0.58 # Current number of unprocessed clauses: 353
% 0.54/0.58 # ...number of literals in the above : 1317
% 0.54/0.58 # Current number of archived formulas : 0
% 0.54/0.58 # Current number of archived clauses : 13
% 0.54/0.58 # Clause-clause subsumption calls (NU) : 4792
% 0.54/0.58 # Rec. Clause-clause subsumption calls : 3790
% 0.54/0.58 # Non-unit clause-clause subsumptions : 103
% 0.54/0.58 # Unit Clause-clause subsumption calls : 71
% 0.54/0.58 # Rewrite failures with RHS unbound : 0
% 0.54/0.58 # BW rewrite match attempts : 42
% 0.54/0.58 # BW rewrite match successes : 5
% 0.54/0.58 # Condensation attempts : 0
% 0.54/0.58 # Condensation successes : 0
% 0.54/0.58 # Termbank termtop insertions : 70874
% 0.54/0.58 # Search garbage collected termcells : 19010
% 0.54/0.58
% 0.54/0.58 # -------------------------------------------------
% 0.54/0.58 # User time : 0.059 s
% 0.54/0.58 # System time : 0.010 s
% 0.54/0.58 # Total time : 0.069 s
% 0.54/0.58 # Maximum resident set size: 5932 pages
% 0.54/0.58
% 0.54/0.58 # -------------------------------------------------
% 0.54/0.58 # User time : 0.113 s
% 0.54/0.58 # System time : 0.022 s
% 0.54/0.58 # Total time : 0.135 s
% 0.54/0.58 # Maximum resident set size: 2660 pages
% 0.54/0.58 % E---3.1 exiting
% 0.54/0.58 % E exiting
%------------------------------------------------------------------------------