TSTP Solution File: ALG262^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ALG262^2 : TPTP v8.2.0. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 18:05:56 EDT 2024
% Result : Theorem 0.19s 0.56s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 21 ( 8 unt; 8 typ; 0 def)
% Number of atoms : 20 ( 4 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 70 ( 5 ~; 4 |; 1 &; 53 @)
% ( 7 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 38 ( 38 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 4 con; 0-3 aty)
% Number of variables : 21 ( 5 ^ 12 !; 4 ?; 21 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
term: $tType ).
thf(decl_sort2,type,
subst: $tType ).
thf(decl_26,type,
id: subst ).
thf(decl_64,type,
hoasinduction_lem0: $o ).
thf(decl_106,type,
hoasinduction_p_and_p_prime: ( subst > term > subst > $o ) > ( term > $o ) > $o ).
thf(decl_114,type,
hoasinduction_lem0_lthm: $o ).
thf(decl_144,type,
epred1_0: subst > term > subst > $o ).
thf(decl_145,type,
esk1_1: ( term > $o ) > term ).
thf(hoasinduction_p_and_p_prime,axiom,
( hoasinduction_p_and_p_prime
= ( ^ [X14: subst > term > subst > $o,X9: term > $o] :
! [X10: term] :
( ( X9 @ X10 )
<=> ( X14 @ id @ X10 @ id ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/ALG003^0.ax',hoasinduction_p_and_p_prime) ).
thf(hoasinduction_lem0,axiom,
( hoasinduction_lem0
<=> ! [X15: subst > term > subst > $o] :
? [X9: term > $o] : ( hoasinduction_p_and_p_prime @ X15 @ X9 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/ALG003^0.ax',hoasinduction_lem0) ).
thf(hoasinduction_lem0_lthm,axiom,
( hoasinduction_lem0_lthm
<=> hoasinduction_lem0 ),
file('/export/starexec/sandbox/benchmark/Axioms/ALG003^0.ax',hoasinduction_lem0_lthm) ).
thf(thm,conjecture,
hoasinduction_lem0_lthm,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).
thf(c_0_4,plain,
( hoasinduction_p_and_p_prime
= ( ^ [Z0: subst > term > subst > $o,Z1: term > $o] :
! [X10: term] :
( ( Z1 @ X10 )
<=> ( Z0 @ id @ X10 @ id ) ) ) ),
inference(fof_simplification,[status(thm)],[hoasinduction_p_and_p_prime]) ).
thf(c_0_5,axiom,
( hoasinduction_lem0
= ( ! [X15: subst > term > subst > $o] :
? [X9: term > $o] :
! [X1037: term] :
( ( X9 @ X1037 )
<=> ( X15 @ id @ X1037 @ id ) ) ) ),
inference(apply_def,[status(thm)],[hoasinduction_lem0,c_0_4]) ).
thf(c_0_6,axiom,
( hoasinduction_lem0_lthm
= ( ! [X2664: subst > term > subst > $o] :
? [X2665: term > $o] :
! [X2666: term] :
( ( X2665 @ X2666 )
<=> ( X2664 @ id @ X2666 @ id ) ) ) ),
inference(apply_def,[status(thm)],[hoasinduction_lem0_lthm,c_0_5]) ).
thf(c_0_7,negated_conjecture,
~ ! [X3373: subst > term > subst > $o] :
? [X3374: term > $o] :
! [X3375: term] :
( ( X3374 @ X3375 )
<=> ( X3373 @ id @ X3375 @ id ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thm]),c_0_6]) ).
thf(c_0_8,negated_conjecture,
! [X3389: term > $o] :
( ( ~ ( X3389 @ ( esk1_1 @ X3389 ) )
| ~ ( epred1_0 @ id @ ( esk1_1 @ X3389 ) @ id ) )
& ( ( X3389 @ ( esk1_1 @ X3389 ) )
| ( epred1_0 @ id @ ( esk1_1 @ X3389 ) @ id ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
thf(c_0_9,negated_conjecture,
! [X6: term > $o] :
( ( X6 @ ( esk1_1 @ X6 ) )
| ( epred1_0 @ id @ ( esk1_1 @ X6 ) @ id ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_10,negated_conjecture,
! [X6: term > $o] :
( ~ ( X6 @ ( esk1_1 @ X6 ) )
| ~ ( epred1_0 @ id @ ( esk1_1 @ X6 ) @ id ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_11,negated_conjecture,
( epred1_0 @ id
@ ( esk1_1
@ ^ [Z0: term] : ( epred1_0 @ id @ Z0 @ id ) )
@ id ),
inference(ef,[status(thm)],[c_0_9]) ).
thf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : ALG262^2 : TPTP v8.2.0. Bugfixed v5.2.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n006.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 23:53:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.51 Running higher-order theorem proving
% 0.19/0.51 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.19/0.56 # Version: 3.1.0-ho
% 0.19/0.56 # Preprocessing class: HSMMSLSSLLLNHFA.
% 0.19/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.56 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.19/0.56 # Starting post_as_ho1 with 300s (1) cores
% 0.19/0.56 # Starting post_as_ho5 with 300s (1) cores
% 0.19/0.56 # Starting post_as_ho10 with 300s (1) cores
% 0.19/0.56 # post_as_ho10 with pid 28965 completed with status 0
% 0.19/0.56 # Result found by post_as_ho10
% 0.19/0.56 # Preprocessing class: HSMMSLSSLLLNHFA.
% 0.19/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.56 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.19/0.56 # Starting post_as_ho1 with 300s (1) cores
% 0.19/0.56 # Starting post_as_ho5 with 300s (1) cores
% 0.19/0.56 # Starting post_as_ho10 with 300s (1) cores
% 0.19/0.56 # No SInE strategy applied
% 0.19/0.56 # Search class: HGHSS-FFSF32-SHFMMMBN
% 0.19/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.56 # Starting post_as_ho10 with 150s (1) cores
% 0.19/0.56 # post_as_ho10 with pid 28978 completed with status 0
% 0.19/0.56 # Result found by post_as_ho10
% 0.19/0.56 # Preprocessing class: HSMMSLSSLLLNHFA.
% 0.19/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.56 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.19/0.56 # Starting post_as_ho1 with 300s (1) cores
% 0.19/0.56 # Starting post_as_ho5 with 300s (1) cores
% 0.19/0.56 # Starting post_as_ho10 with 300s (1) cores
% 0.19/0.56 # No SInE strategy applied
% 0.19/0.56 # Search class: HGHSS-FFSF32-SHFMMMBN
% 0.19/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.56 # Starting post_as_ho10 with 150s (1) cores
% 0.19/0.56 # Preprocessing time : 0.002 s
% 0.19/0.56 # Presaturation interreduction done
% 0.19/0.56
% 0.19/0.56 # Proof found!
% 0.19/0.56 # SZS status Theorem
% 0.19/0.56 # SZS output start CNFRefutation
% See solution above
% 0.19/0.56 # Parsed axioms : 238
% 0.19/0.56 # Removed by relevancy pruning/SinE : 0
% 0.19/0.56 # Initial clauses : 128
% 0.19/0.56 # Removed in clause preprocessing : 124
% 0.19/0.56 # Initial clauses in saturation : 4
% 0.19/0.56 # Processed clauses : 14
% 0.19/0.56 # ...of these trivial : 0
% 0.19/0.56 # ...subsumed : 2
% 0.19/0.56 # ...remaining for further processing : 12
% 0.19/0.56 # Other redundant clauses eliminated : 0
% 0.19/0.56 # Clauses deleted for lack of memory : 0
% 0.19/0.56 # Backward-subsumed : 0
% 0.19/0.56 # Backward-rewritten : 0
% 0.19/0.56 # Generated clauses : 19
% 0.19/0.56 # ...of the previous two non-redundant : 13
% 0.19/0.56 # ...aggressively subsumed : 0
% 0.19/0.56 # Contextual simplify-reflections : 0
% 0.19/0.56 # Paramodulations : 7
% 0.19/0.56 # Factorizations : 2
% 0.19/0.56 # NegExts : 0
% 0.19/0.56 # Equation resolutions : 0
% 0.19/0.56 # Disequality decompositions : 0
% 0.19/0.56 # Total rewrite steps : 1
% 0.19/0.56 # ...of those cached : 0
% 0.19/0.56 # Propositional unsat checks : 0
% 0.19/0.56 # Propositional check models : 0
% 0.19/0.56 # Propositional check unsatisfiable : 0
% 0.19/0.56 # Propositional clauses : 0
% 0.19/0.56 # Propositional clauses after purity: 0
% 0.19/0.56 # Propositional unsat core size : 0
% 0.19/0.56 # Propositional preprocessing time : 0.000
% 0.19/0.56 # Propositional encoding time : 0.000
% 0.19/0.56 # Propositional solver time : 0.000
% 0.19/0.56 # Success case prop preproc time : 0.000
% 0.19/0.56 # Success case prop encoding time : 0.000
% 0.19/0.56 # Success case prop solver time : 0.000
% 0.19/0.56 # Current number of processed clauses : 8
% 0.19/0.56 # Positive orientable unit clauses : 2
% 0.19/0.56 # Positive unorientable unit clauses: 2
% 0.19/0.56 # Negative unit clauses : 1
% 0.19/0.56 # Non-unit-clauses : 3
% 0.19/0.56 # Current number of unprocessed clauses: 7
% 0.19/0.56 # ...number of literals in the above : 8
% 0.19/0.56 # Current number of archived formulas : 0
% 0.19/0.56 # Current number of archived clauses : 4
% 0.19/0.56 # Clause-clause subsumption calls (NU) : 3
% 0.19/0.56 # Rec. Clause-clause subsumption calls : 3
% 0.19/0.56 # Non-unit clause-clause subsumptions : 1
% 0.19/0.56 # Unit Clause-clause subsumption calls : 1
% 0.19/0.56 # Rewrite failures with RHS unbound : 0
% 0.19/0.56 # BW rewrite match attempts : 5
% 0.19/0.56 # BW rewrite match successes : 0
% 0.19/0.56 # Condensation attempts : 0
% 0.19/0.56 # Condensation successes : 0
% 0.19/0.56 # Termbank termtop insertions : 27210
% 0.19/0.56 # Search garbage collected termcells : 1662
% 0.19/0.56
% 0.19/0.56 # -------------------------------------------------
% 0.19/0.56 # User time : 0.026 s
% 0.19/0.56 # System time : 0.012 s
% 0.19/0.56 # Total time : 0.039 s
% 0.19/0.56 # Maximum resident set size: 5788 pages
% 0.19/0.56
% 0.19/0.56 # -------------------------------------------------
% 0.19/0.56 # User time : 0.036 s
% 0.19/0.56 # System time : 0.015 s
% 0.19/0.56 # Total time : 0.050 s
% 0.19/0.56 # Maximum resident set size: 2080 pages
% 0.19/0.56 % E---3.1 exiting
% 0.56/0.57 % E exiting
%------------------------------------------------------------------------------