TSTP Solution File: NUM924_1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM924_1 : TPTP v8.2.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:46 EDT 2024
% Result : Theorem 0.14s 0.42s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 24
% Syntax : Number of formulae : 45 ( 29 unt; 16 typ; 0 def)
% Number of atoms : 29 ( 19 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 ( 3 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 12 ( 8 >; 4 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn 18 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
int: $tType ).
tff(decl_sort2,type,
nat: $tType ).
tff(decl_22,type,
one_one_int: int ).
tff(decl_24,type,
plus_plus_int: ( int * int ) > int ).
tff(decl_26,type,
times_times_int: ( int * int ) > int ).
tff(decl_28,type,
zero_zero_int: int ).
tff(decl_31,type,
bit0: int > int ).
tff(decl_32,type,
bit1: int > int ).
tff(decl_33,type,
pls: int ).
tff(decl_34,type,
number_number_of_int: int > int ).
tff(decl_35,type,
number_number_of_nat: int > nat ).
tff(decl_36,type,
ord_less_int: ( int * int ) > $o ).
tff(decl_40,type,
power_power_int: ( int * nat ) > int ).
tff(decl_43,type,
m: int ).
tff(decl_44,type,
s: int ).
tff(decl_45,type,
t: int ).
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/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(fact_24_number__of__is__id,axiom,
! [X11: int] : ( number_number_of_int(X11) = X11 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_24_number__of__is__id) ).
tff(fact_105_zero__is__num__zero,axiom,
zero_zero_int = number_number_of_int(pls),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_105_zero__is__num__zero) ).
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/sandbox2/benchmark/theBenchmark.p',fact_3_t) ).
tff(fact_104_zadd__commute,axiom,
! [X12: int,X10: int] : ( plus_plus_int(X12,X10) = plus_plus_int(X10,X12) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_104_zadd__commute) ).
tff(fact_25_zmult__commute,axiom,
! [X12: int,X10: int] : ( times_times_int(X12,X10) = times_times_int(X10,X12) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_25_zmult__commute) ).
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/sandbox2/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) ).
tff(fact_66_mult__Pls,axiom,
! [X10: int] : ( times_times_int(pls,X10) = pls ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_66_mult__Pls) ).
tff(c_0_8,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_9,plain,
! [X70: int] : ( number_number_of_int(X70) = X70 ),
inference(variable_rename,[status(thm)],[fact_24_number__of__is__id]) ).
tff(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_8]) ).
tcf(c_0_11,plain,
zero_zero_int = number_number_of_int(pls),
inference(split_conjunct,[status(thm)],[fact_105_zero__is__num__zero]) ).
tcf(c_0_12,plain,
! [X1: int] : number_number_of_int(X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_13,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]) ).
tff(c_0_14,plain,
! [X215: int,X216: int] : ( plus_plus_int(X215,X216) = plus_plus_int(X216,X215) ),
inference(variable_rename,[status(thm)],[fact_104_zadd__commute]) ).
tff(c_0_15,plain,
! [X71: int,X72: int] : ( times_times_int(X71,X72) = times_times_int(X72,X71) ),
inference(variable_rename,[status(thm)],[fact_25_zmult__commute]) ).
tcf(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(split_conjunct,[status(thm)],[c_0_10]) ).
tcf(c_0_17,plain,
pls = zero_zero_int,
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
tcf(c_0_18,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_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(bit0(bit0(bit1(pls))),m),one_one_int),t),
inference(rw,[status(thm)],[c_0_13,c_0_12]) ).
tcf(c_0_20,plain,
! [X2: int,X1: int] : plus_plus_int(X1,X2) = plus_plus_int(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
tcf(c_0_21,plain,
! [X2: int,X1: int] : times_times_int(X1,X2) = times_times_int(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
tff(c_0_22,plain,
! [X142: int] : ( times_times_int(pls,X142) = pls ),
inference(variable_rename,[status(thm)],[fact_66_mult__Pls]) ).
tcf(c_0_23,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_16,c_0_17]) ).
tcf(c_0_24,plain,
ord_less_int(times_times_int(plus_plus_int(times_times_int(bit0(bit0(bit1(pls))),m),one_one_int),t),times_times_int(plus_plus_int(times_times_int(bit0(bit0(bit1(pls))),m),one_one_int),zero_zero_int)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_12]),c_0_12]) ).
tcf(c_0_25,plain,
times_times_int(t,plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(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)],[c_0_19,c_0_20]),c_0_21]),c_0_21]),c_0_20]) ).
tcf(c_0_26,plain,
! [X1: int] : times_times_int(pls,X1) = pls,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
tcf(c_0_27,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_23,c_0_20]) ).
cnf(c_0_28,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)],[c_0_24,c_0_20]),c_0_21]),c_0_21]),c_0_25]),c_0_20]),c_0_21]),c_0_17]),c_0_21]),c_0_26]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : NUM924_1 : TPTP v8.2.0. Released v5.3.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n003.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon May 20 05:57:37 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.14/0.42 # Version: 3.1.0
% 0.14/0.42 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.42 # Starting sh5l with 300s (1) cores
% 0.14/0.42 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 4148 completed with status 0
% 0.14/0.42 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.14/0.42 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.42 # No SInE strategy applied
% 0.14/0.42 # Search class: FGHSM-FFMM21-DFFFFFNN
% 0.14/0.42 # partial match(1): FGHSM-FFMM21-SFFFFFNN
% 0.14/0.42 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.42 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.14/0.42 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/0.42 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.14/0.42 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.14/0.42 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.14/0.42 # G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with pid 4158 completed with status 0
% 0.14/0.42 # Result found by G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN
% 0.14/0.42 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.42 # No SInE strategy applied
% 0.14/0.42 # Search class: FGHSM-FFMM21-DFFFFFNN
% 0.14/0.42 # partial match(1): FGHSM-FFMM21-SFFFFFNN
% 0.14/0.42 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.42 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.14/0.42 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/0.42 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.14/0.42 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.14/0.42 # Preprocessing time : 0.002 s
% 0.14/0.42 # Presaturation interreduction done
% 0.14/0.42
% 0.14/0.42 # Proof found!
% 0.14/0.42 # SZS status Theorem
% 0.14/0.42 # SZS output start CNFRefutation
% See solution above
% 0.14/0.42 # Parsed axioms : 133
% 0.14/0.42 # Removed by relevancy pruning/SinE : 0
% 0.14/0.42 # Initial clauses : 185
% 0.14/0.42 # Removed in clause preprocessing : 48
% 0.14/0.42 # Initial clauses in saturation : 137
% 0.14/0.42 # Processed clauses : 144
% 0.14/0.42 # ...of these trivial : 9
% 0.14/0.42 # ...subsumed : 15
% 0.14/0.42 # ...remaining for further processing : 119
% 0.14/0.42 # Other redundant clauses eliminated : 11
% 0.14/0.42 # Clauses deleted for lack of memory : 0
% 0.14/0.42 # Backward-subsumed : 0
% 0.14/0.42 # Backward-rewritten : 4
% 0.14/0.42 # Generated clauses : 7
% 0.14/0.42 # ...of the previous two non-redundant : 7
% 0.14/0.42 # ...aggressively subsumed : 0
% 0.14/0.42 # Contextual simplify-reflections : 1
% 0.14/0.42 # Paramodulations : 0
% 0.14/0.42 # Factorizations : 0
% 0.14/0.42 # NegExts : 0
% 0.14/0.42 # Equation resolutions : 11
% 0.14/0.42 # Disequality decompositions : 0
% 0.14/0.42 # Total rewrite steps : 102
% 0.14/0.42 # ...of those cached : 83
% 0.14/0.42 # Propositional unsat checks : 0
% 0.14/0.42 # Propositional check models : 0
% 0.14/0.42 # Propositional check unsatisfiable : 0
% 0.14/0.42 # Propositional clauses : 0
% 0.14/0.42 # Propositional clauses after purity: 0
% 0.14/0.42 # Propositional unsat core size : 0
% 0.14/0.42 # Propositional preprocessing time : 0.000
% 0.14/0.42 # Propositional encoding time : 0.000
% 0.14/0.42 # Propositional solver time : 0.000
% 0.14/0.42 # Success case prop preproc time : 0.000
% 0.14/0.42 # Success case prop encoding time : 0.000
% 0.14/0.42 # Success case prop solver time : 0.000
% 0.14/0.42 # Current number of processed clauses : 108
% 0.14/0.42 # Positive orientable unit clauses : 32
% 0.14/0.42 # Positive unorientable unit clauses: 3
% 0.14/0.42 # Negative unit clauses : 5
% 0.14/0.42 # Non-unit-clauses : 68
% 0.14/0.42 # Current number of unprocessed clauses: 0
% 0.14/0.42 # ...number of literals in the above : 0
% 0.14/0.42 # Current number of archived formulas : 0
% 0.14/0.42 # Current number of archived clauses : 5
% 0.14/0.42 # Clause-clause subsumption calls (NU) : 827
% 0.14/0.42 # Rec. Clause-clause subsumption calls : 791
% 0.14/0.42 # Non-unit clause-clause subsumptions : 14
% 0.14/0.42 # Unit Clause-clause subsumption calls : 15
% 0.14/0.42 # Rewrite failures with RHS unbound : 0
% 0.14/0.42 # BW rewrite match attempts : 31
% 0.14/0.42 # BW rewrite match successes : 24
% 0.14/0.42 # Condensation attempts : 0
% 0.14/0.42 # Condensation successes : 0
% 0.14/0.42 # Termbank termtop insertions : 9297
% 0.14/0.42 # Search garbage collected termcells : 1152
% 0.14/0.42
% 0.14/0.42 # -------------------------------------------------
% 0.14/0.42 # User time : 0.010 s
% 0.14/0.42 # System time : 0.005 s
% 0.14/0.42 # Total time : 0.016 s
% 0.14/0.42 # Maximum resident set size: 2284 pages
% 0.14/0.42
% 0.14/0.42 # -------------------------------------------------
% 0.14/0.42 # User time : 0.038 s
% 0.14/0.42 # System time : 0.015 s
% 0.14/0.42 # Total time : 0.053 s
% 0.14/0.42 # Maximum resident set size: 1844 pages
% 0.14/0.42 % E---3.1 exiting
% 0.14/0.42 % E exiting
%------------------------------------------------------------------------------