TSTP Solution File: NUM924_2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM924_2 : TPTP v8.1.2. Released v5.3.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:57:56 EDT 2023
% Result : Theorem 0.47s 0.71s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 24
% Syntax : Number of formulae : 49 ( 35 unt; 14 typ; 0 def)
% Number of atoms : 35 ( 25 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 12 ( 8 >; 4 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn; 23 !; 0 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_25,type,
one_one_int: int ).
tff(decl_28,type,
plus_plus_int: ( int * int ) > int ).
tff(decl_31,type,
times_times_int: ( int * int ) > int ).
tff(decl_34,type,
zero_zero_int: int ).
tff(decl_39,type,
bit0: int > int ).
tff(decl_40,type,
bit1: int > int ).
tff(decl_42,type,
pls: int ).
tff(decl_43,type,
number_number_of_int: int > int ).
tff(decl_44,type,
number_number_of_nat: int > nat ).
tff(decl_46,type,
ord_less_int: ( int * int ) > $o ).
tff(decl_52,type,
power_power_int: ( int * nat ) > int ).
tff(decl_61,type,
m: int ).
tff(decl_63,type,
s: int ).
tff(decl_64,type,
t: int ).
tff(fact_34_number__of__is__id,axiom,
! [X20: int] : ( number_number_of_int(X20) = X20 ),
file('/export/starexec/sandbox/tmp/tmp.MF3zCcO9VH/E---3.1_17003.p',fact_34_number__of__is__id) ).
tff(fact_438_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J,axiom,
! [X500: int] : ( times_times_int(X500,X500) = power_power_int(X500,number_number_of_nat(bit0(bit1(pls)))) ),
file('/export/starexec/sandbox/tmp/tmp.MF3zCcO9VH/E---3.1_17003.p',fact_438_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J) ).
tff(fact_158_one__is__num__one,axiom,
one_one_int = number_number_of_int(bit1(pls)),
file('/export/starexec/sandbox/tmp/tmp.MF3zCcO9VH/E---3.1_17003.p',fact_158_one__is__num__one) ).
tff(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/tmp/tmp.MF3zCcO9VH/E---3.1_17003.p',conj_0) ).
tff(fact_35_zmult__commute,axiom,
! [X21: int,X19: int] : ( times_times_int(X21,X19) = times_times_int(X19,X21) ),
file('/export/starexec/sandbox/tmp/tmp.MF3zCcO9VH/E---3.1_17003.p',fact_35_zmult__commute) ).
tff(fact_132_zadd__commute,axiom,
! [X21: int,X19: int] : ( plus_plus_int(X21,X19) = plus_plus_int(X19,X21) ),
file('/export/starexec/sandbox/tmp/tmp.MF3zCcO9VH/E---3.1_17003.p',fact_132_zadd__commute) ).
tff(fact_362_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J,axiom,
! [X377: int] : ( times_times_int(X377,zero_zero_int) = zero_zero_int ),
file('/export/starexec/sandbox/tmp/tmp.MF3zCcO9VH/E---3.1_17003.p',fact_362_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J) ).
tff(fact_170_Pls__def,axiom,
pls = zero_zero_int,
file('/export/starexec/sandbox/tmp/tmp.MF3zCcO9VH/E---3.1_17003.p',fact_170_Pls__def) ).
tff(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/tmp/tmp.MF3zCcO9VH/E---3.1_17003.p',fact_3_t) ).
tff(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/tmp/tmp.MF3zCcO9VH/E---3.1_17003.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) ).
tff(c_0_10,plain,
! [X1195: int] : ( number_number_of_int(X1195) = X1195 ),
inference(variable_rename,[status(thm)],[fact_34_number__of__is__id]) ).
tff(c_0_11,plain,
! [X1136: int] : ( times_times_int(X1136,X1136) = power_power_int(X1136,number_number_of_nat(bit0(bit1(pls)))) ),
inference(variable_rename,[status(thm)],[fact_438_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J]) ).
tcf(c_0_12,plain,
one_one_int = number_number_of_int(bit1(pls)),
inference(split_conjunct,[status(thm)],[fact_158_one__is__num__one]) ).
tcf(c_0_13,plain,
! [X3: int] : number_number_of_int(X3) = X3,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tff(c_0_14,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])]) ).
tff(c_0_15,plain,
! [X1211: int,X1212: int] : ( times_times_int(X1211,X1212) = times_times_int(X1212,X1211) ),
inference(variable_rename,[status(thm)],[fact_35_zmult__commute]) ).
tff(c_0_16,plain,
! [X1023: int,X1024: int] : ( plus_plus_int(X1023,X1024) = plus_plus_int(X1024,X1023) ),
inference(variable_rename,[status(thm)],[fact_132_zadd__commute]) ).
tcf(c_0_17,plain,
! [X3: int] : times_times_int(X3,X3) = power_power_int(X3,number_number_of_nat(bit0(bit1(pls)))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tcf(c_0_18,plain,
bit1(pls) = one_one_int,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
tff(c_0_19,plain,
! [X973: int] : ( times_times_int(X973,zero_zero_int) = zero_zero_int ),
inference(variable_rename,[status(thm)],[fact_362_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J]) ).
tcf(c_0_20,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_14]) ).
tcf(c_0_21,plain,
pls = zero_zero_int,
inference(split_conjunct,[status(thm)],[fact_170_Pls__def]) ).
tcf(c_0_22,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]) ).
tcf(c_0_23,plain,
! [X4: int,X3: int] : times_times_int(X3,X4) = times_times_int(X4,X3),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
tcf(c_0_24,plain,
! [X4: int,X3: int] : plus_plus_int(X3,X4) = plus_plus_int(X4,X3),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
tcf(c_0_25,plain,
! [X3: int] : times_times_int(X3,X3) = power_power_int(X3,number_number_of_nat(bit0(one_one_int))),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
tcf(c_0_26,plain,
! [X3: int] : times_times_int(X3,zero_zero_int) = zero_zero_int,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
tcf(c_0_27,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_20,c_0_21]) ).
tcf(c_0_28,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]) ).
tcf(c_0_29,plain,
times_times_int(t,plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(one_one_int))))) = plus_plus_int(one_one_int,times_times_int(s,s)),
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_22,c_0_18]),c_0_13]),c_0_23]),c_0_24]),c_0_23]),c_0_24]),c_0_18]),c_0_25]) ).
tcf(c_0_30,plain,
! [X3: int] : times_times_int(X3,pls) = pls,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_21]),c_0_21]) ).
tcf(c_0_31,negated_conjecture,
~ ord_less_int(plus_plus_int(one_one_int,power_power_int(s,number_number_of_nat(bit0(one_one_int)))),pls),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_24]),c_0_18]) ).
tcf(c_0_32,plain,
ord_less_int(plus_plus_int(one_one_int,times_times_int(s,s)),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)],[inference(rw,[status(thm)],[c_0_28,c_0_18]),c_0_13]),c_0_23]),c_0_24]),c_0_23]),c_0_29]),c_0_18]),c_0_13]),c_0_23]),c_0_24]),c_0_21]),c_0_30]) ).
tcf(c_0_33,negated_conjecture,
~ ord_less_int(plus_plus_int(one_one_int,times_times_int(s,s)),pls),
inference(rw,[status(thm)],[c_0_31,c_0_25]) ).
cnf(c_0_34,plain,
$false,
inference(sr,[status(thm)],[c_0_32,c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.20 % Problem : NUM924_2 : TPTP v8.1.2. Released v5.3.0.
% 0.12/0.21 % Command : run_E %s %d THM
% 0.20/0.42 % Computer : n017.cluster.edu
% 0.20/0.42 % Model : x86_64 x86_64
% 0.20/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.42 % Memory : 8042.1875MB
% 0.20/0.42 % OS : Linux 3.10.0-693.el7.x86_64
% 0.20/0.42 % CPULimit : 2400
% 0.20/0.42 % WCLimit : 300
% 0.20/0.42 % DateTime : Mon Oct 2 13:33:26 EDT 2023
% 0.20/0.42 % CPUTime :
% 0.47/0.64 Running first-order theorem proving
% 0.47/0.64 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.MF3zCcO9VH/E---3.1_17003.p
% 0.47/0.71 # Version: 3.1pre001
% 0.47/0.71 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.47/0.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.47/0.71 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.47/0.71 # Starting new_bool_3 with 300s (1) cores
% 0.47/0.71 # Starting new_bool_1 with 300s (1) cores
% 0.47/0.71 # Starting sh5l with 300s (1) cores
% 0.47/0.71 # new_bool_1 with pid 17086 completed with status 0
% 0.47/0.71 # Result found by new_bool_1
% 0.47/0.71 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.47/0.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.47/0.71 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.47/0.71 # Starting new_bool_3 with 300s (1) cores
% 0.47/0.71 # Starting new_bool_1 with 300s (1) cores
% 0.47/0.71 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.47/0.71 # Search class: FGHSM-FSLM31-DFFFFFNN
% 0.47/0.71 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.47/0.71 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.47/0.71 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 17088 completed with status 0
% 0.47/0.71 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.47/0.71 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.47/0.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.47/0.71 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.47/0.71 # Starting new_bool_3 with 300s (1) cores
% 0.47/0.71 # Starting new_bool_1 with 300s (1) cores
% 0.47/0.71 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.47/0.71 # Search class: FGHSM-FSLM31-DFFFFFNN
% 0.47/0.71 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.47/0.71 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.47/0.71 # Preprocessing time : 0.006 s
% 0.47/0.71 # Presaturation interreduction done
% 0.47/0.71
% 0.47/0.71 # Proof found!
% 0.47/0.71 # SZS status Theorem
% 0.47/0.71 # SZS output start CNFRefutation
% See solution above
% 0.47/0.71 # Parsed axioms : 745
% 0.47/0.71 # Removed by relevancy pruning/SinE : 187
% 0.47/0.71 # Initial clauses : 738
% 0.47/0.71 # Removed in clause preprocessing : 20
% 0.47/0.71 # Initial clauses in saturation : 718
% 0.47/0.71 # Processed clauses : 817
% 0.47/0.71 # ...of these trivial : 134
% 0.47/0.71 # ...subsumed : 117
% 0.47/0.71 # ...remaining for further processing : 565
% 0.47/0.71 # Other redundant clauses eliminated : 68
% 0.47/0.71 # Clauses deleted for lack of memory : 0
% 0.47/0.71 # Backward-subsumed : 5
% 0.47/0.71 # Backward-rewritten : 27
% 0.47/0.71 # Generated clauses : 66
% 0.47/0.71 # ...of the previous two non-redundant : 60
% 0.47/0.71 # ...aggressively subsumed : 0
% 0.47/0.71 # Contextual simplify-reflections : 1
% 0.47/0.71 # Paramodulations : 11
% 0.47/0.71 # Factorizations : 0
% 0.47/0.71 # NegExts : 0
% 0.47/0.71 # Equation resolutions : 68
% 0.47/0.71 # Total rewrite steps : 947
% 0.47/0.71 # Propositional unsat checks : 0
% 0.47/0.71 # Propositional check models : 0
% 0.47/0.71 # Propositional check unsatisfiable : 0
% 0.47/0.71 # Propositional clauses : 0
% 0.47/0.71 # Propositional clauses after purity: 0
% 0.47/0.71 # Propositional unsat core size : 0
% 0.47/0.71 # Propositional preprocessing time : 0.000
% 0.47/0.71 # Propositional encoding time : 0.000
% 0.47/0.71 # Propositional solver time : 0.000
% 0.47/0.71 # Success case prop preproc time : 0.000
% 0.47/0.71 # Success case prop encoding time : 0.000
% 0.47/0.71 # Success case prop solver time : 0.000
% 0.47/0.71 # Current number of processed clauses : 42
% 0.47/0.71 # Positive orientable unit clauses : 21
% 0.47/0.71 # Positive unorientable unit clauses: 0
% 0.47/0.71 # Negative unit clauses : 17
% 0.47/0.71 # Non-unit-clauses : 4
% 0.47/0.71 # Current number of unprocessed clauses: 397
% 0.47/0.71 # ...number of literals in the above : 822
% 0.47/0.71 # Current number of archived formulas : 0
% 0.47/0.71 # Current number of archived clauses : 468
% 0.47/0.71 # Clause-clause subsumption calls (NU) : 21305
% 0.47/0.71 # Rec. Clause-clause subsumption calls : 12724
% 0.47/0.71 # Non-unit clause-clause subsumptions : 81
% 0.47/0.71 # Unit Clause-clause subsumption calls : 508
% 0.47/0.71 # Rewrite failures with RHS unbound : 0
% 0.47/0.71 # BW rewrite match attempts : 202
% 0.47/0.71 # BW rewrite match successes : 115
% 0.47/0.71 # Condensation attempts : 0
% 0.47/0.71 # Condensation successes : 0
% 0.47/0.71 # Termbank termtop insertions : 44908
% 0.47/0.71
% 0.47/0.71 # -------------------------------------------------
% 0.47/0.71 # User time : 0.044 s
% 0.47/0.71 # System time : 0.006 s
% 0.47/0.71 # Total time : 0.051 s
% 0.47/0.71 # Maximum resident set size: 4516 pages
% 0.47/0.71
% 0.47/0.71 # -------------------------------------------------
% 0.47/0.71 # User time : 0.057 s
% 0.47/0.71 # System time : 0.008 s
% 0.47/0.71 # Total time : 0.065 s
% 0.47/0.71 # Maximum resident set size: 2832 pages
% 0.47/0.71 % E---3.1 exiting
% 0.47/0.71 % E---3.1 exiting
%------------------------------------------------------------------------------