TSTP Solution File: NUM344+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM344+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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:43 EDT 2024
% Result : Theorem 7.34s 1.64s
% Output : CNFRefutation 7.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 41 ( 14 unt; 0 def)
% Number of atoms : 93 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 93 ( 41 ~; 36 |; 10 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-1 aty)
% Number of variables : 88 ( 8 sgn 64 !; 4 ?)
% 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(f129,axiom,
rdn_translate(nn1,rdn_neg(rdnn(n1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdnn1) ).
fof(f282,axiom,
! [X0,X1,X9,X10] :
( ( rdn_translate(X1,rdn_pos(X10))
& rdn_translate(X0,rdn_neg(X9)) )
=> less(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_entry_point_neg_pos) ).
fof(f291,axiom,
! [X12,X13,X9] :
( ( rdn_translate(X13,rdn_neg(X9))
& rdn_translate(X12,rdn_pos(X9)) )
=> sum(X12,X13,n0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_entry_point_posx_negx) ).
fof(f292,axiom,
! [X0,X1,X2,X9,X10] :
( ( sum(X1,X0,X2)
& rdn_translate(X1,rdn_pos(X10))
& rdn_translate(X0,rdn_neg(X9)) )
=> sum(X0,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_entry_point_neg_pos) ).
fof(f402,conjecture,
? [X0,X1] :
( less(X0,X1)
& sum(X0,n1,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',exist_bigger_plus_one) ).
fof(f403,negated_conjecture,
~ ? [X0,X1] :
( less(X0,X1)
& sum(X0,n1,X1) ),
inference(negated_conjecture,[],[f402]) ).
fof(f409,plain,
! [X0,X1,X2,X3] :
( ( rdn_translate(X1,rdn_pos(X3))
& rdn_translate(X0,rdn_neg(X2)) )
=> less(X0,X1) ),
inference(rectify,[],[f282]) ).
fof(f415,plain,
! [X0,X1,X2] :
( ( rdn_translate(X1,rdn_neg(X2))
& rdn_translate(X0,rdn_pos(X2)) )
=> sum(X0,X1,n0) ),
inference(rectify,[],[f291]) ).
fof(f416,plain,
! [X0,X1,X2,X3,X4] :
( ( sum(X1,X0,X2)
& rdn_translate(X1,rdn_pos(X4))
& rdn_translate(X0,rdn_neg(X3)) )
=> sum(X0,X1,X2) ),
inference(rectify,[],[f292]) ).
fof(f436,plain,
! [X0,X1,X2,X3] :
( less(X0,X1)
| ~ rdn_translate(X1,rdn_pos(X3))
| ~ rdn_translate(X0,rdn_neg(X2)) ),
inference(ennf_transformation,[],[f409]) ).
fof(f437,plain,
! [X0,X1,X2,X3] :
( less(X0,X1)
| ~ rdn_translate(X1,rdn_pos(X3))
| ~ rdn_translate(X0,rdn_neg(X2)) ),
inference(flattening,[],[f436]) ).
fof(f452,plain,
! [X0,X1,X2] :
( sum(X0,X1,n0)
| ~ rdn_translate(X1,rdn_neg(X2))
| ~ rdn_translate(X0,rdn_pos(X2)) ),
inference(ennf_transformation,[],[f415]) ).
fof(f453,plain,
! [X0,X1,X2] :
( sum(X0,X1,n0)
| ~ rdn_translate(X1,rdn_neg(X2))
| ~ rdn_translate(X0,rdn_pos(X2)) ),
inference(flattening,[],[f452]) ).
fof(f454,plain,
! [X0,X1,X2,X3,X4] :
( sum(X0,X1,X2)
| ~ sum(X1,X0,X2)
| ~ rdn_translate(X1,rdn_pos(X4))
| ~ rdn_translate(X0,rdn_neg(X3)) ),
inference(ennf_transformation,[],[f416]) ).
fof(f455,plain,
! [X0,X1,X2,X3,X4] :
( sum(X0,X1,X2)
| ~ sum(X1,X0,X2)
| ~ rdn_translate(X1,rdn_pos(X4))
| ~ rdn_translate(X0,rdn_neg(X3)) ),
inference(flattening,[],[f454]) ).
fof(f471,plain,
! [X0,X1] :
( ~ less(X0,X1)
| ~ sum(X0,n1,X1) ),
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(f603,plain,
rdn_translate(nn1,rdn_neg(rdnn(n1))),
inference(cnf_transformation,[],[f129]) ).
fof(f756,plain,
! [X2,X3,X0,X1] :
( less(X0,X1)
| ~ rdn_translate(X1,rdn_pos(X3))
| ~ rdn_translate(X0,rdn_neg(X2)) ),
inference(cnf_transformation,[],[f437]) ).
fof(f767,plain,
! [X2,X0,X1] :
( sum(X0,X1,n0)
| ~ rdn_translate(X1,rdn_neg(X2))
| ~ rdn_translate(X0,rdn_pos(X2)) ),
inference(cnf_transformation,[],[f453]) ).
fof(f768,plain,
! [X2,X3,X0,X1,X4] :
( sum(X0,X1,X2)
| ~ sum(X1,X0,X2)
| ~ rdn_translate(X1,rdn_pos(X4))
| ~ rdn_translate(X0,rdn_neg(X3)) ),
inference(cnf_transformation,[],[f455]) ).
fof(f879,plain,
! [X0,X1] :
( ~ less(X0,X1)
| ~ sum(X0,n1,X1) ),
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_177,plain,
rdn_translate(nn1,rdn_neg(rdnn(n1))),
inference(cnf_transformation,[],[f603]) ).
cnf(c_330,plain,
( ~ rdn_translate(X0,rdn_neg(X1))
| ~ rdn_translate(X2,rdn_pos(X3))
| less(X0,X2) ),
inference(cnf_transformation,[],[f756]) ).
cnf(c_341,plain,
( ~ rdn_translate(X0,rdn_pos(X1))
| ~ rdn_translate(X2,rdn_neg(X1))
| sum(X0,X2,n0) ),
inference(cnf_transformation,[],[f767]) ).
cnf(c_342,plain,
( ~ sum(X0,X1,X2)
| ~ rdn_translate(X0,rdn_pos(X4))
| ~ rdn_translate(X1,rdn_neg(X3))
| sum(X1,X0,X2) ),
inference(cnf_transformation,[],[f768]) ).
cnf(c_453,negated_conjecture,
( ~ sum(X0,n1,X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f879]) ).
cnf(c_5209,plain,
( ~ rdn_translate(X0,rdn_neg(X1))
| less(X0,n0) ),
inference(superposition,[status(thm)],[c_49,c_330]) ).
cnf(c_5250,plain,
( ~ rdn_translate(X0,rdn_neg(rdnn(n1)))
| sum(n1,X0,n0) ),
inference(superposition,[status(thm)],[c_50,c_341]) ).
cnf(c_5511,plain,
less(nn1,n0),
inference(superposition,[status(thm)],[c_177,c_5209]) ).
cnf(c_5522,plain,
sum(n1,nn1,n0),
inference(superposition,[status(thm)],[c_177,c_5250]) ).
cnf(c_5800,plain,
( ~ rdn_translate(n1,rdn_pos(X0))
| ~ rdn_translate(nn1,rdn_neg(X1))
| sum(nn1,n1,n0) ),
inference(superposition,[status(thm)],[c_5522,c_342]) ).
cnf(c_6097,plain,
( ~ rdn_translate(nn1,rdn_neg(X0))
| sum(nn1,n1,n0) ),
inference(superposition,[status(thm)],[c_50,c_5800]) ).
cnf(c_6243,plain,
sum(nn1,n1,n0),
inference(superposition,[status(thm)],[c_177,c_6097]) ).
cnf(c_6275,plain,
~ less(nn1,n0),
inference(superposition,[status(thm)],[c_6243,c_453]) ).
cnf(c_6280,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_5511,c_6275]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : NUM344+1 : TPTP v8.1.2. Released v3.1.0.
% 0.10/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n006.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 19:18:34 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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.34/1.64 % SZS status Started for theBenchmark.p
% 7.34/1.64 % SZS status Theorem for theBenchmark.p
% 7.34/1.64
% 7.34/1.64 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.34/1.64
% 7.34/1.64 ------ iProver source info
% 7.34/1.64
% 7.34/1.64 git: date: 2024-05-02 19:28:25 +0000
% 7.34/1.64 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.34/1.64 git: non_committed_changes: false
% 7.34/1.64
% 7.34/1.64 ------ Parsing...
% 7.34/1.64 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.34/1.64
% 7.34/1.64 ------ 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.34/1.64
% 7.34/1.64 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.34/1.64
% 7.34/1.64 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.34/1.64 ------ Proving...
% 7.34/1.64 ------ Problem Properties
% 7.34/1.64
% 7.34/1.64
% 7.34/1.64 clauses 402
% 7.34/1.64 conjectures 1
% 7.34/1.64 EPR 8
% 7.34/1.64 Horn 400
% 7.34/1.64 unary 375
% 7.34/1.64 binary 7
% 7.34/1.64 lits 473
% 7.34/1.64 lits eq 5
% 7.34/1.64 fd_pure 0
% 7.34/1.64 fd_pseudo 0
% 7.34/1.64 fd_cond 0
% 7.34/1.64 fd_pseudo_cond 5
% 7.34/1.64 AC symbols 0
% 7.34/1.64
% 7.34/1.64 ------ Input Options Time Limit: Unbounded
% 7.34/1.64
% 7.34/1.64
% 7.34/1.64 ------
% 7.34/1.64 Current options:
% 7.34/1.64 ------
% 7.34/1.64
% 7.34/1.64
% 7.34/1.64
% 7.34/1.64
% 7.34/1.64 ------ Proving...
% 7.34/1.64
% 7.34/1.64
% 7.34/1.64 ------ Proving...
% 7.34/1.64
% 7.34/1.64
% 7.34/1.64 % SZS status Theorem for theBenchmark.p
% 7.34/1.64
% 7.34/1.64 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.34/1.64
% 7.34/1.64
%------------------------------------------------------------------------------