TSTP Solution File: NUM327+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM327+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.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:40 EDT 2024
% Result : Theorem 39.50s 6.20s
% Output : CNFRefutation 39.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 33 ( 16 unt; 0 def)
% Number of atoms : 83 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 93 ( 43 ~; 38 |; 8 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 78 ( 0 sgn 57 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
rdn_translate(n0,rdn_pos(rdnn(n0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn0) ).
fof(f2,axiom,
rdn_translate(n1,rdn_pos(rdnn(n1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn1) ).
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(f312,axiom,
rdn_digit_add(rdnn(n1),rdnn(n0),rdnn(n1),rdnn(n0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn_digit_add_n1_n0_n1_n0) ).
fof(f402,conjecture,
? [X0] : sum(X0,n0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_zero_identity) ).
fof(f403,negated_conjecture,
~ ? [X0] : sum(X0,n0,X0),
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] : ~ sum(X0,n0,X0),
inference(ennf_transformation,[],[f403]) ).
fof(f475,plain,
rdn_translate(n0,rdn_pos(rdnn(n0))),
inference(cnf_transformation,[],[f1]) ).
fof(f476,plain,
rdn_translate(n1,rdn_pos(rdnn(n1))),
inference(cnf_transformation,[],[f2]) ).
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(f789,plain,
rdn_digit_add(rdnn(n1),rdnn(n0),rdnn(n1),rdnn(n0)),
inference(cnf_transformation,[],[f312]) ).
fof(f879,plain,
! [X0] : ~ sum(X0,n0,X0),
inference(cnf_transformation,[],[f471]) ).
cnf(c_49,plain,
rdn_translate(n0,rdn_pos(rdnn(n0))),
inference(cnf_transformation,[],[f475]) ).
cnf(c_50,plain,
rdn_translate(n1,rdn_pos(rdnn(n1))),
inference(cnf_transformation,[],[f476]) ).
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_363,plain,
rdn_digit_add(rdnn(n1),rdnn(n0),rdnn(n1),rdnn(n0)),
inference(cnf_transformation,[],[f789]) ).
cnf(c_453,negated_conjecture,
~ sum(X0,n0,X0),
inference(cnf_transformation,[],[f879]) ).
cnf(c_455,plain,
~ sum(n1,n0,n1),
inference(instantiation,[status(thm)],[c_453]) ).
cnf(c_14088,plain,
( ~ rdn_digit_add(rdnn(X0),rdnn(X1),rdnn(n1),rdnn(n0))
| ~ rdn_digit_add(rdnn(n1),rdnn(n0),rdnn(n1),rdnn(n0))
| rdn_add_with_carry(rdnn(n0),rdnn(X0),rdnn(X1),rdnn(n1)) ),
inference(instantiation,[status(thm)],[c_348]) ).
cnf(c_15521,plain,
( ~ rdn_digit_add(rdnn(n1),rdnn(n0),rdnn(n1),rdnn(n0))
| rdn_add_with_carry(rdnn(n0),rdnn(n1),rdnn(n0),rdnn(n1)) ),
inference(instantiation,[status(thm)],[c_14088]) ).
cnf(c_16544,plain,
( ~ rdn_add_with_carry(rdnn(n0),rdnn(n1),rdnn(n0),rdnn(n1))
| ~ rdn_translate(X0,rdn_pos(rdnn(n1)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n1)))
| ~ rdn_translate(X2,rdn_pos(rdnn(n0)))
| sum(X0,X2,X1) ),
inference(instantiation,[status(thm)],[c_337]) ).
cnf(c_20092,plain,
( ~ rdn_add_with_carry(rdnn(n0),rdnn(n1),rdnn(n0),rdnn(n1))
| ~ rdn_translate(X0,rdn_pos(rdnn(n1)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n1)))
| ~ rdn_translate(n0,rdn_pos(rdnn(n0)))
| sum(X0,n0,X1) ),
inference(instantiation,[status(thm)],[c_16544]) ).
cnf(c_20093,plain,
( ~ rdn_add_with_carry(rdnn(n0),rdnn(n1),rdnn(n0),rdnn(n1))
| ~ rdn_translate(n0,rdn_pos(rdnn(n0)))
| ~ rdn_translate(n1,rdn_pos(rdnn(n1)))
| sum(n1,n0,n1) ),
inference(instantiation,[status(thm)],[c_20092]) ).
cnf(c_20094,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_20093,c_15521,c_363,c_49,c_50,c_455]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : NUM327+1 : TPTP v8.1.2. Released v3.1.0.
% 0.05/0.11 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n022.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Thu May 2 19:24:27 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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
% 39.50/6.20 % SZS status Started for theBenchmark.p
% 39.50/6.20 % SZS status Theorem for theBenchmark.p
% 39.50/6.20
% 39.50/6.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 39.50/6.20
% 39.50/6.20 ------ iProver source info
% 39.50/6.20
% 39.50/6.20 git: date: 2024-05-02 19:28:25 +0000
% 39.50/6.20 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 39.50/6.20 git: non_committed_changes: false
% 39.50/6.20
% 39.50/6.20 ------ Parsing...
% 39.50/6.20 ------ Clausification by vclausify_rel & Parsing by iProver...
% 39.50/6.20
% 39.50/6.20 ------ 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
% 39.50/6.20
% 39.50/6.20 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 39.50/6.20
% 39.50/6.20 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 39.50/6.20 ------ Proving...
% 39.50/6.20 ------ Problem Properties
% 39.50/6.20
% 39.50/6.20
% 39.50/6.20 clauses 402
% 39.50/6.20 conjectures 1
% 39.50/6.20 EPR 8
% 39.50/6.20 Horn 400
% 39.50/6.20 unary 376
% 39.50/6.20 binary 6
% 39.50/6.20 lits 472
% 39.50/6.20 lits eq 5
% 39.50/6.20 fd_pure 0
% 39.50/6.20 fd_pseudo 0
% 39.50/6.20 fd_cond 0
% 39.50/6.20 fd_pseudo_cond 5
% 39.50/6.20 AC symbols 0
% 39.50/6.20
% 39.50/6.20 ------ Input Options Time Limit: Unbounded
% 39.50/6.20
% 39.50/6.20
% 39.50/6.20 ------
% 39.50/6.20 Current options:
% 39.50/6.20 ------
% 39.50/6.20
% 39.50/6.20
% 39.50/6.20
% 39.50/6.20
% 39.50/6.20 ------ Proving...
% 39.50/6.20
% 39.50/6.20
% 39.50/6.20 % SZS status Theorem for theBenchmark.p
% 39.50/6.20
% 39.50/6.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 39.50/6.20
% 39.50/6.20
%------------------------------------------------------------------------------