TSTP Solution File: NUM926+5 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM926+5 : TPTP v8.1.2. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n025.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:14 EDT 2024
% Result : Theorem 4.03s 1.21s
% Output : CNFRefutation 4.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 12 unt; 0 def)
% Number of atoms : 66 ( 39 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 58 ( 25 ~; 19 |; 6 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 9 con; 0-3 aty)
% Number of variables : 40 ( 2 sgn 14 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f28,axiom,
ord_less_eq(int,one_one(int),t),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_tpos) ).
fof(f29,axiom,
( t = one_one(int)
=> ? [X3,X4] : plus_plus(int,power_power(int,X3,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X4,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).
fof(f30,axiom,
( ord_less(int,one_one(int),t)
=> ? [X3,X4] : plus_plus(int,power_power(int,X3,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X4,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).
fof(f50,axiom,
! [X15,X16] :
( ord_less(int,X15,X16)
<=> ( X15 != X16
& ord_less_eq(int,X15,X16) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_22_zless__le) ).
fof(f142,conjecture,
? [X3,X4] : plus_plus(int,power_power(int,X3,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X4,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
fof(f143,negated_conjecture,
~ ? [X3,X4] : plus_plus(int,power_power(int,X3,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X4,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),
inference(negated_conjecture,[],[f142]) ).
fof(f165,plain,
( t = one_one(int)
=> ? [X0,X1] : plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) = plus_plus(int,power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X1,number_number_of(nat,bit0(bit1(pls))))) ),
inference(rectify,[],[f29]) ).
fof(f166,plain,
( ord_less(int,one_one(int),t)
=> ? [X0,X1] : plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) = plus_plus(int,power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X1,number_number_of(nat,bit0(bit1(pls))))) ),
inference(rectify,[],[f30]) ).
fof(f180,plain,
! [X0,X1] :
( ord_less(int,X0,X1)
<=> ( X0 != X1
& ord_less_eq(int,X0,X1) ) ),
inference(rectify,[],[f50]) ).
fof(f251,plain,
~ ? [X0,X1] : plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) = plus_plus(int,power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X1,number_number_of(nat,bit0(bit1(pls))))),
inference(rectify,[],[f143]) ).
fof(f272,plain,
( ? [X0,X1] : plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) = plus_plus(int,power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X1,number_number_of(nat,bit0(bit1(pls)))))
| t != one_one(int) ),
inference(ennf_transformation,[],[f165]) ).
fof(f273,plain,
( ? [X0,X1] : plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) = plus_plus(int,power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X1,number_number_of(nat,bit0(bit1(pls)))))
| ~ ord_less(int,one_one(int),t) ),
inference(ennf_transformation,[],[f166]) ).
fof(f323,plain,
! [X0,X1] : plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) != plus_plus(int,power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X1,number_number_of(nat,bit0(bit1(pls))))),
inference(ennf_transformation,[],[f251]) ).
fof(f330,plain,
( ? [X0,X1] : plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) = plus_plus(int,power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X1,number_number_of(nat,bit0(bit1(pls)))))
=> plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) = plus_plus(int,power_power(int,sK0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK1,number_number_of(nat,bit0(bit1(pls))))) ),
introduced(choice_axiom,[]) ).
fof(f331,plain,
( plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) = plus_plus(int,power_power(int,sK0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK1,number_number_of(nat,bit0(bit1(pls)))))
| t != one_one(int) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f272,f330]) ).
fof(f332,plain,
( ? [X0,X1] : plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) = plus_plus(int,power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X1,number_number_of(nat,bit0(bit1(pls)))))
=> plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) = plus_plus(int,power_power(int,sK2,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK3,number_number_of(nat,bit0(bit1(pls))))) ),
introduced(choice_axiom,[]) ).
fof(f333,plain,
( plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) = plus_plus(int,power_power(int,sK2,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK3,number_number_of(nat,bit0(bit1(pls)))))
| ~ ord_less(int,one_one(int),t) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f273,f332]) ).
fof(f336,plain,
! [X0,X1] :
( ( ord_less(int,X0,X1)
| X0 = X1
| ~ ord_less_eq(int,X0,X1) )
& ( ( X0 != X1
& ord_less_eq(int,X0,X1) )
| ~ ord_less(int,X0,X1) ) ),
inference(nnf_transformation,[],[f180]) ).
fof(f337,plain,
! [X0,X1] :
( ( ord_less(int,X0,X1)
| X0 = X1
| ~ ord_less_eq(int,X0,X1) )
& ( ( X0 != X1
& ord_less_eq(int,X0,X1) )
| ~ ord_less(int,X0,X1) ) ),
inference(flattening,[],[f336]) ).
fof(f404,plain,
ord_less_eq(int,one_one(int),t),
inference(cnf_transformation,[],[f28]) ).
fof(f405,plain,
( plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) = plus_plus(int,power_power(int,sK0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK1,number_number_of(nat,bit0(bit1(pls)))))
| t != one_one(int) ),
inference(cnf_transformation,[],[f331]) ).
fof(f406,plain,
( plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) = plus_plus(int,power_power(int,sK2,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK3,number_number_of(nat,bit0(bit1(pls)))))
| ~ ord_less(int,one_one(int),t) ),
inference(cnf_transformation,[],[f333]) ).
fof(f428,plain,
! [X0,X1] :
( ord_less(int,X0,X1)
| X0 = X1
| ~ ord_less_eq(int,X0,X1) ),
inference(cnf_transformation,[],[f337]) ).
fof(f555,plain,
! [X0,X1] : plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) != plus_plus(int,power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X1,number_number_of(nat,bit0(bit1(pls))))),
inference(cnf_transformation,[],[f323]) ).
cnf(c_82,plain,
ord_less_eq(int,one_one(int),t),
inference(cnf_transformation,[],[f404]) ).
cnf(c_83,plain,
( one_one(int) != t
| plus_plus(int,power_power(int,sK0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK1,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) ),
inference(cnf_transformation,[],[f405]) ).
cnf(c_84,plain,
( ~ ord_less(int,one_one(int),t)
| plus_plus(int,power_power(int,sK2,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK3,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)) ),
inference(cnf_transformation,[],[f406]) ).
cnf(c_104,plain,
( ~ ord_less_eq(int,X0,X1)
| X0 = X1
| ord_less(int,X0,X1) ),
inference(cnf_transformation,[],[f428]) ).
cnf(c_228,negated_conjecture,
plus_plus(int,power_power(int,X0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X1,number_number_of(nat,bit0(bit1(pls))))) != plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),
inference(cnf_transformation,[],[f555]) ).
cnf(c_2739,plain,
plus_plus(int,power_power(int,sK0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK1,number_number_of(nat,bit0(bit1(pls))))) != plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),
inference(instantiation,[status(thm)],[c_228]) ).
cnf(c_2740,plain,
plus_plus(int,power_power(int,sK2,number_number_of(nat,bit0(bit1(pls)))),power_power(int,sK3,number_number_of(nat,bit0(bit1(pls))))) != plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),
inference(instantiation,[status(thm)],[c_228]) ).
cnf(c_2990,plain,
( one_one(int) = t
| ord_less(int,one_one(int),t) ),
inference(superposition,[status(thm)],[c_82,c_104]) ).
cnf(c_3052,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2990,c_2740,c_2739,c_83,c_84]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM926+5 : TPTP v8.1.2. Released v5.3.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n025.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu May 2 20:00:43 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.03/1.21 % SZS status Started for theBenchmark.p
% 4.03/1.21 % SZS status Theorem for theBenchmark.p
% 4.03/1.21
% 4.03/1.21 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.03/1.21
% 4.03/1.21 ------ iProver source info
% 4.03/1.21
% 4.03/1.21 git: date: 2024-05-02 19:28:25 +0000
% 4.03/1.21 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.03/1.21 git: non_committed_changes: false
% 4.03/1.21
% 4.03/1.21 ------ Parsing...
% 4.03/1.21 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.03/1.21
% 4.03/1.21 ------ Preprocessing... sup_sim: 0 pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e sup_sim: 0 pe_s pe_e
% 4.03/1.21
% 4.03/1.21 ------ Preprocessing... gs_s sp: 0 0s gs_e scvd_s sp: 0 0s scvd_e snvd_s sp: 0 0s snvd_e
% 4.03/1.21
% 4.03/1.21 ------ Preprocessing...
% 4.03/1.21 ------ Proving...
% 4.03/1.21 ------ Problem Properties
% 4.03/1.21
% 4.03/1.21
% 4.03/1.21 clauses 171
% 4.03/1.21 conjectures 1
% 4.03/1.21 EPR 12
% 4.03/1.21 Horn 163
% 4.03/1.21 unary 91
% 4.03/1.21 binary 72
% 4.03/1.21 lits 259
% 4.03/1.21 lits eq 97
% 4.03/1.21 fd_pure 0
% 4.03/1.21 fd_pseudo 0
% 4.03/1.21 fd_cond 0
% 4.03/1.21 fd_pseudo_cond 6
% 4.03/1.21 AC symbols 0
% 4.03/1.21
% 4.03/1.21 ------ Input Options Time Limit: Unbounded
% 4.03/1.21
% 4.03/1.21
% 4.03/1.21 ------
% 4.03/1.21 Current options:
% 4.03/1.21 ------
% 4.03/1.21
% 4.03/1.21
% 4.03/1.21
% 4.03/1.21
% 4.03/1.21 ------ Proving...
% 4.03/1.21
% 4.03/1.21
% 4.03/1.21 % SZS status Theorem for theBenchmark.p
% 4.03/1.21
% 4.03/1.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.03/1.21
% 4.03/1.21
%------------------------------------------------------------------------------