TSTP Solution File: ITP189^1 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : ITP189^1 : TPTP v8.2.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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 Jun 24 09:12:15 EDT 2024
% Result : Theorem 0.67s 0.80s
% Output : CNFRefutation 0.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 18 ( 0 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 123 ( 7 ~; 4 |; 0 &; 110 @)
% ( 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_24,type,
par: pi > pi > pi ).
thf(decl_26,type,
res: name > pi > pi ).
thf(decl_34,type,
late_FreeR: late_freeRes > pi > late_residual ).
thf(decl_37,type,
late_transitions: pi > late_residual > $o ).
thf(decl_48,type,
fresh_1641682979reeRes: name > late_freeRes > $o ).
thf(decl_101,type,
p: pi ).
thf(decl_102,type,
p2: pi ).
thf(decl_104,type,
q: pi ).
thf(decl_106,type,
alpha: late_freeRes ).
thf(decl_107,type,
x: name ).
thf(conj_0,conjecture,
late_transitions @ ( res @ x @ ( par @ p @ q ) ) @ ( late_FreeR @ alpha @ ( res @ x @ ( par @ p2 @ q ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.W1H7tn1a0B/E---3.1_19052.p',conj_0) ).
thf(fact_11_ResF,axiom,
! [X1: pi,X2: late_freeRes,X3: pi,X17: name] :
( ( late_transitions @ X1 @ ( late_FreeR @ X2 @ X3 ) )
=> ( ( fresh_1641682979reeRes @ X17 @ X2 )
=> ( late_transitions @ ( res @ X17 @ X1 ) @ ( late_FreeR @ X2 @ ( res @ X17 @ X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.W1H7tn1a0B/E---3.1_19052.p',fact_11_ResF) ).
thf(fact_1__092_060open_062P_A_092_060parallel_062_AQ_A_092_060longmapsto_062_A_092_060alpha_062_A_092_060prec_062_AP_H_A_092_060parallel_062_AQ_092_060close_062,axiom,
late_transitions @ ( par @ p @ q ) @ ( late_FreeR @ alpha @ ( par @ p2 @ q ) ),
file('/export/starexec/sandbox2/tmp/tmp.W1H7tn1a0B/E---3.1_19052.p',fact_1__092_060open_062P_A_092_060parallel_062_AQ_A_092_060longmapsto_062_A_092_060alpha_062_A_092_060prec_062_AP_H_A_092_060parallel_062_AQ_092_060close_062) ).
thf(fact_0__092_060open_062x_A_092_060sharp_062_A_092_060alpha_062_092_060close_062,axiom,
fresh_1641682979reeRes @ x @ alpha,
file('/export/starexec/sandbox2/tmp/tmp.W1H7tn1a0B/E---3.1_19052.p',fact_0__092_060open_062x_A_092_060sharp_062_A_092_060alpha_062_092_060close_062) ).
thf(c_0_4,negated_conjecture,
~ ( late_transitions @ ( res @ x @ ( par @ p @ q ) ) @ ( late_FreeR @ alpha @ ( res @ x @ ( par @ p2 @ q ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_5,negated_conjecture,
~ ( late_transitions @ ( res @ x @ ( par @ p @ q ) ) @ ( late_FreeR @ alpha @ ( res @ x @ ( par @ p2 @ q ) ) ) ),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
thf(c_0_6,plain,
! [X1832: pi,X1833: late_freeRes,X1834: pi,X1835: name] :
( ~ ( late_transitions @ X1832 @ ( late_FreeR @ X1833 @ X1834 ) )
| ~ ( fresh_1641682979reeRes @ X1835 @ X1833 )
| ( late_transitions @ ( res @ X1835 @ X1832 ) @ ( late_FreeR @ X1833 @ ( res @ X1835 @ X1834 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_11_ResF])])]) ).
thf(c_0_7,negated_conjecture,
~ ( late_transitions @ ( res @ x @ ( par @ p @ q ) ) @ ( late_FreeR @ alpha @ ( res @ x @ ( par @ p2 @ q ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
! [X3: pi,X1: pi,X8: name,X2: late_freeRes] :
( ( late_transitions @ ( res @ X8 @ X1 ) @ ( late_FreeR @ X2 @ ( res @ X8 @ X3 ) ) )
| ~ ( late_transitions @ X1 @ ( late_FreeR @ X2 @ X3 ) )
| ~ ( fresh_1641682979reeRes @ X8 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,plain,
late_transitions @ ( par @ p @ q ) @ ( late_FreeR @ alpha @ ( par @ p2 @ q ) ),
inference(split_conjunct,[status(thm)],[fact_1__092_060open_062P_A_092_060parallel_062_AQ_A_092_060longmapsto_062_A_092_060alpha_062_A_092_060prec_062_AP_H_A_092_060parallel_062_AQ_092_060close_062]) ).
thf(c_0_10,plain,
fresh_1641682979reeRes @ x @ alpha,
inference(split_conjunct,[status(thm)],[fact_0__092_060open_062x_A_092_060sharp_062_A_092_060alpha_062_092_060close_062]) ).
thf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : ITP189^1 : TPTP v8.2.0. Released v7.5.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n008.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jun 19 01:44:09 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.53 Running higher-order theorem proving
% 0.19/0.53 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.W1H7tn1a0B/E---3.1_19052.p
% 0.67/0.80 # Version: 3.2.0-ho
% 0.67/0.80 # Preprocessing class: HSLSSMSMSSSNSFA.
% 0.67/0.80 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.80 # Starting new_ho_10 with 900s (3) cores
% 0.67/0.80 # Starting sh2lt with 300s (1) cores
% 0.67/0.80 # Starting new_ho_5 with 300s (1) cores
% 0.67/0.80 # Starting full_lambda_5 with 300s (1) cores
% 0.67/0.80 # Starting sh9 with 300s (1) cores
% 0.67/0.80 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.67/0.80 # new_ho_10 with pid 19130 completed with status 0
% 0.67/0.80 # Result found by new_ho_10
% 0.67/0.80 # Preprocessing class: HSLSSMSMSSSNSFA.
% 0.67/0.80 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.80 # Starting new_ho_10 with 900s (3) cores
% 0.67/0.80 # No SInE strategy applied
% 0.67/0.80 # Search class: HGHSM-FSLM32-MSFFFFBN
% 0.67/0.80 # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 0.67/0.80 # Starting sh6 with 487s (1) cores
% 0.67/0.80 # Starting new_ho_10 with 91s (1) cores
% 0.67/0.80 # Starting sh2lt with 82s (1) cores
% 0.67/0.80 # new_ho_10 with pid 19137 completed with status 0
% 0.67/0.80 # Result found by new_ho_10
% 0.67/0.80 # Preprocessing class: HSLSSMSMSSSNSFA.
% 0.67/0.80 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.80 # Starting new_ho_10 with 900s (3) cores
% 0.67/0.80 # No SInE strategy applied
% 0.67/0.80 # Search class: HGHSM-FSLM32-MSFFFFBN
% 0.67/0.80 # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 0.67/0.80 # Starting sh6 with 487s (1) cores
% 0.67/0.80 # Starting new_ho_10 with 91s (1) cores
% 0.67/0.80 # Preprocessing time : 0.012 s
% 0.67/0.80 # Presaturation interreduction done
% 0.67/0.80
% 0.67/0.80 # Proof found!
% 0.67/0.80 # SZS status Theorem
% 0.67/0.80 # SZS output start CNFRefutation
% See solution above
% 0.67/0.80 # Parsed axioms : 434
% 0.67/0.80 # Removed by relevancy pruning/SinE : 0
% 0.67/0.80 # Initial clauses : 1034
% 0.67/0.80 # Removed in clause preprocessing : 146
% 0.67/0.80 # Initial clauses in saturation : 888
% 0.67/0.80 # Processed clauses : 1338
% 0.67/0.80 # ...of these trivial : 26
% 0.67/0.80 # ...subsumed : 108
% 0.67/0.80 # ...remaining for further processing : 1204
% 0.67/0.80 # Other redundant clauses eliminated : 136
% 0.67/0.80 # Clauses deleted for lack of memory : 0
% 0.67/0.80 # Backward-subsumed : 0
% 0.67/0.80 # Backward-rewritten : 15
% 0.67/0.80 # Generated clauses : 865
% 0.67/0.80 # ...of the previous two non-redundant : 583
% 0.67/0.80 # ...aggressively subsumed : 0
% 0.67/0.80 # Contextual simplify-reflections : 0
% 0.67/0.80 # Paramodulations : 608
% 0.67/0.80 # Factorizations : 2
% 0.67/0.80 # NegExts : 5
% 0.67/0.80 # Equation resolutions : 177
% 0.67/0.80 # Disequality decompositions : 0
% 0.67/0.80 # Total rewrite steps : 147
% 0.67/0.80 # ...of those cached : 63
% 0.67/0.80 # Propositional unsat checks : 0
% 0.67/0.80 # Propositional check models : 0
% 0.67/0.80 # Propositional check unsatisfiable : 0
% 0.67/0.80 # Propositional clauses : 0
% 0.67/0.80 # Propositional clauses after purity: 0
% 0.67/0.80 # Propositional unsat core size : 0
% 0.67/0.80 # Propositional preprocessing time : 0.000
% 0.67/0.80 # Propositional encoding time : 0.000
% 0.67/0.80 # Propositional solver time : 0.000
% 0.67/0.80 # Success case prop preproc time : 0.000
% 0.67/0.80 # Success case prop encoding time : 0.000
% 0.67/0.80 # Success case prop solver time : 0.000
% 0.67/0.80 # Current number of processed clauses : 355
% 0.67/0.80 # Positive orientable unit clauses : 89
% 0.67/0.80 # Positive unorientable unit clauses: 1
% 0.67/0.80 # Negative unit clauses : 60
% 0.67/0.80 # Non-unit-clauses : 205
% 0.67/0.80 # Current number of unprocessed clauses: 900
% 0.67/0.80 # ...number of literals in the above : 2997
% 0.67/0.80 # Current number of archived formulas : 0
% 0.67/0.80 # Current number of archived clauses : 819
% 0.67/0.80 # Clause-clause subsumption calls (NU) : 275887
% 0.67/0.80 # Rec. Clause-clause subsumption calls : 80767
% 0.67/0.80 # Non-unit clause-clause subsumptions : 69
% 0.67/0.80 # Unit Clause-clause subsumption calls : 3372
% 0.67/0.80 # Rewrite failures with RHS unbound : 0
% 0.67/0.80 # BW rewrite match attempts : 35
% 0.67/0.80 # BW rewrite match successes : 16
% 0.67/0.80 # Condensation attempts : 1338
% 0.67/0.80 # Condensation successes : 2
% 0.67/0.80 # Termbank termtop insertions : 92469
% 0.67/0.80 # Search garbage collected termcells : 17892
% 0.67/0.80
% 0.67/0.80 # -------------------------------------------------
% 0.67/0.80 # User time : 0.217 s
% 0.67/0.80 # System time : 0.019 s
% 0.67/0.80 # Total time : 0.236 s
% 0.67/0.80 # Maximum resident set size: 6140 pages
% 0.67/0.80
% 0.67/0.80 # -------------------------------------------------
% 0.67/0.80 # User time : 0.594 s
% 0.67/0.80 # System time : 0.034 s
% 0.67/0.80 # Total time : 0.628 s
% 0.67/0.80 # Maximum resident set size: 2660 pages
% 0.67/0.80 % E---3.1 exiting
% 0.67/0.80 % E exiting
%------------------------------------------------------------------------------