TSTP Solution File: ITP276^3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP276^3 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:55 EDT 2024
% Result : ContradictoryAxioms 4.50s 2.16s
% Output : CNFRefutation 4.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 15
% Syntax : Number of formulae : 24 ( 14 unt; 10 typ; 0 def)
% Number of atoms : 14 ( 7 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 34 ( 4 ~; 0 |; 0 &; 30 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 4 ( 0 ^ 4 !; 0 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
nat: $tType ).
thf(decl_sort2,type,
num: $tType ).
thf(decl_290,type,
one_one_nat: nat ).
thf(decl_330,type,
zero_zero_nat: nat ).
thf(decl_693,type,
suc: nat > nat ).
thf(decl_781,type,
bit0: num > num ).
thf(decl_783,type,
one: num ).
thf(decl_791,type,
numeral_numeral_nat: num > nat ).
thf(decl_852,type,
ord_less_eq_nat: nat > nat > $o ).
thf(decl_1295,type,
deg: nat ).
thf(fact_103_Suc__n__not__le__n,axiom,
! [X173: nat] :
~ ( ord_less_eq_nat @ ( suc @ X173 ) @ X173 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_103_Suc__n__not__le__n) ).
thf(fact_75__C1_C_I2_J,axiom,
( deg
= ( suc @ zero_zero_nat ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_75__C1_C_I2_J) ).
thf(fact_1158_One__nat__def,axiom,
( one_one_nat
= ( suc @ zero_zero_nat ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1158_One__nat__def) ).
thf(fact_2986_a0,axiom,
ord_less_eq_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ deg,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2986_a0) ).
thf(fact_3212_Suc__1,axiom,
( ( suc @ one_one_nat )
= ( numeral_numeral_nat @ ( bit0 @ one ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3212_Suc__1) ).
thf(c_0_5,plain,
! [X173: nat] :
~ ( ord_less_eq_nat @ ( suc @ X173 ) @ X173 ),
inference(fof_simplification,[status(thm)],[fact_103_Suc__n__not__le__n]) ).
thf(c_0_6,plain,
( deg
= ( suc @ zero_zero_nat ) ),
inference(split_conjunct,[status(thm)],[fact_75__C1_C_I2_J]) ).
thf(c_0_7,plain,
( one_one_nat
= ( suc @ zero_zero_nat ) ),
inference(split_conjunct,[status(thm)],[fact_1158_One__nat__def]) ).
thf(c_0_8,plain,
! [X25627: nat] :
~ ( ord_less_eq_nat @ ( suc @ X25627 ) @ X25627 ),
inference(variable_rename,[status(thm)],[c_0_5]) ).
thf(c_0_9,plain,
ord_less_eq_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ deg,
inference(split_conjunct,[status(thm)],[fact_2986_a0]) ).
thf(c_0_10,plain,
( ( suc @ one_one_nat )
= ( numeral_numeral_nat @ ( bit0 @ one ) ) ),
inference(split_conjunct,[status(thm)],[fact_3212_Suc__1]) ).
thf(c_0_11,plain,
deg = one_one_nat,
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_12,plain,
! [X3: nat] :
~ ( ord_less_eq_nat @ ( suc @ X3 ) @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_13,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : ITP276^3 : TPTP v8.2.0. Released v8.1.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n025.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sat May 18 18:30:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.50 Running higher-order theorem proving
% 0.22/0.50 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
% 4.50/2.16 # Version: 3.1.0-ho
% 4.50/2.16 # partial match(3): HMLMSMSMSSLCHFA
% 4.50/2.16 # Preprocessing class: HMLLSLLMSSLCHFA.
% 4.50/2.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.50/2.16 # Starting new_ho_10 with 1500s (5) cores
% 4.50/2.16 # Starting sh5l with 300s (1) cores
% 4.50/2.16 # Starting new_bool_1 with 300s (1) cores
% 4.50/2.16 # Starting new_bool_2 with 300s (1) cores
% 4.50/2.16 # new_bool_2 with pid 2658 completed with status 0
% 4.50/2.16 # Result found by new_bool_2
% 4.50/2.16 # partial match(3): HMLMSMSMSSLCHFA
% 4.50/2.16 # Preprocessing class: HMLLSLLMSSLCHFA.
% 4.50/2.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.50/2.16 # Starting new_ho_10 with 1500s (5) cores
% 4.50/2.16 # Starting sh5l with 300s (1) cores
% 4.50/2.16 # Starting new_bool_1 with 300s (1) cores
% 4.50/2.16 # Starting new_bool_2 with 300s (1) cores
% 4.50/2.16 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.50/2.16 # Search class: HGHSM-SMLM32-DHFFFFBN
% 4.50/2.16 # partial match(1): HGHSM-SMLM32-DHFFFSBN
% 4.50/2.16 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 4.50/2.16 # Starting new_ho_10 with 181s (1) cores
% 4.50/2.16 # new_ho_10 with pid 2659 completed with status 0
% 4.50/2.16 # Result found by new_ho_10
% 4.50/2.16 # partial match(3): HMLMSMSMSSLCHFA
% 4.50/2.16 # Preprocessing class: HMLLSLLMSSLCHFA.
% 4.50/2.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.50/2.16 # Starting new_ho_10 with 1500s (5) cores
% 4.50/2.16 # Starting sh5l with 300s (1) cores
% 4.50/2.16 # Starting new_bool_1 with 300s (1) cores
% 4.50/2.16 # Starting new_bool_2 with 300s (1) cores
% 4.50/2.16 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.50/2.16 # Search class: HGHSM-SMLM32-DHFFFFBN
% 4.50/2.16 # partial match(1): HGHSM-SMLM32-DHFFFSBN
% 4.50/2.16 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 4.50/2.16 # Starting new_ho_10 with 181s (1) cores
% 4.50/2.16 # Preprocessing time : 0.128 s
% 4.50/2.16 # Presaturation interreduction done
% 4.50/2.16
% 4.50/2.16 # Proof found!
% 4.50/2.16 # SZS status ContradictoryAxioms
% 4.50/2.16 # SZS output start CNFRefutation
% See solution above
% 4.50/2.16 # Parsed axioms : 11045
% 4.50/2.16 # Removed by relevancy pruning/SinE : 8568
% 4.50/2.16 # Initial clauses : 6998
% 4.50/2.16 # Removed in clause preprocessing : 1910
% 4.50/2.16 # Initial clauses in saturation : 5088
% 4.50/2.16 # Processed clauses : 266
% 4.50/2.16 # ...of these trivial : 24
% 4.50/2.16 # ...subsumed : 66
% 4.50/2.16 # ...remaining for further processing : 175
% 4.50/2.16 # Other redundant clauses eliminated : 59
% 4.50/2.16 # Clauses deleted for lack of memory : 0
% 4.50/2.16 # Backward-subsumed : 1
% 4.50/2.16 # Backward-rewritten : 4
% 4.50/2.16 # Generated clauses : 59
% 4.50/2.16 # ...of the previous two non-redundant : 49
% 4.50/2.16 # ...aggressively subsumed : 0
% 4.50/2.16 # Contextual simplify-reflections : 0
% 4.50/2.16 # Paramodulations : 0
% 4.50/2.16 # Factorizations : 0
% 4.50/2.16 # NegExts : 0
% 4.50/2.16 # Equation resolutions : 59
% 4.50/2.16 # Disequality decompositions : 0
% 4.50/2.16 # Total rewrite steps : 62
% 4.50/2.16 # ...of those cached : 31
% 4.50/2.16 # Propositional unsat checks : 0
% 4.50/2.16 # Propositional check models : 0
% 4.50/2.16 # Propositional check unsatisfiable : 0
% 4.50/2.16 # Propositional clauses : 0
% 4.50/2.16 # Propositional clauses after purity: 0
% 4.50/2.16 # Propositional unsat core size : 0
% 4.50/2.16 # Propositional preprocessing time : 0.000
% 4.50/2.16 # Propositional encoding time : 0.000
% 4.50/2.16 # Propositional solver time : 0.000
% 4.50/2.16 # Success case prop preproc time : 0.000
% 4.50/2.16 # Success case prop encoding time : 0.000
% 4.50/2.16 # Success case prop solver time : 0.000
% 4.50/2.16 # Current number of processed clauses : 111
% 4.50/2.16 # Positive orientable unit clauses : 67
% 4.50/2.16 # Positive unorientable unit clauses: 0
% 4.50/2.16 # Negative unit clauses : 35
% 4.50/2.16 # Non-unit-clauses : 9
% 4.50/2.16 # Current number of unprocessed clauses: 4871
% 4.50/2.16 # ...number of literals in the above : 18291
% 4.50/2.16 # Current number of archived formulas : 0
% 4.50/2.16 # Current number of archived clauses : 5
% 4.50/2.16 # Clause-clause subsumption calls (NU) : 269
% 4.50/2.16 # Rec. Clause-clause subsumption calls : 257
% 4.50/2.16 # Non-unit clause-clause subsumptions : 5
% 4.50/2.16 # Unit Clause-clause subsumption calls : 465
% 4.50/2.16 # Rewrite failures with RHS unbound : 0
% 4.50/2.16 # BW rewrite match attempts : 9
% 4.50/2.16 # BW rewrite match successes : 4
% 4.50/2.16 # Condensation attempts : 266
% 4.50/2.16 # Condensation successes : 0
% 4.50/2.16 # Termbank termtop insertions : 629463
% 4.50/2.16 # Search garbage collected termcells : 172118
% 4.50/2.16
% 4.50/2.16 # -------------------------------------------------
% 4.50/2.16 # User time : 0.786 s
% 4.50/2.16 # System time : 0.067 s
% 4.50/2.16 # Total time : 0.853 s
% 4.50/2.16 # Maximum resident set size: 42772 pages
% 4.50/2.16
% 4.50/2.16 # -------------------------------------------------
% 4.50/2.16 # User time : 1.540 s
% 4.50/2.16 # System time : 0.090 s
% 4.50/2.16 # Total time : 1.630 s
% 4.50/2.16 # Maximum resident set size: 26628 pages
% 4.50/2.16 % E---3.1 exiting
% 4.50/2.16 % E exiting
%------------------------------------------------------------------------------