%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM924+5 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 02:27:17 PM UTC 2026
% Result : Theorem 3.17s 1.28s
% Output : CNFRefutation 3.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 33 ( 33 unt; 0 def)
% Number of atoms : 33 ( 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 types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% 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 : 18 ( 0 sgn 18 !; 0 ?; 6 :)
% 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,
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/benchmark/theBenchmark.p',fact_3_t) ).
fof(f62,axiom,
! [X0] : number_number_of(int,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_22_number__of__is__id) ).
fof(f63,axiom,
! [X0,X1] : times_times(int,X0,X1) = times_times(int,X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_23_zmult__commute) ).
fof(f102,axiom,
! [X0] : times_times(int,pls,X0) = pls,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_62_mult__Pls) ).
fof(f136,axiom,
! [X0,X1] : plus_plus(int,X0,X1) = plus_plus(int,X1,X0),
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,[status(cth)],[f155]) ).
fof(f157,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(f357,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(f358,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(f383,plain,
! [X0] : number_number_of(int,X0) = X0,
inference(cnf_transformation,[],[f62]) ).
fof(f384,plain,
! [X0,X1] : times_times(int,X0,X1) = times_times(int,X1,X0),
inference(cnf_transformation,[],[f63]) ).
fof(f446,plain,
! [X0] : pls = times_times(int,pls,X0),
inference(cnf_transformation,[],[f102]) ).
fof(f501,plain,
! [X0,X1] : plus_plus(int,X0,X1) = plus_plus(int,X1,X0),
inference(cnf_transformation,[],[f136]) ).
fof(f502,plain,
zero_zero(int) = number_number_of(int,pls),
inference(cnf_transformation,[],[f137]) ).
fof(f520,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,[],[f157]) ).
tcf(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,[],[f357]) ).
tcf(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,[],[f358]) ).
tcf(c_126,plain,
! [X0: $i] : number_number_of(int,X0) = X0,
inference(cnf_transformation,[],[f383]) ).
tcf(c_127,plain,
! [X0: $i,X1: $i] : times_times(int,X0,X1) = times_times(int,X1,X0),
inference(cnf_transformation,[],[f384]) ).
tcf(c_189,plain,
! [X0: $i] : times_times(int,pls,X0) = pls,
inference(cnf_transformation,[],[f446]) ).
tcf(c_238,plain,
! [X0: $i,X1: $i] : plus_plus(int,X0,X1) = plus_plus(int,X1,X0),
inference(cnf_transformation,[],[f501]) ).
tcf(c_239,plain,
number_number_of(int,pls) = zero_zero(int),
inference(cnf_transformation,[],[f502]) ).
tcf(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,[],[f520]) ).
tcf(c_1693,plain,
zero_zero(int) = pls,
inference(demodulation,[status(thm)],[c_239,c_126]) ).
tcf(c_2022,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]) ).
tcf(c_2023,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_2022,c_238]) ).
tcf(c_2356,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]) ).
tcf(c_2410,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]) ).
tcf(c_2411,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_2410,c_126,c_127,c_189,c_238,c_2356]) ).
tcf(c_2412,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2411,c_2023]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM924+5 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.36 % Computer : n014.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Thu Sep 24 05:42:03 UTC 2026
% 0.03/0.37 % CPUTime :
% 0.03/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.03/0.40 Running first-order theorem proving
% 0.03/0.40 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.41
% 0.03/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.03/0.41
% 0.03/0.41 % Detected problem language: tptp
% 0.03/0.43 % Proving...
% 3.17/1.28 % SZS status Started for theBenchmark.p
% 3.17/1.28 % SZS status Theorem for theBenchmark.p
% 3.17/1.28
% 3.17/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.17/1.28
% 3.17/1.28 % ------ iProver source info
% 3.17/1.28
% 3.17/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 3.17/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.17/1.28 % git: non_committed_changes: false
% 3.17/1.28
% 3.17/1.28 % ------ Parsing...
% 3.17/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.17/1.28
% 3.17/1.28 % ------ Preprocessing...%
% 3.17/1.28
% 3.17/1.28 % SZS status Theorem for theBenchmark.p
% 3.17/1.28
% 3.17/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.17/1.28
% 3.17/1.28
%------------------------------------------------------------------------------