TSTP Solution File: NUM330+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM330+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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:48:41 EDT 2024
% Result : Theorem 7.84s 1.66s
% Output : CNFRefutation 7.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 38 ( 17 unt; 0 def)
% Number of atoms : 90 ( 9 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 94 ( 42 ~; 36 |; 12 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 83 ( 0 sgn 60 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
rdn_translate(n4,rdn_pos(rdnn(n4))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn4) ).
fof(f9,axiom,
rdn_translate(n8,rdn_pos(rdnn(n8))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn8) ).
fof(f287,axiom,
! [X0,X1,X2,X9,X10,X11] :
( ( rdn_translate(X2,rdn_pos(X11))
& rdn_add_with_carry(rdnn(n0),X9,X10,X11)
& rdn_translate(X1,rdn_pos(X10))
& rdn_translate(X0,rdn_pos(X9)) )
=> sum(X0,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_entry_point_pos_pos) ).
fof(f297,axiom,
! [X20,X21,X22,X23,X24] :
( ( rdn_digit_add(rdnn(X24),rdnn(X20),rdnn(X23),rdnn(n0))
& rdn_digit_add(rdnn(X21),rdnn(X22),rdnn(X24),rdnn(n0)) )
=> rdn_add_with_carry(rdnn(X20),rdnn(X21),rdnn(X22),rdnn(X23)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_digit_digit_digit) ).
fof(f346,axiom,
rdn_digit_add(rdnn(n4),rdnn(n4),rdnn(n8),rdnn(n0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn_digit_add_n4_n4_n8_n0) ).
fof(f382,axiom,
rdn_digit_add(rdnn(n8),rdnn(n0),rdnn(n8),rdnn(n0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn_digit_add_n8_n0_n8_n0) ).
fof(f402,conjecture,
? [X0,X1] :
( n4 = X1
& n4 = X0
& sum(X0,X1,n8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_n4_n4_n8) ).
fof(f403,negated_conjecture,
~ ? [X0,X1] :
( n4 = X1
& n4 = X0
& sum(X0,X1,n8) ),
inference(negated_conjecture,[],[f402]) ).
fof(f411,plain,
! [X0,X1,X2,X3,X4,X5] :
( ( rdn_translate(X2,rdn_pos(X5))
& rdn_add_with_carry(rdnn(n0),X3,X4,X5)
& rdn_translate(X1,rdn_pos(X4))
& rdn_translate(X0,rdn_pos(X3)) )
=> sum(X0,X1,X2) ),
inference(rectify,[],[f287]) ).
fof(f420,plain,
! [X0,X1,X2,X3,X4] :
( ( rdn_digit_add(rdnn(X4),rdnn(X0),rdnn(X3),rdnn(n0))
& rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(X4),rdnn(n0)) )
=> rdn_add_with_carry(rdnn(X0),rdnn(X1),rdnn(X2),rdnn(X3)) ),
inference(rectify,[],[f297]) ).
fof(f444,plain,
! [X0,X1,X2,X3,X4,X5] :
( sum(X0,X1,X2)
| ~ rdn_translate(X2,rdn_pos(X5))
| ~ rdn_add_with_carry(rdnn(n0),X3,X4,X5)
| ~ rdn_translate(X1,rdn_pos(X4))
| ~ rdn_translate(X0,rdn_pos(X3)) ),
inference(ennf_transformation,[],[f411]) ).
fof(f445,plain,
! [X0,X1,X2,X3,X4,X5] :
( sum(X0,X1,X2)
| ~ rdn_translate(X2,rdn_pos(X5))
| ~ rdn_add_with_carry(rdnn(n0),X3,X4,X5)
| ~ rdn_translate(X1,rdn_pos(X4))
| ~ rdn_translate(X0,rdn_pos(X3)) ),
inference(flattening,[],[f444]) ).
fof(f462,plain,
! [X0,X1,X2,X3,X4] :
( rdn_add_with_carry(rdnn(X0),rdnn(X1),rdnn(X2),rdnn(X3))
| ~ rdn_digit_add(rdnn(X4),rdnn(X0),rdnn(X3),rdnn(n0))
| ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(X4),rdnn(n0)) ),
inference(ennf_transformation,[],[f420]) ).
fof(f463,plain,
! [X0,X1,X2,X3,X4] :
( rdn_add_with_carry(rdnn(X0),rdnn(X1),rdnn(X2),rdnn(X3))
| ~ rdn_digit_add(rdnn(X4),rdnn(X0),rdnn(X3),rdnn(n0))
| ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(X4),rdnn(n0)) ),
inference(flattening,[],[f462]) ).
fof(f471,plain,
! [X0,X1] :
( n4 != X1
| n4 != X0
| ~ sum(X0,X1,n8) ),
inference(ennf_transformation,[],[f403]) ).
fof(f479,plain,
rdn_translate(n4,rdn_pos(rdnn(n4))),
inference(cnf_transformation,[],[f5]) ).
fof(f483,plain,
rdn_translate(n8,rdn_pos(rdnn(n8))),
inference(cnf_transformation,[],[f9]) ).
fof(f763,plain,
! [X2,X3,X0,X1,X4,X5] :
( sum(X0,X1,X2)
| ~ rdn_translate(X2,rdn_pos(X5))
| ~ rdn_add_with_carry(rdnn(n0),X3,X4,X5)
| ~ rdn_translate(X1,rdn_pos(X4))
| ~ rdn_translate(X0,rdn_pos(X3)) ),
inference(cnf_transformation,[],[f445]) ).
fof(f774,plain,
! [X2,X3,X0,X1,X4] :
( rdn_add_with_carry(rdnn(X0),rdnn(X1),rdnn(X2),rdnn(X3))
| ~ rdn_digit_add(rdnn(X4),rdnn(X0),rdnn(X3),rdnn(n0))
| ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(X4),rdnn(n0)) ),
inference(cnf_transformation,[],[f463]) ).
fof(f823,plain,
rdn_digit_add(rdnn(n4),rdnn(n4),rdnn(n8),rdnn(n0)),
inference(cnf_transformation,[],[f346]) ).
fof(f859,plain,
rdn_digit_add(rdnn(n8),rdnn(n0),rdnn(n8),rdnn(n0)),
inference(cnf_transformation,[],[f382]) ).
fof(f879,plain,
! [X0,X1] :
( n4 != X1
| n4 != X0
| ~ sum(X0,X1,n8) ),
inference(cnf_transformation,[],[f471]) ).
fof(f881,plain,
! [X0] :
( n4 != X0
| ~ sum(X0,n4,n8) ),
inference(equality_resolution,[],[f879]) ).
fof(f882,plain,
~ sum(n4,n4,n8),
inference(equality_resolution,[],[f881]) ).
cnf(c_53,plain,
rdn_translate(n4,rdn_pos(rdnn(n4))),
inference(cnf_transformation,[],[f479]) ).
cnf(c_57,plain,
rdn_translate(n8,rdn_pos(rdnn(n8))),
inference(cnf_transformation,[],[f483]) ).
cnf(c_337,plain,
( ~ rdn_add_with_carry(rdnn(n0),X0,X1,X2)
| ~ rdn_translate(X3,rdn_pos(X0))
| ~ rdn_translate(X4,rdn_pos(X2))
| ~ rdn_translate(X5,rdn_pos(X1))
| sum(X3,X5,X4) ),
inference(cnf_transformation,[],[f763]) ).
cnf(c_348,plain,
( ~ rdn_digit_add(rdnn(X0),rdnn(X1),rdnn(X2),rdnn(n0))
| ~ rdn_digit_add(rdnn(X2),rdnn(X3),rdnn(X4),rdnn(n0))
| rdn_add_with_carry(rdnn(X3),rdnn(X0),rdnn(X1),rdnn(X4)) ),
inference(cnf_transformation,[],[f774]) ).
cnf(c_397,plain,
rdn_digit_add(rdnn(n4),rdnn(n4),rdnn(n8),rdnn(n0)),
inference(cnf_transformation,[],[f823]) ).
cnf(c_433,plain,
rdn_digit_add(rdnn(n8),rdnn(n0),rdnn(n8),rdnn(n0)),
inference(cnf_transformation,[],[f859]) ).
cnf(c_453,negated_conjecture,
~ sum(n4,n4,n8),
inference(cnf_transformation,[],[f882]) ).
cnf(c_6829,plain,
( ~ rdn_digit_add(rdnn(n8),rdnn(X0),rdnn(X1),rdnn(n0))
| rdn_add_with_carry(rdnn(X0),rdnn(n4),rdnn(n4),rdnn(X1)) ),
inference(superposition,[status(thm)],[c_397,c_348]) ).
cnf(c_9037,plain,
rdn_add_with_carry(rdnn(n0),rdnn(n4),rdnn(n4),rdnn(n8)),
inference(superposition,[status(thm)],[c_433,c_6829]) ).
cnf(c_9042,plain,
( ~ rdn_translate(X0,rdn_pos(rdnn(n4)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n8)))
| ~ rdn_translate(X2,rdn_pos(rdnn(n4)))
| sum(X0,X2,X1) ),
inference(superposition,[status(thm)],[c_9037,c_337]) ).
cnf(c_10751,plain,
( ~ rdn_translate(X0,rdn_pos(rdnn(n8)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n4)))
| sum(n4,X1,X0) ),
inference(superposition,[status(thm)],[c_53,c_9042]) ).
cnf(c_12517,plain,
( ~ rdn_translate(X0,rdn_pos(rdnn(n8)))
| sum(n4,n4,X0) ),
inference(superposition,[status(thm)],[c_53,c_10751]) ).
cnf(c_18013,plain,
sum(n4,n4,n8),
inference(superposition,[status(thm)],[c_57,c_12517]) ).
cnf(c_18014,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_18013,c_453]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM330+1 : TPTP v8.1.2. Released v3.1.0.
% 0.11/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu May 2 20:06:22 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.21/0.46 Running first-order theorem proving
% 0.21/0.46 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
% 7.84/1.66 % SZS status Started for theBenchmark.p
% 7.84/1.66 % SZS status Theorem for theBenchmark.p
% 7.84/1.66
% 7.84/1.66 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.84/1.66
% 7.84/1.66 ------ iProver source info
% 7.84/1.66
% 7.84/1.66 git: date: 2024-05-02 19:28:25 +0000
% 7.84/1.66 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.84/1.66 git: non_committed_changes: false
% 7.84/1.66
% 7.84/1.66 ------ Parsing...
% 7.84/1.66 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.84/1.66
% 7.84/1.66 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 7.84/1.66
% 7.84/1.66 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.84/1.66
% 7.84/1.66 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.84/1.66 ------ Proving...
% 7.84/1.66 ------ Problem Properties
% 7.84/1.66
% 7.84/1.66
% 7.84/1.66 clauses 402
% 7.84/1.66 conjectures 1
% 7.84/1.66 EPR 8
% 7.84/1.66 Horn 400
% 7.84/1.66 unary 376
% 7.84/1.66 binary 6
% 7.84/1.66 lits 472
% 7.84/1.66 lits eq 5
% 7.84/1.66 fd_pure 0
% 7.84/1.66 fd_pseudo 0
% 7.84/1.66 fd_cond 0
% 7.84/1.66 fd_pseudo_cond 5
% 7.84/1.66 AC symbols 0
% 7.84/1.66
% 7.84/1.66 ------ Input Options Time Limit: Unbounded
% 7.84/1.66
% 7.84/1.66
% 7.84/1.66 ------
% 7.84/1.66 Current options:
% 7.84/1.66 ------
% 7.84/1.66
% 7.84/1.66
% 7.84/1.66
% 7.84/1.66
% 7.84/1.66 ------ Proving...
% 7.84/1.66
% 7.84/1.66
% 7.84/1.66 % SZS status Theorem for theBenchmark.p
% 7.84/1.66
% 7.84/1.66 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.84/1.66
% 7.84/1.66
%------------------------------------------------------------------------------