TSTP Solution File: NUM340+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM340+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n017.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:28 EDT 2023
% Result : Theorem 10.07s 2.18s
% Output : CNFRefutation 10.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 15 unt; 0 def)
% Number of atoms : 88 ( 3 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 96 ( 44 ~; 38 |; 9 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 96 ( 0 sgn; 66 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
rdn_translate(n0,rdn_pos(rdnn(n0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rdn0) ).
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/sandbox/benchmark/theBenchmark.p',sum_entry_point_pos_pos) ).
fof(f296,axiom,
! [X0,X1,X2] :
( sum(X1,X2,X0)
<=> difference(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',minus_entry_point) ).
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/sandbox/benchmark/theBenchmark.p',add_digit_digit_digit) ).
fof(f302,axiom,
rdn_digit_add(rdnn(n0),rdnn(n0),rdnn(n0),rdnn(n0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rdn_digit_add_n0_n0_n0_n0) ).
fof(f402,conjecture,
? [X0] : difference(X0,n0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diff_zero_identity) ).
fof(f403,negated_conjecture,
~ ? [X0] : difference(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] : ~ difference(X0,n0,X0),
inference(ennf_transformation,[],[f403]) ).
fof(f474,plain,
! [X0,X1,X2] :
( ( sum(X1,X2,X0)
| ~ difference(X0,X1,X2) )
& ( difference(X0,X1,X2)
| ~ sum(X1,X2,X0) ) ),
inference(nnf_transformation,[],[f296]) ).
fof(f475,plain,
rdn_translate(n0,rdn_pos(rdnn(n0))),
inference(cnf_transformation,[],[f1]) ).
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(f772,plain,
! [X2,X0,X1] :
( difference(X0,X1,X2)
| ~ sum(X1,X2,X0) ),
inference(cnf_transformation,[],[f474]) ).
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(f779,plain,
rdn_digit_add(rdnn(n0),rdnn(n0),rdnn(n0),rdnn(n0)),
inference(cnf_transformation,[],[f302]) ).
fof(f879,plain,
! [X0] : ~ difference(X0,n0,X0),
inference(cnf_transformation,[],[f471]) ).
cnf(c_49,plain,
rdn_translate(n0,rdn_pos(rdnn(n0))),
inference(cnf_transformation,[],[f475]) ).
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_347,plain,
( ~ sum(X0,X1,X2)
| difference(X2,X0,X1) ),
inference(cnf_transformation,[],[f772]) ).
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_353,plain,
rdn_digit_add(rdnn(n0),rdnn(n0),rdnn(n0),rdnn(n0)),
inference(cnf_transformation,[],[f779]) ).
cnf(c_453,negated_conjecture,
~ difference(X0,n0,X0),
inference(cnf_transformation,[],[f879]) ).
cnf(c_1450,plain,
( X0 != n0
| X1 != X2
| X2 != X3
| ~ sum(X0,X1,X3) ),
inference(resolution_lifted,[status(thm)],[c_347,c_453]) ).
cnf(c_1451,plain,
~ sum(n0,X0,X0),
inference(unflattening,[status(thm)],[c_1450]) ).
cnf(c_10447,plain,
( ~ rdn_digit_add(rdnn(X0),rdnn(X1),rdnn(n0),rdnn(n0))
| rdn_add_with_carry(rdnn(n0),rdnn(X0),rdnn(X1),rdnn(n0)) ),
inference(resolution,[status(thm)],[c_348,c_353]) ).
cnf(c_11053,plain,
rdn_add_with_carry(rdnn(n0),rdnn(n0),rdnn(n0),rdnn(n0)),
inference(resolution,[status(thm)],[c_10447,c_353]) ).
cnf(c_14380,plain,
( ~ rdn_translate(X0,rdn_pos(rdnn(n0)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n0)))
| ~ rdn_translate(X2,rdn_pos(rdnn(n0)))
| sum(X0,X1,X2) ),
inference(resolution,[status(thm)],[c_337,c_11053]) ).
cnf(c_15432,plain,
( ~ rdn_translate(X0,rdn_pos(rdnn(n0)))
| ~ rdn_translate(X1,rdn_pos(rdnn(n0)))
| sum(X0,X1,n0) ),
inference(resolution,[status(thm)],[c_14380,c_49]) ).
cnf(c_15440,plain,
( ~ rdn_translate(X0,rdn_pos(rdnn(n0)))
| sum(X0,n0,n0) ),
inference(resolution,[status(thm)],[c_15432,c_49]) ).
cnf(c_15446,plain,
sum(n0,n0,n0),
inference(resolution,[status(thm)],[c_15440,c_49]) ).
cnf(c_15462,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_15446,c_1451]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM340+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n017.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 07:58:40 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 10.07/2.18 % SZS status Started for theBenchmark.p
% 10.07/2.18 % SZS status Theorem for theBenchmark.p
% 10.07/2.18
% 10.07/2.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 10.07/2.18
% 10.07/2.18 ------ iProver source info
% 10.07/2.18
% 10.07/2.18 git: date: 2023-05-31 18:12:56 +0000
% 10.07/2.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 10.07/2.18 git: non_committed_changes: false
% 10.07/2.18 git: last_make_outside_of_git: false
% 10.07/2.18
% 10.07/2.18 ------ Parsing...
% 10.07/2.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 10.07/2.18
% 10.07/2.18 ------ 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: 2 0s sf_e pe_s pe_e
% 10.07/2.18
% 10.07/2.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 10.07/2.18
% 10.07/2.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 10.07/2.18 ------ Proving...
% 10.07/2.18 ------ Problem Properties
% 10.07/2.18
% 10.07/2.18
% 10.07/2.18 clauses 402
% 10.07/2.18 conjectures 0
% 10.07/2.18 EPR 8
% 10.07/2.18 Horn 400
% 10.07/2.18 unary 376
% 10.07/2.18 binary 6
% 10.07/2.18 lits 472
% 10.07/2.18 lits eq 5
% 10.07/2.18 fd_pure 0
% 10.07/2.18 fd_pseudo 0
% 10.07/2.18 fd_cond 0
% 10.07/2.18 fd_pseudo_cond 5
% 10.07/2.18 AC symbols 0
% 10.07/2.18
% 10.07/2.18 ------ Input Options Time Limit: Unbounded
% 10.07/2.18
% 10.07/2.18
% 10.07/2.18 ------
% 10.07/2.18 Current options:
% 10.07/2.18 ------
% 10.07/2.18
% 10.07/2.18
% 10.07/2.18
% 10.07/2.18
% 10.07/2.18 ------ Proving...
% 10.07/2.18
% 10.07/2.18
% 10.07/2.18 % SZS status Theorem for theBenchmark.p
% 10.07/2.18
% 10.07/2.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.07/2.18
% 10.07/2.18
%------------------------------------------------------------------------------