TSTP Solution File: ITP060^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP060^1 : TPTP v8.2.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:07 EDT 2024
% Result : Theorem 0.18s 0.57s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 16
% Syntax : Number of formulae : 26 ( 8 unt; 12 typ; 0 def)
% Number of atoms : 20 ( 7 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 123 ( 8 ~; 4 |; 0 &; 109 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 12 ( 0 ^ 12 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
config256849571t_unit: $tType ).
thf(decl_sort2,type,
nat: $tType ).
thf(decl_sort3,type,
list_c1059388851t_unit: $tType ).
thf(decl_26,type,
minus_minus_nat: nat > nat > nat ).
thf(decl_27,type,
one_one_nat: nat ).
thf(decl_35,type,
nth_co1649820636t_unit: list_c1059388851t_unit > nat > config256849571t_unit ).
thf(decl_37,type,
suc: nat > nat ).
thf(decl_38,type,
size_s1406904903t_unit: list_c1059388851t_unit > nat ).
thf(decl_40,type,
ord_less_nat: nat > nat > $o ).
thf(decl_42,type,
fe: nat > list_c1059388851t_unit ).
thf(decl_44,type,
index: nat ).
thf(decl_48,type,
n1: nat ).
thf(conj_0,conjecture,
( ( nth_co1649820636t_unit @ ( fe @ ( suc @ index ) ) @ ( minus_minus_nat @ n1 @ one_one_nat ) )
= ( nth_co1649820636t_unit @ ( fe @ index ) @ ( minus_minus_nat @ n1 @ one_one_nat ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
thf(fact_1_SameCfgOnLow,axiom,
! [X1: nat] :
( ( ord_less_nat @ X1 @ ( size_s1406904903t_unit @ ( fe @ index ) ) )
=> ( ( nth_co1649820636t_unit @ ( fe @ index ) @ X1 )
= ( nth_co1649820636t_unit @ ( fe @ ( suc @ index ) ) @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1_SameCfgOnLow) ).
thf(fact_154_less__imp__diff__less,axiom,
! [X25: nat,X4: nat,X2: nat] :
( ( ord_less_nat @ X25 @ X4 )
=> ( ord_less_nat @ ( minus_minus_nat @ X25 @ X2 ) @ X4 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_154_less__imp__diff__less) ).
thf(fact_0_Occ3_H,axiom,
ord_less_nat @ n1 @ ( size_s1406904903t_unit @ ( fe @ index ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_Occ3_H) ).
thf(c_0_4,negated_conjecture,
( ( nth_co1649820636t_unit @ ( fe @ ( suc @ index ) ) @ ( minus_minus_nat @ n1 @ one_one_nat ) )
!= ( nth_co1649820636t_unit @ ( fe @ index ) @ ( minus_minus_nat @ n1 @ one_one_nat ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_5,negated_conjecture,
( ( nth_co1649820636t_unit @ ( fe @ ( suc @ index ) ) @ ( minus_minus_nat @ n1 @ one_one_nat ) )
!= ( nth_co1649820636t_unit @ ( fe @ index ) @ ( minus_minus_nat @ n1 @ one_one_nat ) ) ),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
thf(c_0_6,plain,
! [X609: nat] :
( ~ ( ord_less_nat @ X609 @ ( size_s1406904903t_unit @ ( fe @ index ) ) )
| ( ( nth_co1649820636t_unit @ ( fe @ index ) @ X609 )
= ( nth_co1649820636t_unit @ ( fe @ ( suc @ index ) ) @ X609 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_1_SameCfgOnLow])])]) ).
thf(c_0_7,negated_conjecture,
( ( nth_co1649820636t_unit @ ( fe @ ( suc @ index ) ) @ ( minus_minus_nat @ n1 @ one_one_nat ) )
!= ( nth_co1649820636t_unit @ ( fe @ index ) @ ( minus_minus_nat @ n1 @ one_one_nat ) ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
! [X1: nat] :
( ( ( nth_co1649820636t_unit @ ( fe @ index ) @ X1 )
= ( nth_co1649820636t_unit @ ( fe @ ( suc @ index ) ) @ X1 ) )
| ~ ( ord_less_nat @ X1 @ ( size_s1406904903t_unit @ ( fe @ index ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,plain,
! [X686: nat,X687: nat,X688: nat] :
( ~ ( ord_less_nat @ X686 @ X687 )
| ( ord_less_nat @ ( minus_minus_nat @ X686 @ X688 ) @ X687 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_154_less__imp__diff__less])])]) ).
thf(c_0_10,negated_conjecture,
~ ( ord_less_nat @ ( minus_minus_nat @ n1 @ one_one_nat ) @ ( size_s1406904903t_unit @ ( fe @ index ) ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_11,plain,
! [X1: nat,X3: nat,X2: nat] :
( ( ord_less_nat @ ( minus_minus_nat @ X1 @ X3 ) @ X2 )
| ~ ( ord_less_nat @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_12,plain,
ord_less_nat @ n1 @ ( size_s1406904903t_unit @ ( fe @ index ) ),
inference(split_conjunct,[status(thm)],[fact_0_Occ3_H]) ).
thf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : ITP060^1 : TPTP v8.2.0. Released v7.5.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n026.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Sat May 18 17:40:53 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.46 Running higher-order theorem proving
% 0.18/0.46 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/benchmark/theBenchmark.p
% 0.18/0.57 # Version: 3.1.0-ho
% 0.18/0.57 # Preprocessing class: HSLSSMSMSSSNHFA.
% 0.18/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.57 # Starting new_ho_10 with 1500s (5) cores
% 0.18/0.57 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.18/0.57 # Starting full_lambda_6 with 300s (1) cores
% 0.18/0.57 # Starting full_lambda_9 with 300s (1) cores
% 0.18/0.57 # full_lambda_6 with pid 8468 completed with status 0
% 0.18/0.57 # Result found by full_lambda_6
% 0.18/0.57 # Preprocessing class: HSLSSMSMSSSNHFA.
% 0.18/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.57 # Starting new_ho_10 with 1500s (5) cores
% 0.18/0.57 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.18/0.57 # Starting full_lambda_6 with 300s (1) cores
% 0.18/0.57 # SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.18/0.57 # Search class: HGHSM-FSLM31-DHFFFSBC
% 0.18/0.57 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.57 # Starting new_ho_10 with 163s (1) cores
% 0.18/0.57 # new_ho_10 with pid 8470 completed with status 0
% 0.18/0.57 # Result found by new_ho_10
% 0.18/0.57 # Preprocessing class: HSLSSMSMSSSNHFA.
% 0.18/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.57 # Starting new_ho_10 with 1500s (5) cores
% 0.18/0.57 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.18/0.57 # Starting full_lambda_6 with 300s (1) cores
% 0.18/0.57 # SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.18/0.57 # Search class: HGHSM-FSLM31-DHFFFSBC
% 0.18/0.57 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.57 # Starting new_ho_10 with 163s (1) cores
% 0.18/0.57 # Preprocessing time : 0.007 s
% 0.18/0.57 # Presaturation interreduction done
% 0.18/0.57
% 0.18/0.57 # Proof found!
% 0.18/0.57 # SZS status Theorem
% 0.18/0.57 # SZS output start CNFRefutation
% See solution above
% 0.18/0.57 # Parsed axioms : 279
% 0.18/0.57 # Removed by relevancy pruning/SinE : 46
% 0.18/0.57 # Initial clauses : 379
% 0.18/0.57 # Removed in clause preprocessing : 11
% 0.18/0.57 # Initial clauses in saturation : 368
% 0.18/0.57 # Processed clauses : 595
% 0.18/0.57 # ...of these trivial : 12
% 0.18/0.57 # ...subsumed : 100
% 0.18/0.57 # ...remaining for further processing : 483
% 0.18/0.57 # Other redundant clauses eliminated : 70
% 0.18/0.57 # Clauses deleted for lack of memory : 0
% 0.18/0.57 # Backward-subsumed : 0
% 0.18/0.57 # Backward-rewritten : 3
% 0.18/0.57 # Generated clauses : 1121
% 0.18/0.57 # ...of the previous two non-redundant : 942
% 0.18/0.57 # ...aggressively subsumed : 0
% 0.18/0.57 # Contextual simplify-reflections : 1
% 0.18/0.57 # Paramodulations : 1034
% 0.18/0.57 # Factorizations : 0
% 0.18/0.57 # NegExts : 0
% 0.18/0.57 # Equation resolutions : 71
% 0.18/0.57 # Disequality decompositions : 0
% 0.18/0.57 # Total rewrite steps : 275
% 0.18/0.57 # ...of those cached : 210
% 0.18/0.57 # Propositional unsat checks : 0
% 0.18/0.57 # Propositional check models : 0
% 0.18/0.57 # Propositional check unsatisfiable : 0
% 0.18/0.57 # Propositional clauses : 0
% 0.18/0.57 # Propositional clauses after purity: 0
% 0.18/0.57 # Propositional unsat core size : 0
% 0.18/0.57 # Propositional preprocessing time : 0.000
% 0.18/0.57 # Propositional encoding time : 0.000
% 0.18/0.57 # Propositional solver time : 0.000
% 0.18/0.57 # Success case prop preproc time : 0.000
% 0.18/0.57 # Success case prop encoding time : 0.000
% 0.18/0.57 # Success case prop solver time : 0.000
% 0.18/0.57 # Current number of processed clauses : 161
% 0.18/0.57 # Positive orientable unit clauses : 68
% 0.18/0.57 # Positive unorientable unit clauses: 1
% 0.18/0.57 # Negative unit clauses : 18
% 0.18/0.57 # Non-unit-clauses : 74
% 0.18/0.57 # Current number of unprocessed clauses: 974
% 0.18/0.57 # ...number of literals in the above : 2422
% 0.18/0.57 # Current number of archived formulas : 0
% 0.18/0.57 # Current number of archived clauses : 289
% 0.18/0.57 # Clause-clause subsumption calls (NU) : 14314
% 0.18/0.57 # Rec. Clause-clause subsumption calls : 6323
% 0.18/0.57 # Non-unit clause-clause subsumptions : 41
% 0.18/0.57 # Unit Clause-clause subsumption calls : 167
% 0.18/0.57 # Rewrite failures with RHS unbound : 0
% 0.18/0.57 # BW rewrite match attempts : 51
% 0.18/0.57 # BW rewrite match successes : 15
% 0.18/0.57 # Condensation attempts : 595
% 0.18/0.57 # Condensation successes : 0
% 0.18/0.57 # Termbank termtop insertions : 51511
% 0.18/0.57 # Search garbage collected termcells : 8237
% 0.18/0.57
% 0.18/0.57 # -------------------------------------------------
% 0.18/0.57 # User time : 0.082 s
% 0.18/0.57 # System time : 0.011 s
% 0.18/0.57 # Total time : 0.093 s
% 0.18/0.57 # Maximum resident set size: 3580 pages
% 0.18/0.57
% 0.18/0.57 # -------------------------------------------------
% 0.18/0.57 # User time : 0.093 s
% 0.18/0.57 # System time : 0.012 s
% 0.18/0.57 # Total time : 0.105 s
% 0.18/0.57 # Maximum resident set size: 2136 pages
% 0.18/0.57 % E---3.1 exiting
% 0.18/0.57 % E exiting
%------------------------------------------------------------------------------