TSTP Solution File: NUM924^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM924^2 : TPTP v8.2.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 : Tue May 21 01:17:47 EDT 2024
% Result : Theorem 0.56s 0.67s
% Output : CNFRefutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 28
% Syntax : Number of formulae : 56 ( 40 unt; 16 typ; 0 def)
% Number of atoms : 40 ( 31 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 233 ( 5 ~; 0 |; 0 &; 228 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 7 con; 0-2 aty)
% Number of variables : 33 ( 0 ^ 33 !; 0 ?; 33 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
int: $tType ).
thf(decl_sort2,type,
nat: $tType ).
thf(decl_25,type,
one_one_int: int ).
thf(decl_28,type,
plus_plus_int: int > int > int ).
thf(decl_31,type,
times_times_int: int > int > int ).
thf(decl_34,type,
zero_zero_int: int ).
thf(decl_39,type,
bit0: int > int ).
thf(decl_40,type,
bit1: int > int ).
thf(decl_42,type,
pls: int ).
thf(decl_43,type,
number_number_of_int: int > int ).
thf(decl_44,type,
number_number_of_nat: int > nat ).
thf(decl_46,type,
ord_less_int: int > int > $o ).
thf(decl_52,type,
power_power_int: int > nat > int ).
thf(decl_61,type,
m: int ).
thf(decl_63,type,
s: int ).
thf(decl_64,type,
t: int ).
thf(conj_0,conjecture,
ord_less_int @ ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int ) @ zero_zero_int,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
thf(fact_92_zmult__1,axiom,
! [X24: int] :
( ( times_times_int @ one_one_int @ X24 )
= X24 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_92_zmult__1) ).
thf(fact_34_number__of__is__id,axiom,
! [X23: int] :
( ( number_number_of_int @ X23 )
= X23 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_34_number__of__is__id) ).
thf(fact_181_zadd__0__right,axiom,
! [X24: int] :
( ( plus_plus_int @ X24 @ zero_zero_int )
= X24 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_181_zadd__0__right) ).
thf(fact_89_mult__Bit0,axiom,
! [X23: int,X26: int] :
( ( times_times_int @ ( bit0 @ X23 ) @ X26 )
= ( bit0 @ ( times_times_int @ X23 @ X26 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_89_mult__Bit0) ).
thf(fact_158_one__is__num__one,axiom,
( one_one_int
= ( number_number_of_int @ ( bit1 @ pls ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_158_one__is__num__one) ).
thf(fact_232_add__Bit0__Bit1,axiom,
! [X23: int,X26: int] :
( ( plus_plus_int @ ( bit0 @ X23 ) @ ( bit1 @ X26 ) )
= ( bit1 @ ( plus_plus_int @ X23 @ X26 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_232_add__Bit0__Bit1) ).
thf(fact_170_Pls__def,axiom,
pls = zero_zero_int,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_170_Pls__def) ).
thf(fact_132_zadd__commute,axiom,
! [X24: int,X22: int] :
( ( plus_plus_int @ X24 @ X22 )
= ( plus_plus_int @ X22 @ X24 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_132_zadd__commute) ).
thf(fact_362_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J,axiom,
! [X370: int] :
( ( times_times_int @ X370 @ zero_zero_int )
= zero_zero_int ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_362_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J) ).
thf(fact_3_t,axiom,
( ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int )
= ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ t ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3_t) ).
thf(fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096,axiom,
ord_less_int @ ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ t ) @ ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ zero_zero_int ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096) ).
thf(c_0_12,negated_conjecture,
~ ( ord_less_int @ ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int ) @ zero_zero_int ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_13,plain,
! [X2587: int] :
( ( times_times_int @ one_one_int @ X2587 )
= X2587 ),
inference(variable_rename,[status(thm)],[fact_92_zmult__1]) ).
thf(c_0_14,plain,
! [X2970: int] :
( ( number_number_of_int @ X2970 )
= X2970 ),
inference(variable_rename,[status(thm)],[fact_34_number__of__is__id]) ).
thf(c_0_15,plain,
! [X2359: int] :
( ( plus_plus_int @ X2359 @ zero_zero_int )
= X2359 ),
inference(variable_rename,[status(thm)],[fact_181_zadd__0__right]) ).
thf(c_0_16,negated_conjecture,
~ ( ord_less_int @ ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int ) @ zero_zero_int ),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
thf(c_0_17,plain,
! [X2789: int,X2790: int] :
( ( times_times_int @ ( bit0 @ X2789 ) @ X2790 )
= ( bit0 @ ( times_times_int @ X2789 @ X2790 ) ) ),
inference(variable_rename,[status(thm)],[fact_89_mult__Bit0]) ).
thf(c_0_18,plain,
! [X3: int] :
( ( times_times_int @ one_one_int @ X3 )
= X3 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_19,plain,
( one_one_int
= ( number_number_of_int @ ( bit1 @ pls ) ) ),
inference(split_conjunct,[status(thm)],[fact_158_one__is__num__one]) ).
thf(c_0_20,plain,
! [X3: int] :
( ( number_number_of_int @ X3 )
= X3 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_21,plain,
! [X2479: int,X2480: int] :
( ( plus_plus_int @ ( bit0 @ X2479 ) @ ( bit1 @ X2480 ) )
= ( bit1 @ ( plus_plus_int @ X2479 @ X2480 ) ) ),
inference(variable_rename,[status(thm)],[fact_232_add__Bit0__Bit1]) ).
thf(c_0_22,plain,
! [X3: int] :
( ( plus_plus_int @ X3 @ zero_zero_int )
= X3 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_23,plain,
pls = zero_zero_int,
inference(split_conjunct,[status(thm)],[fact_170_Pls__def]) ).
thf(c_0_24,plain,
! [X2447: int,X2448: int] :
( ( plus_plus_int @ X2447 @ X2448 )
= ( plus_plus_int @ X2448 @ X2447 ) ),
inference(variable_rename,[status(thm)],[fact_132_zadd__commute]) ).
thf(c_0_25,plain,
! [X2371: int] :
( ( times_times_int @ X2371 @ zero_zero_int )
= zero_zero_int ),
inference(variable_rename,[status(thm)],[fact_362_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J]) ).
thf(c_0_26,negated_conjecture,
~ ( ord_less_int @ ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int ) @ zero_zero_int ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_27,plain,
( ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int )
= ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ t ) ),
inference(split_conjunct,[status(thm)],[fact_3_t]) ).
thf(c_0_28,plain,
! [X3: int,X4: int] :
( ( times_times_int @ ( bit0 @ X3 ) @ X4 )
= ( bit0 @ ( times_times_int @ X3 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_29,plain,
! [X3: int] :
( ( times_times_int @ ( bit1 @ pls ) @ X3 )
= X3 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
thf(c_0_30,plain,
! [X3: int,X4: int] :
( ( plus_plus_int @ ( bit0 @ X3 ) @ ( bit1 @ X4 ) )
= ( bit1 @ ( plus_plus_int @ X3 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_31,plain,
! [X3: int] :
( ( plus_plus_int @ X3 @ pls )
= X3 ),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
thf(c_0_32,plain,
! [X4: int,X3: int] :
( ( plus_plus_int @ X3 @ X4 )
= ( plus_plus_int @ X4 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_33,plain,
! [X3: int] :
( ( times_times_int @ X3 @ zero_zero_int )
= zero_zero_int ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
thf(c_0_34,negated_conjecture,
~ ( ord_less_int @ ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int ) @ pls ),
inference(rw,[status(thm)],[c_0_26,c_0_23]) ).
thf(c_0_35,plain,
ord_less_int @ ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ t ) @ ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ zero_zero_int ),
inference(split_conjunct,[status(thm)],[fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096]) ).
thf(c_0_36,plain,
( ( times_times_int @ ( bit1 @ ( bit0 @ m ) ) @ t )
= ( plus_plus_int @ ( bit1 @ pls ) @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_20]),c_0_28]),c_0_28]),c_0_29]),c_0_19]),c_0_20]),c_0_30]),c_0_31]),c_0_32]),c_0_19]),c_0_20]) ).
thf(c_0_37,plain,
! [X3: int] :
( ( times_times_int @ X3 @ pls )
= pls ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_23]),c_0_23]) ).
thf(c_0_38,negated_conjecture,
~ ( ord_less_int @ ( plus_plus_int @ ( bit1 @ pls ) @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) @ pls ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_32]),c_0_19]),c_0_20]) ).
thf(c_0_39,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_20]),c_0_28]),c_0_28]),c_0_29]),c_0_19]),c_0_20]),c_0_30]),c_0_31]),c_0_36]),c_0_20]),c_0_28]),c_0_28]),c_0_29]),c_0_19]),c_0_20]),c_0_30]),c_0_31]),c_0_23]),c_0_37]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM924^2 : TPTP v8.2.0. Released v5.3.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n007.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 06:29:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/0.48 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.56/0.67 # Version: 3.1.0-ho
% 0.56/0.67 # Preprocessing class: HSLSSMSMSSSNFFN.
% 0.56/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.56/0.67 # Starting sh3 with 1500s (5) cores
% 0.56/0.67 # Starting lpo1_def_fix with 300s (1) cores
% 0.56/0.67 # Starting lpo8_s with 300s (1) cores
% 0.56/0.67 # Starting lpo1_lambda_fix with 300s (1) cores
% 0.56/0.67 # lpo1_def_fix with pid 26858 completed with status 0
% 0.56/0.67 # Result found by lpo1_def_fix
% 0.56/0.67 # Preprocessing class: HSLSSMSMSSSNFFN.
% 0.56/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.56/0.67 # Starting sh3 with 1500s (5) cores
% 0.56/0.67 # Starting lpo1_def_fix with 300s (1) cores
% 0.56/0.67 # SinE strategy is gf600_gu_R05_F100_L20000
% 0.56/0.67 # Search class: HGHSM-FSLM31-DFFFFFNN
% 0.56/0.67 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.56/0.67 # Starting sh3 with 181s (1) cores
% 0.56/0.67 # sh3 with pid 26868 completed with status 0
% 0.56/0.67 # Result found by sh3
% 0.56/0.67 # Preprocessing class: HSLSSMSMSSSNFFN.
% 0.56/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.56/0.67 # Starting sh3 with 1500s (5) cores
% 0.56/0.67 # Starting lpo1_def_fix with 300s (1) cores
% 0.56/0.67 # SinE strategy is gf600_gu_R05_F100_L20000
% 0.56/0.67 # Search class: HGHSM-FSLM31-DFFFFFNN
% 0.56/0.67 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.56/0.67 # Starting sh3 with 181s (1) cores
% 0.56/0.67 # Preprocessing time : 0.019 s
% 0.56/0.67 # Presaturation interreduction done
% 0.56/0.67
% 0.56/0.67 # Proof found!
% 0.56/0.67 # SZS status Theorem
% 0.56/0.67 # SZS output start CNFRefutation
% See solution above
% 0.56/0.67 # Parsed axioms : 745
% 0.56/0.67 # Removed by relevancy pruning/SinE : 50
% 0.56/0.67 # Initial clauses : 927
% 0.56/0.67 # Removed in clause preprocessing : 22
% 0.56/0.67 # Initial clauses in saturation : 905
% 0.56/0.67 # Processed clauses : 915
% 0.56/0.67 # ...of these trivial : 129
% 0.56/0.67 # ...subsumed : 138
% 0.56/0.67 # ...remaining for further processing : 647
% 0.56/0.67 # Other redundant clauses eliminated : 85
% 0.56/0.67 # Clauses deleted for lack of memory : 0
% 0.56/0.67 # Backward-subsumed : 8
% 0.56/0.67 # Backward-rewritten : 41
% 0.56/0.67 # Generated clauses : 68
% 0.56/0.67 # ...of the previous two non-redundant : 62
% 0.56/0.67 # ...aggressively subsumed : 0
% 0.56/0.67 # Contextual simplify-reflections : 2
% 0.56/0.67 # Paramodulations : 0
% 0.56/0.67 # Factorizations : 0
% 0.56/0.67 # NegExts : 0
% 0.56/0.67 # Equation resolutions : 85
% 0.56/0.67 # Disequality decompositions : 0
% 0.56/0.67 # Total rewrite steps : 1397
% 0.56/0.67 # ...of those cached : 1226
% 0.56/0.67 # Propositional unsat checks : 0
% 0.56/0.67 # Propositional check models : 0
% 0.56/0.67 # Propositional check unsatisfiable : 0
% 0.56/0.67 # Propositional clauses : 0
% 0.56/0.67 # Propositional clauses after purity: 0
% 0.56/0.67 # Propositional unsat core size : 0
% 0.56/0.67 # Propositional preprocessing time : 0.000
% 0.56/0.67 # Propositional encoding time : 0.000
% 0.56/0.67 # Propositional solver time : 0.000
% 0.56/0.67 # Success case prop preproc time : 0.000
% 0.56/0.67 # Success case prop encoding time : 0.000
% 0.56/0.67 # Success case prop solver time : 0.000
% 0.56/0.67 # Current number of processed clauses : 530
% 0.56/0.67 # Positive orientable unit clauses : 147
% 0.56/0.67 # Positive unorientable unit clauses: 28
% 0.56/0.67 # Negative unit clauses : 18
% 0.56/0.67 # Non-unit-clauses : 337
% 0.56/0.67 # Current number of unprocessed clauses: 52
% 0.56/0.67 # ...number of literals in the above : 98
% 0.56/0.67 # Current number of archived formulas : 0
% 0.56/0.67 # Current number of archived clauses : 49
% 0.56/0.67 # Clause-clause subsumption calls (NU) : 30015
% 0.56/0.67 # Rec. Clause-clause subsumption calls : 18233
% 0.56/0.67 # Non-unit clause-clause subsumptions : 99
% 0.56/0.67 # Unit Clause-clause subsumption calls : 503
% 0.56/0.67 # Rewrite failures with RHS unbound : 0
% 0.56/0.67 # BW rewrite match attempts : 252
% 0.56/0.67 # BW rewrite match successes : 156
% 0.56/0.67 # Condensation attempts : 0
% 0.56/0.67 # Condensation successes : 0
% 0.56/0.67 # Termbank termtop insertions : 72090
% 0.56/0.67 # Search garbage collected termcells : 13263
% 0.56/0.67
% 0.56/0.67 # -------------------------------------------------
% 0.56/0.67 # User time : 0.132 s
% 0.56/0.67 # System time : 0.016 s
% 0.56/0.67 # Total time : 0.148 s
% 0.56/0.67 # Maximum resident set size: 5868 pages
% 0.56/0.67
% 0.56/0.67 # -------------------------------------------------
% 0.56/0.67 # User time : 0.154 s
% 0.56/0.67 # System time : 0.020 s
% 0.56/0.67 # Total time : 0.174 s
% 0.56/0.67 # Maximum resident set size: 2948 pages
% 0.56/0.67 % E---3.1 exiting
% 0.56/0.67 % E exiting
%------------------------------------------------------------------------------