TSTP Solution File: ITP239^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP239^1 : TPTP v8.2.0. Released v8.1.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 May 20 22:17:21 EDT 2024
% Result : Theorem 60.48s 16.45s
% Output : CNFRefutation 60.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 24
% Syntax : Number of formulae : 36 ( 17 unt; 19 typ; 0 def)
% Number of atoms : 17 ( 8 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 142 ( 3 ~; 0 |; 0 &; 139 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 13 ( 13 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 15 usr; 8 con; 0-2 aty)
% Number of variables : 0 ( 0 ^ 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
nat: $tType ).
thf(decl_sort2,type,
num: $tType ).
thf(decl_sort3,type,
list_VEBT_VEBT: $tType ).
thf(decl_sort4,type,
vEBT_VEBT: $tType ).
thf(decl_208,type,
one_one_nat: nat ).
thf(decl_379,type,
nth_VEBT_VEBT: list_VEBT_VEBT > nat > vEBT_VEBT ).
thf(decl_405,type,
suc: nat > nat ).
thf(decl_476,type,
bit0: num > num ).
thf(decl_478,type,
one: num ).
thf(decl_486,type,
numeral_numeral_nat: num > nat ).
thf(decl_697,type,
divide_divide_nat: nat > nat > nat ).
thf(decl_842,type,
vEBT_VEBT_high: nat > nat > nat ).
thf(decl_844,type,
vEBT_VEBT_low: nat > nat > nat ).
thf(decl_861,type,
vEBT_vebt_member: vEBT_VEBT > nat > $o ).
thf(decl_918,type,
deg: nat ).
thf(decl_923,type,
na: nat ).
thf(decl_924,type,
pr: nat ).
thf(decl_927,type,
treeList: list_VEBT_VEBT ).
thf(decl_929,type,
za: nat ).
thf(conj_0,conjecture,
vEBT_vebt_member @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ) @ ( vEBT_VEBT_low @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
thf(fact_2_abe,axiom,
vEBT_vebt_member @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ) @ ( vEBT_VEBT_low @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2_abe) ).
thf(fact_1019_Suc__1,axiom,
( ( suc @ one_one_nat )
= ( numeral_numeral_nat @ ( bit0 @ one ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1019_Suc__1) ).
thf(fact_9__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062,axiom,
( ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) )
= na ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_9__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062) ).
thf(fact_0_True,axiom,
( ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) )
= pr ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_True) ).
thf(c_0_5,negated_conjecture,
~ ( vEBT_vebt_member @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ) @ ( vEBT_VEBT_low @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_6,plain,
vEBT_vebt_member @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ) @ ( vEBT_VEBT_low @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ),
inference(split_conjunct,[status(thm)],[fact_2_abe]) ).
thf(c_0_7,plain,
( ( suc @ one_one_nat )
= ( numeral_numeral_nat @ ( bit0 @ one ) ) ),
inference(split_conjunct,[status(thm)],[fact_1019_Suc__1]) ).
thf(c_0_8,plain,
( ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) )
= na ),
inference(split_conjunct,[status(thm)],[fact_9__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062]) ).
thf(c_0_9,plain,
( ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) )
= pr ),
inference(split_conjunct,[status(thm)],[fact_0_True]) ).
thf(c_0_10,negated_conjecture,
~ ( vEBT_vebt_member @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ) @ ( vEBT_VEBT_low @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_11,plain,
vEBT_vebt_member @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( suc @ one_one_nat ) ) ) ) @ ( vEBT_VEBT_low @ za @ ( divide_divide_nat @ deg @ ( suc @ one_one_nat ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_7]) ).
thf(c_0_12,plain,
( ( divide_divide_nat @ deg @ ( suc @ one_one_nat ) )
= na ),
inference(rw,[status(thm)],[c_0_8,c_0_7]) ).
thf(c_0_13,plain,
( ( vEBT_VEBT_high @ za @ na )
= pr ),
inference(rw,[status(thm)],[c_0_9,c_0_8]) ).
thf(c_0_14,negated_conjecture,
~ ( vEBT_vebt_member @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ za @ na ) ) @ ( vEBT_VEBT_low @ za @ na ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_8]),c_0_8]) ).
thf(c_0_15,plain,
vEBT_vebt_member @ ( nth_VEBT_VEBT @ treeList @ pr ) @ ( vEBT_VEBT_low @ za @ na ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_12]) ).
thf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_13]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : ITP239^1 : TPTP v8.2.0. Released v8.1.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n008.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Sat May 18 15:39:08 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.16/0.44 Running higher-order theorem proving
% 0.16/0.44 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
% 60.48/16.45 # Version: 3.1.0-ho
% 60.48/16.45 # partial match(1): HMLMSMSMSSLCHFA
% 60.48/16.45 # Preprocessing class: HMLMSMLMSSLCHFA.
% 60.48/16.45 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 60.48/16.45 # Starting new_ho_10 with 1495s (5) cores
% 60.48/16.45 # Starting sh5l with 299s (1) cores
% 60.48/16.45 # Starting new_bool_1 with 299s (1) cores
% 60.48/16.45 # Starting new_bool_2 with 299s (1) cores
% 60.48/16.45 # new_bool_2 with pid 23310 completed with status 0
% 60.48/16.45 # Result found by new_bool_2
% 60.48/16.45 # partial match(1): HMLMSMSMSSLCHFA
% 60.48/16.45 # Preprocessing class: HMLMSMLMSSLCHFA.
% 60.48/16.45 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 60.48/16.45 # Starting new_ho_10 with 1495s (5) cores
% 60.48/16.45 # Starting sh5l with 299s (1) cores
% 60.48/16.45 # Starting new_bool_1 with 299s (1) cores
% 60.48/16.45 # Starting new_bool_2 with 299s (1) cores
% 60.48/16.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 60.48/16.45 # Search class: HGHSM-SMLM32-DHFFFFBN
% 60.48/16.45 # partial match(1): HGHSM-SMLM32-DHFFFSBN
% 60.48/16.45 # Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 60.48/16.45 # Starting new_ho_10 with 179s (1) cores
% 60.48/16.45 # new_ho_10 with pid 23538 completed with status 0
% 60.48/16.45 # Result found by new_ho_10
% 60.48/16.45 # partial match(1): HMLMSMSMSSLCHFA
% 60.48/16.45 # Preprocessing class: HMLMSMLMSSLCHFA.
% 60.48/16.45 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 60.48/16.45 # Starting new_ho_10 with 1495s (5) cores
% 60.48/16.45 # Starting sh5l with 299s (1) cores
% 60.48/16.45 # Starting new_bool_1 with 299s (1) cores
% 60.48/16.45 # Starting new_bool_2 with 299s (1) cores
% 60.48/16.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 60.48/16.45 # Search class: HGHSM-SMLM32-DHFFFFBN
% 60.48/16.45 # partial match(1): HGHSM-SMLM32-DHFFFSBN
% 60.48/16.45 # Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 60.48/16.45 # Starting new_ho_10 with 179s (1) cores
% 60.48/16.45 # Preprocessing time : 0.227 s
% 60.48/16.45 # Presaturation interreduction done
% 60.48/16.45
% 60.48/16.45 # Proof found!
% 60.48/16.45 # SZS status Theorem
% 60.48/16.45 # SZS output start CNFRefutation
% See solution above
% 60.48/16.45 # Parsed axioms : 11244
% 60.48/16.45 # Removed by relevancy pruning/SinE : 7135
% 60.48/16.45 # Initial clauses : 11379
% 60.48/16.45 # Removed in clause preprocessing : 2021
% 60.48/16.45 # Initial clauses in saturation : 9358
% 60.48/16.45 # Processed clauses : 11623
% 60.48/16.45 # ...of these trivial : 343
% 60.48/16.45 # ...subsumed : 3140
% 60.48/16.45 # ...remaining for further processing : 8139
% 60.48/16.45 # Other redundant clauses eliminated : 2959
% 60.48/16.45 # Clauses deleted for lack of memory : 0
% 60.48/16.45 # Backward-subsumed : 56
% 60.48/16.45 # Backward-rewritten : 111
% 60.48/16.45 # Generated clauses : 2591
% 60.48/16.45 # ...of the previous two non-redundant : 2224
% 60.48/16.45 # ...aggressively subsumed : 0
% 60.48/16.45 # Contextual simplify-reflections : 124
% 60.48/16.45 # Paramodulations : 7
% 60.48/16.45 # Factorizations : 0
% 60.48/16.45 # NegExts : 0
% 60.48/16.45 # Equation resolutions : 2959
% 60.48/16.45 # Disequality decompositions : 0
% 60.48/16.45 # Total rewrite steps : 19745
% 60.48/16.45 # ...of those cached : 18904
% 60.48/16.45 # Propositional unsat checks : 0
% 60.48/16.45 # Propositional check models : 0
% 60.48/16.45 # Propositional check unsatisfiable : 0
% 60.48/16.45 # Propositional clauses : 0
% 60.48/16.45 # Propositional clauses after purity: 0
% 60.48/16.45 # Propositional unsat core size : 0
% 60.48/16.45 # Propositional preprocessing time : 0.000
% 60.48/16.45 # Propositional encoding time : 0.000
% 60.48/16.45 # Propositional solver time : 0.000
% 60.48/16.45 # Success case prop preproc time : 0.000
% 60.48/16.45 # Success case prop encoding time : 0.000
% 60.48/16.45 # Success case prop solver time : 0.000
% 60.48/16.45 # Current number of processed clauses : 44
% 60.48/16.45 # Positive orientable unit clauses : 14
% 60.48/16.45 # Positive unorientable unit clauses: 0
% 60.48/16.45 # Negative unit clauses : 30
% 60.48/16.45 # Non-unit-clauses : 0
% 60.48/16.45 # Current number of unprocessed clauses: 5304
% 60.48/16.45 # ...number of literals in the above : 18665
% 60.48/16.45 # Current number of archived formulas : 0
% 60.48/16.45 # Current number of archived clauses : 5512
% 60.48/16.45 # Clause-clause subsumption calls (NU) : 31619701
% 60.48/16.45 # Rec. Clause-clause subsumption calls : 1813090
% 60.48/16.45 # Non-unit clause-clause subsumptions : 3104
% 60.48/16.45 # Unit Clause-clause subsumption calls : 36107
% 60.48/16.45 # Rewrite failures with RHS unbound : 0
% 60.48/16.45 # BW rewrite match attempts : 892
% 60.48/16.45 # BW rewrite match successes : 287
% 60.48/16.45 # Condensation attempts : 11624
% 60.48/16.45 # Condensation successes : 48
% 60.48/16.45 # Termbank termtop insertions : 3446453
% 60.48/16.45 # Search garbage collected termcells : 200300
% 60.48/16.45
% 60.48/16.45 # -------------------------------------------------
% 60.48/16.45 # User time : 14.551 s
% 60.48/16.45 # System time : 0.130 s
% 60.48/16.45 # Total time : 14.681 s
% 60.48/16.45 # Maximum resident set size: 51172 pages
% 60.48/16.45
% 60.48/16.45 # -------------------------------------------------
% 60.48/16.45 # User time : 15.603 s
% 60.48/16.45 # System time : 0.168 s
% 60.48/16.45 # Total time : 15.770 s
% 60.48/16.45 # Maximum resident set size: 27552 pages
% 60.48/16.45 % E---3.1 exiting
% 60.48/16.46 % E exiting
%------------------------------------------------------------------------------