TSTP Solution File: NUM924+5 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM924+5 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% 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 : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 09:37:44 EDT 2022
% Result : Theorem 0.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 38 ( 38 unt; 0 def)
% Number of atoms : 38 ( 28 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 7 con; 0-3 aty)
% Number of variables : 31 ( 1 sgn 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fact_22_number__of__is__id,axiom,
! [X14] : number_number_of(int,X14) = X14,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_22_number__of__is__id) ).
fof(fact_18__096_B_Bthesis_O_A_I_B_Bt_O_As_A_094_A2_A_L_A1_A_061_A_I4_A_K_Am_A_L_A1_,axiom,
~ ! [X13] : 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)),X13),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_18__096_B_Bthesis_O_A_I_B_Bt_O_As_A_094_A2_A_L_A1_A_061_A_I4_A_K_Am_A_L_A1_) ).
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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_3_t) ).
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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',conj_0) ).
fof(fact_23_zmult__commute,axiom,
! [X15,X11] : times_times(int,X15,X11) = times_times(int,X11,X15),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_23_zmult__commute) ).
fof(fact_69_zadd__zmult__distrib2,axiom,
! [X11,X18,X19] : times_times(int,X11,plus_plus(int,X18,X19)) = plus_plus(int,times_times(int,X11,X18),times_times(int,X11,X19)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_69_zadd__zmult__distrib2) ).
fof(fact_65_zmult__1__right,axiom,
! [X15] : times_times(int,X15,one_one(int)) = X15,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_65_zmult__1__right) ).
fof(fact_96_zadd__commute,axiom,
! [X15,X11] : plus_plus(int,X15,X11) = plus_plus(int,X11,X15),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_96_zadd__commute) ).
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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',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(fact_97_zero__is__num__zero,axiom,
zero_zero(int) = number_number_of(int,pls),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_97_zero__is__num__zero) ).
fof(fact_62_mult__Pls,axiom,
! [X11] : times_times(int,pls,X11) = pls,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_62_mult__Pls) ).
fof(c_0_11,plain,
! [X15] : number_number_of(int,X15) = X15,
inference(variable_rename,[status(thm)],[fact_22_number__of__is__id]) ).
fof(c_0_12,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)),esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_18__096_B_Bthesis_O_A_I_B_Bt_O_As_A_094_A2_A_L_A1_A_061_A_I4_A_K_Am_A_L_A1_])])]) ).
cnf(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]) ).
cnf(c_0_14,plain,
number_number_of(int,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,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(assume_negation,[status(cth)],[conj_0]) ).
cnf(c_0_16,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)),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,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_14]) ).
fof(c_0_18,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)],[c_0_15]) ).
fof(c_0_19,plain,
! [X16,X17] : times_times(int,X16,X17) = times_times(int,X17,X16),
inference(variable_rename,[status(thm)],[fact_23_zmult__commute]) ).
fof(c_0_20,plain,
! [X20,X21,X22] : times_times(int,X20,plus_plus(int,X21,X22)) = plus_plus(int,times_times(int,X20,X21),times_times(int,X20,X22)),
inference(variable_rename,[status(thm)],[fact_69_zadd__zmult__distrib2]) ).
fof(c_0_21,plain,
! [X16] : times_times(int,X16,one_one(int)) = X16,
inference(variable_rename,[status(thm)],[fact_65_zmult__1__right]) ).
fof(c_0_22,plain,
! [X16,X17] : plus_plus(int,X16,X17) = plus_plus(int,X17,X16),
inference(variable_rename,[status(thm)],[fact_96_zadd__commute]) ).
cnf(c_0_23,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_24,plain,
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)),esk1_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_14]) ).
cnf(c_0_25,plain,
zero_zero(int) = number_number_of(int,pls),
inference(split_conjunct,[status(thm)],[fact_97_zero__is__num__zero]) ).
fof(c_0_26,plain,
! [X12] : times_times(int,pls,X12) = pls,
inference(variable_rename,[status(thm)],[fact_62_mult__Pls]) ).
cnf(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)),zero_zero(int)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,plain,
times_times(int,X1,X2) = times_times(int,X2,X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,plain,
times_times(int,X1,plus_plus(int,X2,X3)) = plus_plus(int,times_times(int,X1,X2),times_times(int,X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_30,plain,
times_times(int,X1,one_one(int)) = X1,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_31,plain,
plus_plus(int,X1,X2) = plus_plus(int,X2,X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_32,plain,
ord_less(int,times_times(int,plus_plus(int,times_times(int,bit0(bit0(bit1(pls))),m),one_one(int)),esk1_0),times_times(int,plus_plus(int,times_times(int,bit0(bit0(bit1(pls))),m),one_one(int)),pls)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_14]),c_0_24]),c_0_14]),c_0_25]),c_0_14]) ).
cnf(c_0_33,plain,
times_times(int,pls,X1) = pls,
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_34,negated_conjecture,
~ ord_less(int,plus_plus(int,t,times_times(int,t,times_times(int,m,bit0(bit0(bit1(pls)))))),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)],[c_0_27,c_0_25]),c_0_17]),c_0_28]),c_0_28]),c_0_29]),c_0_30]),c_0_31]),c_0_14]) ).
cnf(c_0_35,plain,
plus_plus(int,t,times_times(int,t,times_times(int,m,bit0(bit0(bit1(pls)))))) = plus_plus(int,esk1_0,times_times(int,esk1_0,times_times(int,m,bit0(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)],[c_0_24,c_0_28]),c_0_28]),c_0_28]),c_0_28]),c_0_29]),c_0_30]),c_0_31]),c_0_29]),c_0_30]),c_0_31]) ).
cnf(c_0_36,plain,
ord_less(int,plus_plus(int,esk1_0,times_times(int,esk1_0,times_times(int,m,bit0(bit0(bit1(pls)))))),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)],[c_0_32,c_0_28]),c_0_28]),c_0_28]),c_0_28]),c_0_33]),c_0_29]),c_0_30]),c_0_31]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : NUM924+5 : TPTP v8.1.0. Released v5.3.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.11/0.32 % Computer : n017.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Wed Jul 6 20:51:59 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.21/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.40 # Preprocessing time : 0.023 s
% 0.21/1.40
% 0.21/1.40 # Proof found!
% 0.21/1.40 # SZS status Theorem
% 0.21/1.40 # SZS output start CNFRefutation
% See solution above
% 0.21/1.40 # Proof object total steps : 38
% 0.21/1.40 # Proof object clause steps : 18
% 0.21/1.40 # Proof object formula steps : 20
% 0.21/1.40 # Proof object conjectures : 6
% 0.21/1.40 # Proof object clause conjectures : 3
% 0.21/1.40 # Proof object formula conjectures : 3
% 0.21/1.40 # Proof object initial clauses used : 11
% 0.21/1.40 # Proof object initial formulas used : 11
% 0.21/1.40 # Proof object generating inferences : 0
% 0.21/1.40 # Proof object simplifying inferences : 37
% 0.21/1.40 # Training examples: 0 positive, 0 negative
% 0.21/1.40 # Parsed axioms : 155
% 0.21/1.40 # Removed by relevancy pruning/SinE : 58
% 0.21/1.40 # Initial clauses : 141
% 0.21/1.40 # Removed in clause preprocessing : 3
% 0.21/1.40 # Initial clauses in saturation : 138
% 0.21/1.40 # Processed clauses : 275
% 0.21/1.40 # ...of these trivial : 11
% 0.21/1.40 # ...subsumed : 78
% 0.21/1.40 # ...remaining for further processing : 186
% 0.21/1.40 # Other redundant clauses eliminated : 1
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 1
% 0.21/1.40 # Backward-rewritten : 33
% 0.21/1.40 # Generated clauses : 1223
% 0.21/1.40 # ...of the previous two non-trivial : 1065
% 0.21/1.40 # Contextual simplify-reflections : 7
% 0.21/1.40 # Paramodulations : 1214
% 0.21/1.40 # Factorizations : 4
% 0.21/1.40 # Equation resolutions : 5
% 0.21/1.40 # Current number of processed clauses : 151
% 0.21/1.40 # Positive orientable unit clauses : 38
% 0.21/1.40 # Positive unorientable unit clauses: 3
% 0.21/1.40 # Negative unit clauses : 4
% 0.21/1.40 # Non-unit-clauses : 106
% 0.21/1.40 # Current number of unprocessed clauses: 742
% 0.21/1.40 # ...number of literals in the above : 2399
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 34
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 2351
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 1971
% 0.21/1.40 # Non-unit clause-clause subsumptions : 62
% 0.21/1.40 # Unit Clause-clause subsumption calls : 221
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 131
% 0.21/1.40 # BW rewrite match successes : 38
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 29841
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.056 s
% 0.21/1.40 # System time : 0.002 s
% 0.21/1.40 # Total time : 0.058 s
% 0.21/1.40 # Maximum resident set size: 4376 pages
%------------------------------------------------------------------------------