TSTP Solution File: NUM320+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM320+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n008.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 66.30s 9.80s
% Output : CNFRefutation 66.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of formulae : 60 ( 35 unt; 0 def)
% Number of atoms : 128 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 125 ( 57 ~; 52 |; 11 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-1 aty)
% Number of variables : 103 ( 1 sgn; 69 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
rdn_translate(n2,rdn_pos(rdnn(n2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rdn2) ).
fof(f131,axiom,
rdn_translate(nn3,rdn_neg(rdnn(n3))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rdnn3) ).
fof(f133,axiom,
rdn_translate(nn5,rdn_neg(rdnn(n5))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rdnn5) ).
fof(f268,axiom,
rdn_positive_less(rdnn(n2),rdnn(n3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rdn_positive_less23) ).
fof(f269,axiom,
rdn_positive_less(rdnn(n3),rdnn(n4)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rdn_positive_less34) ).
fof(f270,axiom,
rdn_positive_less(rdnn(n4),rdnn(n5)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rdn_positive_less45) ).
fof(f275,axiom,
! [X0,X1,X2] :
( ( rdn_positive_less(rdnn(X1),rdnn(X2))
& rdn_positive_less(rdnn(X0),rdnn(X1)) )
=> rdn_positive_less(rdnn(X0),rdnn(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rdn_positive_less_transitivity) ).
fof(f289,axiom,
! [X0,X1,X2,X9,X10,X11] :
( ( rdn_translate(X2,rdn_neg(X11))
& rdn_add_with_carry(rdnn(n0),X9,X11,X10)
& rdn_positive_less(X9,X10)
& rdn_translate(X1,rdn_neg(X10))
& rdn_translate(X0,rdn_pos(X9)) )
=> sum(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_entry_point_pos_neg_1) ).
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(f325,axiom,
rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rdn_digit_add_n2_n3_n5_n0) ).
fof(f352,axiom,
rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rdn_digit_add_n5_n0_n5_n0) ).
fof(f402,conjecture,
? [X1] : sum(n2,nn5,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_n2_nn5_what) ).
fof(f403,negated_conjecture,
~ ? [X1] : sum(n2,nn5,X1),
inference(negated_conjecture,[],[f402]) ).
fof(f413,plain,
! [X0,X1,X2,X3,X4,X5] :
( ( rdn_translate(X2,rdn_neg(X5))
& rdn_add_with_carry(rdnn(n0),X3,X5,X4)
& rdn_positive_less(X3,X4)
& rdn_translate(X1,rdn_neg(X4))
& rdn_translate(X0,rdn_pos(X3)) )
=> sum(X0,X1,X2) ),
inference(rectify,[],[f289]) ).
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(f425,plain,
~ ? [X0] : sum(n2,nn5,X0),
inference(rectify,[],[f403]) ).
fof(f427,plain,
! [X0,X1,X2] :
( rdn_positive_less(rdnn(X0),rdnn(X2))
| ~ rdn_positive_less(rdnn(X1),rdnn(X2))
| ~ rdn_positive_less(rdnn(X0),rdnn(X1)) ),
inference(ennf_transformation,[],[f275]) ).
fof(f428,plain,
! [X0,X1,X2] :
( rdn_positive_less(rdnn(X0),rdnn(X2))
| ~ rdn_positive_less(rdnn(X1),rdnn(X2))
| ~ rdn_positive_less(rdnn(X0),rdnn(X1)) ),
inference(flattening,[],[f427]) ).
fof(f449,plain,
! [X0,X1,X2,X3,X4,X5] :
( sum(X0,X1,X2)
| ~ rdn_translate(X2,rdn_neg(X5))
| ~ rdn_add_with_carry(rdnn(n0),X3,X5,X4)
| ~ rdn_positive_less(X3,X4)
| ~ rdn_translate(X1,rdn_neg(X4))
| ~ rdn_translate(X0,rdn_pos(X3)) ),
inference(ennf_transformation,[],[f413]) ).
fof(f450,plain,
! [X0,X1,X2,X3,X4,X5] :
( sum(X0,X1,X2)
| ~ rdn_translate(X2,rdn_neg(X5))
| ~ rdn_add_with_carry(rdnn(n0),X3,X5,X4)
| ~ rdn_positive_less(X3,X4)
| ~ rdn_translate(X1,rdn_neg(X4))
| ~ rdn_translate(X0,rdn_pos(X3)) ),
inference(flattening,[],[f449]) ).
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(ennf_transformation,[],[f420]) ).
fof(f464,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,[],[f463]) ).
fof(f472,plain,
! [X0] : ~ sum(n2,nn5,X0),
inference(ennf_transformation,[],[f425]) ).
fof(f478,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(cnf_transformation,[],[f3]) ).
fof(f606,plain,
rdn_translate(nn3,rdn_neg(rdnn(n3))),
inference(cnf_transformation,[],[f131]) ).
fof(f608,plain,
rdn_translate(nn5,rdn_neg(rdnn(n5))),
inference(cnf_transformation,[],[f133]) ).
fof(f743,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(cnf_transformation,[],[f268]) ).
fof(f744,plain,
rdn_positive_less(rdnn(n3),rdnn(n4)),
inference(cnf_transformation,[],[f269]) ).
fof(f745,plain,
rdn_positive_less(rdnn(n4),rdnn(n5)),
inference(cnf_transformation,[],[f270]) ).
fof(f750,plain,
! [X2,X0,X1] :
( rdn_positive_less(rdnn(X0),rdnn(X2))
| ~ rdn_positive_less(rdnn(X1),rdnn(X2))
| ~ rdn_positive_less(rdnn(X0),rdnn(X1)) ),
inference(cnf_transformation,[],[f428]) ).
fof(f766,plain,
! [X2,X3,X0,X1,X4,X5] :
( sum(X0,X1,X2)
| ~ rdn_translate(X2,rdn_neg(X5))
| ~ rdn_add_with_carry(rdnn(n0),X3,X5,X4)
| ~ rdn_positive_less(X3,X4)
| ~ rdn_translate(X1,rdn_neg(X4))
| ~ rdn_translate(X0,rdn_pos(X3)) ),
inference(cnf_transformation,[],[f450]) ).
fof(f775,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,[],[f464]) ).
fof(f803,plain,
rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
inference(cnf_transformation,[],[f325]) ).
fof(f830,plain,
rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
inference(cnf_transformation,[],[f352]) ).
fof(f880,plain,
! [X0] : ~ sum(n2,nn5,X0),
inference(cnf_transformation,[],[f472]) ).
cnf(c_51,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(cnf_transformation,[],[f478]) ).
cnf(c_179,plain,
rdn_translate(nn3,rdn_neg(rdnn(n3))),
inference(cnf_transformation,[],[f606]) ).
cnf(c_181,plain,
rdn_translate(nn5,rdn_neg(rdnn(n5))),
inference(cnf_transformation,[],[f608]) ).
cnf(c_316,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(cnf_transformation,[],[f743]) ).
cnf(c_317,plain,
rdn_positive_less(rdnn(n3),rdnn(n4)),
inference(cnf_transformation,[],[f744]) ).
cnf(c_318,plain,
rdn_positive_less(rdnn(n4),rdnn(n5)),
inference(cnf_transformation,[],[f745]) ).
cnf(c_323,plain,
( ~ rdn_positive_less(rdnn(X0),rdnn(X1))
| ~ rdn_positive_less(rdnn(X1),rdnn(X2))
| rdn_positive_less(rdnn(X0),rdnn(X2)) ),
inference(cnf_transformation,[],[f750]) ).
cnf(c_339,plain,
( ~ rdn_add_with_carry(rdnn(n0),X0,X1,X2)
| ~ rdn_translate(X3,rdn_pos(X0))
| ~ rdn_translate(X4,rdn_neg(X1))
| ~ rdn_translate(X5,rdn_neg(X2))
| ~ rdn_positive_less(X0,X2)
| sum(X3,X5,X4) ),
inference(cnf_transformation,[],[f766]) ).
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,[],[f775]) ).
cnf(c_376,plain,
rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
inference(cnf_transformation,[],[f803]) ).
cnf(c_403,plain,
rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
inference(cnf_transformation,[],[f830]) ).
cnf(c_453,negated_conjecture,
~ sum(n2,nn5,X0),
inference(cnf_transformation,[],[f880]) ).
cnf(c_10803,plain,
( ~ rdn_positive_less(rdnn(n3),rdnn(X0))
| rdn_positive_less(rdnn(n2),rdnn(X0)) ),
inference(superposition,[status(thm)],[c_316,c_323]) ).
cnf(c_10837,plain,
rdn_positive_less(rdnn(n2),rdnn(n4)),
inference(superposition,[status(thm)],[c_317,c_10803]) ).
cnf(c_10838,plain,
( ~ rdn_positive_less(rdnn(n4),rdnn(X0))
| rdn_positive_less(rdnn(n2),rdnn(X0)) ),
inference(superposition,[status(thm)],[c_10837,c_323]) ).
cnf(c_10843,plain,
rdn_positive_less(rdnn(n2),rdnn(n5)),
inference(superposition,[status(thm)],[c_318,c_10838]) ).
cnf(c_43407,plain,
( ~ rdn_digit_add(rdnn(n5),rdnn(X0),rdnn(X1),rdnn(n0))
| rdn_add_with_carry(rdnn(X0),rdnn(n2),rdnn(n3),rdnn(X1)) ),
inference(superposition,[status(thm)],[c_376,c_348]) ).
cnf(c_43653,plain,
rdn_add_with_carry(rdnn(n0),rdnn(n2),rdnn(n3),rdnn(n5)),
inference(superposition,[status(thm)],[c_403,c_43407]) ).
cnf(c_43863,plain,
( ~ rdn_translate(X0,rdn_pos(rdnn(n2)))
| ~ rdn_translate(X1,rdn_neg(rdnn(n3)))
| ~ rdn_translate(X2,rdn_neg(rdnn(n5)))
| ~ rdn_positive_less(rdnn(n2),rdnn(n5))
| sum(X0,X2,X1) ),
inference(superposition,[status(thm)],[c_43653,c_339]) ).
cnf(c_43869,plain,
( ~ rdn_translate(X2,rdn_neg(rdnn(n5)))
| ~ rdn_translate(X1,rdn_neg(rdnn(n3)))
| ~ rdn_translate(X0,rdn_pos(rdnn(n2)))
| sum(X0,X2,X1) ),
inference(global_subsumption_just,[status(thm)],[c_43863,c_10843,c_43863]) ).
cnf(c_43870,plain,
( ~ rdn_translate(X0,rdn_pos(rdnn(n2)))
| ~ rdn_translate(X1,rdn_neg(rdnn(n3)))
| ~ rdn_translate(X2,rdn_neg(rdnn(n5)))
| sum(X0,X2,X1) ),
inference(renaming,[status(thm)],[c_43869]) ).
cnf(c_44266,plain,
( ~ rdn_translate(X0,rdn_neg(rdnn(n3)))
| ~ rdn_translate(X1,rdn_neg(rdnn(n5)))
| sum(n2,X1,X0) ),
inference(superposition,[status(thm)],[c_51,c_43870]) ).
cnf(c_44521,plain,
( ~ rdn_translate(X0,rdn_neg(rdnn(n5)))
| sum(n2,X0,nn3) ),
inference(superposition,[status(thm)],[c_179,c_44266]) ).
cnf(c_44674,plain,
sum(n2,nn5,nn3),
inference(superposition,[status(thm)],[c_181,c_44521]) ).
cnf(c_45058,plain,
$false,
inference(superposition,[status(thm)],[c_44674,c_453]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM320+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n008.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 : Fri Aug 25 11:08:17 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 66.30/9.80 % SZS status Started for theBenchmark.p
% 66.30/9.80 % SZS status Theorem for theBenchmark.p
% 66.30/9.80
% 66.30/9.80 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 66.30/9.80
% 66.30/9.80 ------ iProver source info
% 66.30/9.80
% 66.30/9.80 git: date: 2023-05-31 18:12:56 +0000
% 66.30/9.80 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 66.30/9.80 git: non_committed_changes: false
% 66.30/9.80 git: last_make_outside_of_git: false
% 66.30/9.80
% 66.30/9.80 ------ Parsing...
% 66.30/9.80 ------ Clausification by vclausify_rel & Parsing by iProver...
% 66.30/9.80
% 66.30/9.80 ------ 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
% 66.30/9.80
% 66.30/9.80 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 66.30/9.80
% 66.30/9.80 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 66.30/9.80 ------ Proving...
% 66.30/9.80 ------ Problem Properties
% 66.30/9.80
% 66.30/9.80
% 66.30/9.80 clauses 402
% 66.30/9.80 conjectures 1
% 66.30/9.80 EPR 8
% 66.30/9.80 Horn 400
% 66.30/9.80 unary 376
% 66.30/9.80 binary 6
% 66.30/9.80 lits 472
% 66.30/9.80 lits eq 5
% 66.30/9.80 fd_pure 0
% 66.30/9.80 fd_pseudo 0
% 66.30/9.80 fd_cond 0
% 66.30/9.80 fd_pseudo_cond 5
% 66.30/9.80 AC symbols 0
% 66.30/9.80
% 66.30/9.80 ------ Input Options Time Limit: Unbounded
% 66.30/9.80
% 66.30/9.80
% 66.30/9.80 ------
% 66.30/9.80 Current options:
% 66.30/9.80 ------
% 66.30/9.80
% 66.30/9.80
% 66.30/9.80
% 66.30/9.80
% 66.30/9.80 ------ Proving...
% 66.30/9.80
% 66.30/9.80
% 66.30/9.80 % SZS status Theorem for theBenchmark.p
% 66.30/9.80
% 66.30/9.80 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 66.30/9.80
% 66.30/9.81
%------------------------------------------------------------------------------