TSTP Solution File: NUM323+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM323+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.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 : Thu Aug 31 11:29:24 EDT 2023
% Result : Theorem 169.65s 23.36s
% Output : CNFRefutation 169.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 39 ( 23 unt; 0 def)
% Number of atoms : 82 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 78 ( 35 ~; 31 |; 8 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-1 aty)
% Number of variables : 79 ( 1 sgn; 57 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f130,axiom,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdnn2) ).
fof(f133,axiom,
rdn_translate(nn5,rdn_neg(rdnn(n5))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdnn5) ).
fof(f135,axiom,
rdn_translate(nn7,rdn_neg(rdnn(n7))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdnn7) ).
fof(f288,axiom,
! [X0,X1,X2,X9,X10,X11] :
( ( rdn_translate(X2,rdn_neg(X11))
& rdn_add_with_carry(rdnn(n0),X9,X10,X11)
& rdn_translate(X1,rdn_neg(X10))
& rdn_translate(X0,rdn_neg(X9)) )
=> sum(X0,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_entry_point_neg_neg) ).
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(f327,axiom,
rdn_digit_add(rdnn(n2),rdnn(n5),rdnn(n7),rdnn(n0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn_digit_add_n2_n5_n7_n0) ).
fof(f372,axiom,
rdn_digit_add(rdnn(n7),rdnn(n0),rdnn(n7),rdnn(n0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn_digit_add_n7_n0_n7_n0) ).
fof(f402,conjecture,
? [X0] : sum(X0,nn5,nn7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_what_nn5_nn7) ).
fof(f403,negated_conjecture,
~ ? [X0] : sum(X0,nn5,nn7),
inference(negated_conjecture,[],[f402]) ).
fof(f412,plain,
! [X0,X1,X2,X3,X4,X5] :
( ( rdn_translate(X2,rdn_neg(X5))
& rdn_add_with_carry(rdnn(n0),X3,X4,X5)
& rdn_translate(X1,rdn_neg(X4))
& rdn_translate(X0,rdn_neg(X3)) )
=> sum(X0,X1,X2) ),
inference(rectify,[],[f288]) ).
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(f446,plain,
! [X0,X1,X2,X3,X4,X5] :
( sum(X0,X1,X2)
| ~ rdn_translate(X2,rdn_neg(X5))
| ~ rdn_add_with_carry(rdnn(n0),X3,X4,X5)
| ~ rdn_translate(X1,rdn_neg(X4))
| ~ rdn_translate(X0,rdn_neg(X3)) ),
inference(ennf_transformation,[],[f412]) ).
fof(f447,plain,
! [X0,X1,X2,X3,X4,X5] :
( sum(X0,X1,X2)
| ~ rdn_translate(X2,rdn_neg(X5))
| ~ rdn_add_with_carry(rdnn(n0),X3,X4,X5)
| ~ rdn_translate(X1,rdn_neg(X4))
| ~ rdn_translate(X0,rdn_neg(X3)) ),
inference(flattening,[],[f446]) ).
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] : ~ sum(X0,nn5,nn7),
inference(ennf_transformation,[],[f403]) ).
fof(f604,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(cnf_transformation,[],[f130]) ).
fof(f607,plain,
rdn_translate(nn5,rdn_neg(rdnn(n5))),
inference(cnf_transformation,[],[f133]) ).
fof(f609,plain,
rdn_translate(nn7,rdn_neg(rdnn(n7))),
inference(cnf_transformation,[],[f135]) ).
fof(f764,plain,
! [X2,X3,X0,X1,X4,X5] :
( sum(X0,X1,X2)
| ~ rdn_translate(X2,rdn_neg(X5))
| ~ rdn_add_with_carry(rdnn(n0),X3,X4,X5)
| ~ rdn_translate(X1,rdn_neg(X4))
| ~ rdn_translate(X0,rdn_neg(X3)) ),
inference(cnf_transformation,[],[f447]) ).
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(f804,plain,
rdn_digit_add(rdnn(n2),rdnn(n5),rdnn(n7),rdnn(n0)),
inference(cnf_transformation,[],[f327]) ).
fof(f849,plain,
rdn_digit_add(rdnn(n7),rdnn(n0),rdnn(n7),rdnn(n0)),
inference(cnf_transformation,[],[f372]) ).
fof(f879,plain,
! [X0] : ~ sum(X0,nn5,nn7),
inference(cnf_transformation,[],[f471]) ).
cnf(c_178,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(cnf_transformation,[],[f604]) ).
cnf(c_181,plain,
rdn_translate(nn5,rdn_neg(rdnn(n5))),
inference(cnf_transformation,[],[f607]) ).
cnf(c_183,plain,
rdn_translate(nn7,rdn_neg(rdnn(n7))),
inference(cnf_transformation,[],[f609]) ).
cnf(c_338,plain,
( ~ rdn_add_with_carry(rdnn(n0),X0,X1,X2)
| ~ rdn_translate(X3,rdn_neg(X0))
| ~ rdn_translate(X4,rdn_neg(X2))
| ~ rdn_translate(X5,rdn_neg(X1))
| sum(X3,X5,X4) ),
inference(cnf_transformation,[],[f764]) ).
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_378,plain,
rdn_digit_add(rdnn(n2),rdnn(n5),rdnn(n7),rdnn(n0)),
inference(cnf_transformation,[],[f804]) ).
cnf(c_423,plain,
rdn_digit_add(rdnn(n7),rdnn(n0),rdnn(n7),rdnn(n0)),
inference(cnf_transformation,[],[f849]) ).
cnf(c_453,negated_conjecture,
~ sum(X0,nn5,nn7),
inference(cnf_transformation,[],[f879]) ).
cnf(c_171248,plain,
( ~ rdn_digit_add(rdnn(n7),rdnn(X0),rdnn(X1),rdnn(n0))
| rdn_add_with_carry(rdnn(X0),rdnn(n2),rdnn(n5),rdnn(X1)) ),
inference(superposition,[status(thm)],[c_378,c_348]) ).
cnf(c_191880,plain,
rdn_add_with_carry(rdnn(n0),rdnn(n2),rdnn(n5),rdnn(n7)),
inference(superposition,[status(thm)],[c_423,c_171248]) ).
cnf(c_191904,plain,
( ~ rdn_translate(X0,rdn_neg(rdnn(n2)))
| ~ rdn_translate(X1,rdn_neg(rdnn(n7)))
| ~ rdn_translate(X2,rdn_neg(rdnn(n5)))
| sum(X0,X2,X1) ),
inference(superposition,[status(thm)],[c_191880,c_338]) ).
cnf(c_293104,plain,
( ~ rdn_translate(X0,rdn_neg(rdnn(n7)))
| ~ rdn_translate(X1,rdn_neg(rdnn(n5)))
| sum(nn2,X1,X0) ),
inference(superposition,[status(thm)],[c_178,c_191904]) ).
cnf(c_422212,plain,
( ~ rdn_translate(X0,rdn_neg(rdnn(n5)))
| sum(nn2,X0,nn7) ),
inference(superposition,[status(thm)],[c_183,c_293104]) ).
cnf(c_422224,plain,
sum(nn2,nn5,nn7),
inference(superposition,[status(thm)],[c_181,c_422212]) ).
cnf(c_422230,plain,
$false,
inference(superposition,[status(thm)],[c_422224,c_453]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : NUM323+1 : TPTP v8.1.2. Released v3.1.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n009.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 : Fri Aug 25 17:51:06 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 169.65/23.36 % SZS status Started for theBenchmark.p
% 169.65/23.36 % SZS status Theorem for theBenchmark.p
% 169.65/23.36
% 169.65/23.36 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 169.65/23.36
% 169.65/23.36 ------ iProver source info
% 169.65/23.36
% 169.65/23.36 git: date: 2023-05-31 18:12:56 +0000
% 169.65/23.36 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 169.65/23.36 git: non_committed_changes: false
% 169.65/23.36 git: last_make_outside_of_git: false
% 169.65/23.36
% 169.65/23.36 ------ Parsing...
% 169.65/23.36 ------ Clausification by vclausify_rel & Parsing by iProver...
% 169.65/23.36
% 169.65/23.36 ------ Preprocessing... sf_s rm: 1 0s sf_e
% 169.65/23.36
% 169.65/23.36 ------ Preprocessing...
% 169.65/23.36
% 169.65/23.36 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 169.65/23.36 ------ Proving...
% 169.65/23.36 ------ Problem Properties
% 169.65/23.36
% 169.65/23.36
% 169.65/23.36 clauses 405
% 169.65/23.36 conjectures 1
% 169.65/23.36 EPR 11
% 169.65/23.36 Horn 403
% 169.65/23.36 unary 376
% 169.65/23.36 binary 8
% 169.65/23.36 lits 478
% 169.65/23.36 lits eq 5
% 169.65/23.36 fd_pure 0
% 169.65/23.36 fd_pseudo 0
% 169.65/23.36 fd_cond 0
% 169.65/23.36 fd_pseudo_cond 5
% 169.65/23.36 AC symbols 0
% 169.65/23.36
% 169.65/23.36 ------ Input Options Time Limit: Unbounded
% 169.65/23.36
% 169.65/23.36
% 169.65/23.36 ------
% 169.65/23.36 Current options:
% 169.65/23.36 ------
% 169.65/23.36
% 169.65/23.36
% 169.65/23.36
% 169.65/23.36
% 169.65/23.36 ------ Proving...
% 169.65/23.36
% 169.65/23.36
% 169.65/23.36 % SZS status Theorem for theBenchmark.p
% 169.65/23.36
% 169.65/23.36 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 169.65/23.36
% 169.65/23.36
%------------------------------------------------------------------------------