TSTP Solution File: ITP225^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP225^1 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:17:07 EDT 2024
% Result : Theorem 35.08s 9.81s
% Output : CNFRefutation 35.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 10
% Syntax : Number of formulae : 19 ( 10 unt; 6 typ; 0 def)
% Number of atoms : 18 ( 10 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 33 ( 9 ~; 3 |; 1 &; 19 @)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 6 ( 0 ^ 6 !; 0 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
nat: $tType ).
thf(decl_394,type,
zero_zero_nat: nat ).
thf(decl_588,type,
suc: nat > nat ).
thf(decl_696,type,
ord_less_nat: nat > nat > $o ).
thf(decl_1019,type,
m: nat ).
thf(decl_1020,type,
na: nat ).
thf(fact_21_Zero__not__Suc,axiom,
! [X3: nat] :
( zero_zero_nat
!= ( suc @ X3 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_21_Zero__not__Suc) ).
thf(conj_0,conjecture,
ord_less_nat @ zero_zero_nat @ m,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
thf(fact_0_bot__nat__0_Onot__eq__extremum,axiom,
! [X1: nat] :
( ( X1 != zero_zero_nat )
<=> ( ord_less_nat @ zero_zero_nat @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_bot__nat__0_Onot__eq__extremum) ).
thf(fact_4__C3_Ohyps_C_I3_J,axiom,
( m
= ( suc @ na ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_4__C3_Ohyps_C_I3_J) ).
thf(c_0_4,plain,
! [X21150: nat] :
( zero_zero_nat
!= ( suc @ X21150 ) ),
inference(variable_rename,[status(thm)],[fact_21_Zero__not__Suc]) ).
thf(c_0_5,negated_conjecture,
~ ( ord_less_nat @ zero_zero_nat @ m ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_6,plain,
! [X20689: nat] :
( ( ( X20689 = zero_zero_nat )
| ( ord_less_nat @ zero_zero_nat @ X20689 ) )
& ( ~ ( ord_less_nat @ zero_zero_nat @ X20689 )
| ( X20689 != zero_zero_nat ) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_0_bot__nat__0_Onot__eq__extremum])]) ).
thf(c_0_7,plain,
! [X1: nat] :
( zero_zero_nat
!= ( suc @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,plain,
( m
= ( suc @ na ) ),
inference(split_conjunct,[status(thm)],[fact_4__C3_Ohyps_C_I3_J]) ).
thf(c_0_9,negated_conjecture,
~ ( ord_less_nat @ zero_zero_nat @ m ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_10,plain,
! [X1: nat] :
( ( X1 = zero_zero_nat )
| ( ord_less_nat @ zero_zero_nat @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_11,plain,
m != zero_zero_nat,
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : ITP225^1 : TPTP v8.2.0. Released v8.1.0.
% 0.09/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n017.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:18:53 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.46 Running higher-order theorem proving
% 0.18/0.46 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
% 35.08/9.81 # Version: 3.1.0-ho
% 35.08/9.81 # partial match(2): HMLMSMSMSSLCHFA
% 35.08/9.81 # Preprocessing class: HMLLSMLMSSLCHFA.
% 35.08/9.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.08/9.81 # Starting new_ho_10 with 1500s (5) cores
% 35.08/9.81 # Starting sh5l with 300s (1) cores
% 35.08/9.81 # Starting new_bool_1 with 300s (1) cores
% 35.08/9.81 # Starting new_bool_2 with 300s (1) cores
% 35.08/9.81 # new_bool_2 with pid 8048 completed with status 0
% 35.08/9.81 # Result found by new_bool_2
% 35.08/9.81 # partial match(2): HMLMSMSMSSLCHFA
% 35.08/9.81 # Preprocessing class: HMLLSMLMSSLCHFA.
% 35.08/9.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.08/9.81 # Starting new_ho_10 with 1500s (5) cores
% 35.08/9.81 # Starting sh5l with 300s (1) cores
% 35.08/9.81 # Starting new_bool_1 with 300s (1) cores
% 35.08/9.81 # Starting new_bool_2 with 300s (1) cores
% 35.08/9.81 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 35.08/9.81 # Search class: HGHSM-SMLM32-DHFFFSBN
% 35.08/9.81 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 35.08/9.81 # Starting new_ho_10 with 181s (1) cores
% 35.08/9.81 # new_ho_10 with pid 8049 completed with status 0
% 35.08/9.81 # Result found by new_ho_10
% 35.08/9.81 # partial match(2): HMLMSMSMSSLCHFA
% 35.08/9.81 # Preprocessing class: HMLLSMLMSSLCHFA.
% 35.08/9.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.08/9.81 # Starting new_ho_10 with 1500s (5) cores
% 35.08/9.81 # Starting sh5l with 300s (1) cores
% 35.08/9.81 # Starting new_bool_1 with 300s (1) cores
% 35.08/9.81 # Starting new_bool_2 with 300s (1) cores
% 35.08/9.81 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 35.08/9.81 # Search class: HGHSM-SMLM32-DHFFFSBN
% 35.08/9.81 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 35.08/9.81 # Starting new_ho_10 with 181s (1) cores
% 35.08/9.81 # Preprocessing time : 0.143 s
% 35.08/9.81 # Presaturation interreduction done
% 35.08/9.81
% 35.08/9.81 # Proof found!
% 35.08/9.81 # SZS status Theorem
% 35.08/9.81 # SZS output start CNFRefutation
% See solution above
% 35.08/9.81 # Parsed axioms : 11266
% 35.08/9.81 # Removed by relevancy pruning/SinE : 8682
% 35.08/9.81 # Initial clauses : 7130
% 35.08/9.81 # Removed in clause preprocessing : 1854
% 35.08/9.81 # Initial clauses in saturation : 5276
% 35.08/9.81 # Processed clauses : 5888
% 35.08/9.81 # ...of these trivial : 192
% 35.08/9.81 # ...subsumed : 1109
% 35.08/9.81 # ...remaining for further processing : 4587
% 35.08/9.81 # Other redundant clauses eliminated : 1168
% 35.08/9.81 # Clauses deleted for lack of memory : 0
% 35.08/9.81 # Backward-subsumed : 22
% 35.08/9.81 # Backward-rewritten : 43
% 35.08/9.81 # Generated clauses : 819
% 35.08/9.81 # ...of the previous two non-redundant : 584
% 35.08/9.81 # ...aggressively subsumed : 0
% 35.08/9.81 # Contextual simplify-reflections : 74
% 35.08/9.81 # Paramodulations : 5
% 35.08/9.81 # Factorizations : 0
% 35.08/9.81 # NegExts : 0
% 35.08/9.81 # Equation resolutions : 1168
% 35.08/9.81 # Disequality decompositions : 0
% 35.08/9.81 # Total rewrite steps : 4058
% 35.08/9.81 # ...of those cached : 3700
% 35.08/9.81 # Propositional unsat checks : 0
% 35.08/9.81 # Propositional check models : 0
% 35.08/9.81 # Propositional check unsatisfiable : 0
% 35.08/9.81 # Propositional clauses : 0
% 35.08/9.81 # Propositional clauses after purity: 0
% 35.08/9.81 # Propositional unsat core size : 0
% 35.08/9.81 # Propositional preprocessing time : 0.000
% 35.08/9.81 # Propositional encoding time : 0.000
% 35.08/9.81 # Propositional solver time : 0.000
% 35.08/9.81 # Success case prop preproc time : 0.000
% 35.08/9.81 # Success case prop encoding time : 0.000
% 35.08/9.81 # Success case prop solver time : 0.000
% 35.08/9.81 # Current number of processed clauses : 32
% 35.08/9.81 # Positive orientable unit clauses : 9
% 35.08/9.81 # Positive unorientable unit clauses: 0
% 35.08/9.81 # Negative unit clauses : 22
% 35.08/9.81 # Non-unit-clauses : 1
% 35.08/9.81 # Current number of unprocessed clauses: 3649
% 35.08/9.81 # ...number of literals in the above : 14726
% 35.08/9.81 # Current number of archived formulas : 0
% 35.08/9.81 # Current number of archived clauses : 3742
% 35.08/9.81 # Clause-clause subsumption calls (NU) : 10104467
% 35.08/9.81 # Rec. Clause-clause subsumption calls : 639248
% 35.08/9.81 # Non-unit clause-clause subsumptions : 1033
% 35.08/9.81 # Unit Clause-clause subsumption calls : 13336
% 35.08/9.81 # Rewrite failures with RHS unbound : 0
% 35.08/9.81 # BW rewrite match attempts : 452
% 35.08/9.81 # BW rewrite match successes : 117
% 35.08/9.81 # Condensation attempts : 5888
% 35.08/9.81 # Condensation successes : 0
% 35.08/9.81 # Termbank termtop insertions : 2466182
% 35.08/9.81 # Search garbage collected termcells : 151339
% 35.08/9.81
% 35.08/9.81 # -------------------------------------------------
% 35.08/9.81 # User time : 8.385 s
% 35.08/9.81 # System time : 0.109 s
% 35.08/9.81 # Total time : 8.494 s
% 35.08/9.81 # Maximum resident set size: 37872 pages
% 35.08/9.81
% 35.08/9.81 # -------------------------------------------------
% 35.08/9.81 # User time : 9.045 s
% 35.08/9.81 # System time : 0.128 s
% 35.08/9.81 # Total time : 9.173 s
% 35.08/9.81 # Maximum resident set size: 22580 pages
% 35.08/9.81 % E---3.1 exiting
% 35.08/9.81 % E exiting
%------------------------------------------------------------------------------