TSTP Solution File: NUM924+5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM924+5 : TPTP v8.1.2. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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 : Sat May 4 08:58:23 EDT 2024
% Result : Theorem 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 30 ( 30 unt; 0 def)
% Number of atoms : 30 ( 20 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-3 aty)
% Number of variables : 24 ( 1 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(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.RHbr7X8oyK/E---3.1_16164.p',conj_0) ).
fof(fact_97_zero__is__num__zero,axiom,
zero_zero(int) = number_number_of(int,pls),
file('/export/starexec/sandbox/tmp/tmp.RHbr7X8oyK/E---3.1_16164.p',fact_97_zero__is__num__zero) ).
fof(fact_22_number__of__is__id,axiom,
! [X14] : number_number_of(int,X14) = X14,
file('/export/starexec/sandbox/tmp/tmp.RHbr7X8oyK/E---3.1_16164.p',fact_22_number__of__is__id) ).
fof(fact_63_mult__Bit0,axiom,
! [X14,X31] : times_times(int,bit0(X14),X31) = bit0(times_times(int,X14,X31)),
file('/export/starexec/sandbox/tmp/tmp.RHbr7X8oyK/E---3.1_16164.p',fact_63_mult__Bit0) ).
fof(fact_23_zmult__commute,axiom,
! [X15,X11] : times_times(int,X15,X11) = times_times(int,X11,X15),
file('/export/starexec/sandbox/tmp/tmp.RHbr7X8oyK/E---3.1_16164.p',fact_23_zmult__commute) ).
fof(fact_96_zadd__commute,axiom,
! [X15,X11] : plus_plus(int,X15,X11) = plus_plus(int,X11,X15),
file('/export/starexec/sandbox/tmp/tmp.RHbr7X8oyK/E---3.1_16164.p',fact_96_zadd__commute) ).
fof(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.RHbr7X8oyK/E---3.1_16164.p',fact_3_t) ).
fof(fact_62_mult__Pls,axiom,
! [X11] : times_times(int,pls,X11) = pls,
file('/export/starexec/sandbox/tmp/tmp.RHbr7X8oyK/E---3.1_16164.p',fact_62_mult__Pls) ).
fof(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.RHbr7X8oyK/E---3.1_16164.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) ).
fof(c_0_9,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])]) ).
fof(c_0_10,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_9]) ).
cnf(c_0_11,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_10]) ).
cnf(c_0_12,plain,
zero_zero(int) = number_number_of(int,pls),
inference(split_conjunct,[status(thm)],[fact_97_zero__is__num__zero]) ).
fof(c_0_13,plain,
! [X138] : number_number_of(int,X138) = X138,
inference(variable_rename,[status(thm)],[fact_22_number__of__is__id]) ).
fof(c_0_14,plain,
! [X51,X52] : times_times(int,bit0(X51),X52) = bit0(times_times(int,X51,X52)),
inference(variable_rename,[status(thm)],[fact_63_mult__Bit0]) ).
fof(c_0_15,plain,
! [X149,X150] : times_times(int,X149,X150) = times_times(int,X150,X149),
inference(variable_rename,[status(thm)],[fact_23_zmult__commute]) ).
fof(c_0_16,plain,
! [X118,X119] : plus_plus(int,X118,X119) = plus_plus(int,X119,X118),
inference(variable_rename,[status(thm)],[fact_96_zadd__commute]) ).
cnf(c_0_17,negated_conjecture,
~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),number_number_of(int,pls)),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
number_number_of(int,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,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]) ).
cnf(c_0_20,plain,
times_times(int,bit0(X1),X2) = bit0(times_times(int,X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
times_times(int,X1,X2) = times_times(int,X2,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
plus_plus(int,X1,X2) = plus_plus(int,X2,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_23,plain,
! [X74] : times_times(int,pls,X74) = pls,
inference(variable_rename,[status(thm)],[fact_62_mult__Pls]) ).
cnf(c_0_24,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_17,c_0_18]) ).
cnf(c_0_25,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]) ).
cnf(c_0_26,plain,
times_times(int,t,plus_plus(int,one_one(int),bit0(bit0(times_times(int,m,bit1(pls)))))) = plus_plus(int,one_one(int),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)],[c_0_19,c_0_18]),c_0_20]),c_0_20]),c_0_21]),c_0_22]),c_0_21]),c_0_22]) ).
cnf(c_0_27,plain,
times_times(int,pls,X1) = pls,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,negated_conjecture,
~ ord_less(int,plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))),pls),
inference(rw,[status(thm)],[c_0_24,c_0_22]) ).
cnf(c_0_29,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)],[c_0_25,c_0_18]),c_0_20]),c_0_20]),c_0_21]),c_0_22]),c_0_21]),c_0_26]),c_0_18]),c_0_20]),c_0_20]),c_0_21]),c_0_22]),c_0_12]),c_0_18]),c_0_21]),c_0_27]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : NUM924+5 : TPTP v8.1.2. Released v5.3.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n010.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Fri May 3 09:14:48 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 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.RHbr7X8oyK/E---3.1_16164.p
% 0.15/0.43 # Version: 3.1.0
% 0.15/0.43 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # Starting sh5l with 300s (1) cores
% 0.15/0.43 # new_bool_1 with pid 16244 completed with status 0
% 0.15/0.43 # Result found by new_bool_1
% 0.15/0.43 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.15/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 70s (1) cores
% 0.15/0.43 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 16246 completed with status 0
% 0.15/0.43 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.43 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.15/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 70s (1) cores
% 0.15/0.43 # Preprocessing time : 0.002 s
% 0.15/0.43 # Presaturation interreduction done
% 0.15/0.43
% 0.15/0.43 # Proof found!
% 0.15/0.43 # SZS status Theorem
% 0.15/0.43 # SZS output start CNFRefutation
% See solution above
% 0.15/0.43 # Parsed axioms : 155
% 0.15/0.43 # Removed by relevancy pruning/SinE : 58
% 0.15/0.43 # Initial clauses : 141
% 0.15/0.43 # Removed in clause preprocessing : 3
% 0.15/0.43 # Initial clauses in saturation : 138
% 0.15/0.43 # Processed clauses : 143
% 0.15/0.43 # ...of these trivial : 8
% 0.15/0.43 # ...subsumed : 14
% 0.15/0.43 # ...remaining for further processing : 120
% 0.15/0.43 # Other redundant clauses eliminated : 1
% 0.15/0.43 # Clauses deleted for lack of memory : 0
% 0.15/0.43 # Backward-subsumed : 1
% 0.15/0.43 # Backward-rewritten : 5
% 0.15/0.43 # Generated clauses : 1
% 0.15/0.43 # ...of the previous two non-redundant : 5
% 0.15/0.43 # ...aggressively subsumed : 0
% 0.15/0.43 # Contextual simplify-reflections : 1
% 0.15/0.43 # Paramodulations : 0
% 0.15/0.43 # Factorizations : 0
% 0.15/0.43 # NegExts : 0
% 0.15/0.43 # Equation resolutions : 1
% 0.15/0.43 # Disequality decompositions : 0
% 0.15/0.43 # Total rewrite steps : 83
% 0.15/0.43 # ...of those cached : 61
% 0.15/0.43 # Propositional unsat checks : 0
% 0.15/0.43 # Propositional check models : 0
% 0.15/0.43 # Propositional check unsatisfiable : 0
% 0.15/0.43 # Propositional clauses : 0
% 0.15/0.43 # Propositional clauses after purity: 0
% 0.15/0.43 # Propositional unsat core size : 0
% 0.15/0.43 # Propositional preprocessing time : 0.000
% 0.15/0.43 # Propositional encoding time : 0.000
% 0.15/0.43 # Propositional solver time : 0.000
% 0.15/0.43 # Success case prop preproc time : 0.000
% 0.15/0.43 # Success case prop encoding time : 0.000
% 0.15/0.43 # Success case prop solver time : 0.000
% 0.15/0.43 # Current number of processed clauses : 113
% 0.15/0.43 # Positive orientable unit clauses : 32
% 0.15/0.43 # Positive unorientable unit clauses: 3
% 0.15/0.43 # Negative unit clauses : 3
% 0.15/0.43 # Non-unit-clauses : 75
% 0.15/0.43 # Current number of unprocessed clauses: 0
% 0.15/0.43 # ...number of literals in the above : 0
% 0.15/0.43 # Current number of archived formulas : 0
% 0.15/0.43 # Current number of archived clauses : 6
% 0.15/0.43 # Clause-clause subsumption calls (NU) : 800
% 0.15/0.43 # Rec. Clause-clause subsumption calls : 631
% 0.15/0.43 # Non-unit clause-clause subsumptions : 16
% 0.15/0.43 # Unit Clause-clause subsumption calls : 4
% 0.15/0.43 # Rewrite failures with RHS unbound : 0
% 0.15/0.43 # BW rewrite match attempts : 43
% 0.15/0.43 # BW rewrite match successes : 14
% 0.15/0.43 # Condensation attempts : 0
% 0.15/0.43 # Condensation successes : 0
% 0.15/0.43 # Termbank termtop insertions : 11221
% 0.15/0.43 # Search garbage collected termcells : 1534
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.009 s
% 0.15/0.43 # System time : 0.005 s
% 0.15/0.43 # Total time : 0.014 s
% 0.15/0.43 # Maximum resident set size: 2240 pages
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.012 s
% 0.15/0.43 # System time : 0.007 s
% 0.15/0.43 # Total time : 0.019 s
% 0.15/0.43 # Maximum resident set size: 1880 pages
% 0.15/0.43 % E---3.1 exiting
% 0.15/0.43 % E exiting
%------------------------------------------------------------------------------