TSTP Solution File: NUM924+5 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM924+5 : TPTP v8.1.2. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.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 : Fri May 3 02:51:09 EDT 2024
% Result : Theorem 2.46s 1.18s
% Output : CNFRefutation 2.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 37 ( 37 unt; 0 def)
% Number of atoms : 37 ( 24 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 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f42,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) ).
fof(f43,axiom,
times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t) = plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3_t) ).
fof(f62,axiom,
! [X13] : number_number_of(int,X13) = X13,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_22_number__of__is__id) ).
fof(f63,axiom,
! [X14,X10] : times_times(int,X14,X10) = times_times(int,X10,X14),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_23_zmult__commute) ).
fof(f102,axiom,
! [X10] : pls = times_times(int,pls,X10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_62_mult__Pls) ).
fof(f136,axiom,
! [X14,X10] : plus_plus(int,X10,X14) = plus_plus(int,X14,X10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_96_zadd__commute) ).
fof(f137,axiom,
zero_zero(int) = number_number_of(int,pls),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_97_zero__is__num__zero) ).
fof(f155,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) ).
fof(f156,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(negated_conjecture,[],[f155]) ).
fof(f198,plain,
! [X0] : number_number_of(int,X0) = X0,
inference(rectify,[],[f62]) ).
fof(f199,plain,
! [X0,X1] : times_times(int,X0,X1) = times_times(int,X1,X0),
inference(rectify,[],[f63]) ).
fof(f234,plain,
! [X0] : pls = times_times(int,pls,X0),
inference(rectify,[],[f102]) ).
fof(f266,plain,
! [X0,X1] : plus_plus(int,X0,X1) = plus_plus(int,X1,X0),
inference(rectify,[],[f136]) ).
fof(f268,plain,
~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)),
inference(flattening,[],[f156]) ).
fof(f469,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(cnf_transformation,[],[f42]) ).
fof(f470,plain,
times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t) = plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),
inference(cnf_transformation,[],[f43]) ).
fof(f495,plain,
! [X0] : number_number_of(int,X0) = X0,
inference(cnf_transformation,[],[f198]) ).
fof(f496,plain,
! [X0,X1] : times_times(int,X0,X1) = times_times(int,X1,X0),
inference(cnf_transformation,[],[f199]) ).
fof(f558,plain,
! [X0] : pls = times_times(int,pls,X0),
inference(cnf_transformation,[],[f234]) ).
fof(f613,plain,
! [X0,X1] : plus_plus(int,X0,X1) = plus_plus(int,X1,X0),
inference(cnf_transformation,[],[f266]) ).
fof(f614,plain,
zero_zero(int) = number_number_of(int,pls),
inference(cnf_transformation,[],[f137]) ).
fof(f632,plain,
~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)),
inference(cnf_transformation,[],[f268]) ).
cnf(c_100,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(cnf_transformation,[],[f469]) ).
cnf(c_101,plain,
times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t) = plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),
inference(cnf_transformation,[],[f470]) ).
cnf(c_126,plain,
number_number_of(int,X0) = X0,
inference(cnf_transformation,[],[f495]) ).
cnf(c_127,plain,
times_times(int,X0,X1) = times_times(int,X1,X0),
inference(cnf_transformation,[],[f496]) ).
cnf(c_189,plain,
times_times(int,pls,X0) = pls,
inference(cnf_transformation,[],[f558]) ).
cnf(c_238,plain,
plus_plus(int,X0,X1) = plus_plus(int,X1,X0),
inference(cnf_transformation,[],[f613]) ).
cnf(c_239,plain,
number_number_of(int,pls) = zero_zero(int),
inference(cnf_transformation,[],[f614]) ).
cnf(c_257,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(cnf_transformation,[],[f632]) ).
cnf(c_1693,plain,
zero_zero(int) = pls,
inference(demodulation,[status(thm)],[c_239,c_126]) ).
cnf(c_2016,plain,
~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),pls),
inference(light_normalisation,[status(thm)],[c_257,c_1693]) ).
cnf(c_2017,plain,
~ ord_less(int,plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))),pls),
inference(demodulation,[status(thm)],[c_2016,c_238]) ).
cnf(c_2348,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(demodulation,[status(thm)],[c_101,c_126,c_127,c_238]) ).
cnf(c_2402,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)),pls)),
inference(light_normalisation,[status(thm)],[c_100,c_1693]) ).
cnf(c_2403,plain,
ord_less(int,plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))),pls),
inference(demodulation,[status(thm)],[c_2402,c_126,c_127,c_189,c_238,c_2348]) ).
cnf(c_2404,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2403,c_2017]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : NUM924+5 : TPTP v8.1.2. Released v5.3.0.
% 0.04/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n021.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 : Thu May 2 19:42:12 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.46/1.18 % SZS status Started for theBenchmark.p
% 2.46/1.18 % SZS status Theorem for theBenchmark.p
% 2.46/1.18
% 2.46/1.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.46/1.18
% 2.46/1.18 ------ iProver source info
% 2.46/1.18
% 2.46/1.18 git: date: 2024-05-02 19:28:25 +0000
% 2.46/1.18 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.46/1.18 git: non_committed_changes: false
% 2.46/1.18
% 2.46/1.18 ------ Parsing...
% 2.46/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.46/1.18
% 2.46/1.18 ------ Preprocessing...
% 2.46/1.18
% 2.46/1.18 % SZS status Theorem for theBenchmark.p
% 2.46/1.18
% 2.46/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.46/1.18
% 2.46/1.18
%------------------------------------------------------------------------------