TSTP Solution File: NUM290+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM290+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.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:34 EDT 2024
% Result : Theorem 4.37s 1.20s
% Output : CNFRefutation 4.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 15 unt; 0 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 58 ( 28 ~; 24 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 32 ( 0 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
rdn_translate(n2,rdn_pos(rdnn(n2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn2) ).
fof(f4,axiom,
rdn_translate(n3,rdn_pos(rdnn(n3))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn3) ).
fof(f268,axiom,
rdn_positive_less(rdnn(n2),rdnn(n3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdn_positive_less23) ).
fof(f281,axiom,
! [X0,X1,X9,X10] :
( ( rdn_positive_less(X9,X10)
& rdn_translate(X1,rdn_pos(X10))
& rdn_translate(X0,rdn_pos(X9)) )
=> less(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_entry_point_pos_pos) ).
fof(f402,conjecture,
less(n2,n3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n2_less_n3) ).
fof(f403,negated_conjecture,
~ less(n2,n3),
inference(negated_conjecture,[],[f402]) ).
fof(f408,plain,
! [X0,X1,X2,X3] :
( ( rdn_positive_less(X2,X3)
& rdn_translate(X1,rdn_pos(X3))
& rdn_translate(X0,rdn_pos(X2)) )
=> less(X0,X1) ),
inference(rectify,[],[f281]) ).
fof(f425,plain,
~ less(n2,n3),
inference(flattening,[],[f403]) ).
fof(f435,plain,
! [X0,X1,X2,X3] :
( less(X0,X1)
| ~ rdn_positive_less(X2,X3)
| ~ rdn_translate(X1,rdn_pos(X3))
| ~ rdn_translate(X0,rdn_pos(X2)) ),
inference(ennf_transformation,[],[f408]) ).
fof(f436,plain,
! [X0,X1,X2,X3] :
( less(X0,X1)
| ~ rdn_positive_less(X2,X3)
| ~ rdn_translate(X1,rdn_pos(X3))
| ~ rdn_translate(X0,rdn_pos(X2)) ),
inference(flattening,[],[f435]) ).
fof(f477,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(cnf_transformation,[],[f3]) ).
fof(f478,plain,
rdn_translate(n3,rdn_pos(rdnn(n3))),
inference(cnf_transformation,[],[f4]) ).
fof(f742,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(cnf_transformation,[],[f268]) ).
fof(f755,plain,
! [X2,X3,X0,X1] :
( less(X0,X1)
| ~ rdn_positive_less(X2,X3)
| ~ rdn_translate(X1,rdn_pos(X3))
| ~ rdn_translate(X0,rdn_pos(X2)) ),
inference(cnf_transformation,[],[f436]) ).
fof(f879,plain,
~ less(n2,n3),
inference(cnf_transformation,[],[f425]) ).
cnf(c_51,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(cnf_transformation,[],[f477]) ).
cnf(c_52,plain,
rdn_translate(n3,rdn_pos(rdnn(n3))),
inference(cnf_transformation,[],[f478]) ).
cnf(c_316,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(cnf_transformation,[],[f742]) ).
cnf(c_329,plain,
( ~ rdn_translate(X0,rdn_pos(X1))
| ~ rdn_translate(X2,rdn_pos(X3))
| ~ rdn_positive_less(X1,X3)
| less(X0,X2) ),
inference(cnf_transformation,[],[f755]) ).
cnf(c_453,negated_conjecture,
~ less(n2,n3),
inference(cnf_transformation,[],[f879]) ).
cnf(c_1003,plain,
( less(X0,X1)
| ~ rdn_translate(X0,rdn_pos(X2))
| ~ sP0_iProver_def(X1,X2) ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_def])],[c_329]) ).
cnf(c_1004,plain,
( ~ rdn_translate(X0,rdn_pos(X1))
| ~ rdn_positive_less(X2,X1)
| sP0_iProver_def(X0,X2) ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_329]) ).
cnf(c_1453,plain,
( ~ rdn_translate(n2,rdn_pos(X0))
| ~ sP0_iProver_def(n3,X0)
| less(n2,n3) ),
inference(instantiation,[status(thm)],[c_1003]) ).
cnf(c_1459,plain,
( ~ rdn_translate(n2,rdn_pos(rdnn(n2)))
| ~ sP0_iProver_def(n3,rdnn(n2))
| less(n2,n3) ),
inference(instantiation,[status(thm)],[c_1453]) ).
cnf(c_1518,plain,
( ~ rdn_translate(n3,rdn_pos(X0))
| ~ rdn_positive_less(rdnn(n2),X0)
| sP0_iProver_def(n3,rdnn(n2)) ),
inference(instantiation,[status(thm)],[c_1004]) ).
cnf(c_1585,plain,
( ~ rdn_translate(n3,rdn_pos(rdnn(n3)))
| ~ rdn_positive_less(rdnn(n2),rdnn(n3))
| sP0_iProver_def(n3,rdnn(n2)) ),
inference(instantiation,[status(thm)],[c_1518]) ).
cnf(c_1586,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1585,c_1459,c_51,c_52,c_316,c_453]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUM290+1 : TPTP v8.1.2. Released v3.1.0.
% 0.04/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n021.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 : Thu May 2 19:35:13 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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
% 4.37/1.20 % SZS status Started for theBenchmark.p
% 4.37/1.20 % SZS status Theorem for theBenchmark.p
% 4.37/1.20
% 4.37/1.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.37/1.20
% 4.37/1.20 ------ iProver source info
% 4.37/1.20
% 4.37/1.20 git: date: 2024-05-02 19:28:25 +0000
% 4.37/1.20 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.37/1.20 git: non_committed_changes: false
% 4.37/1.20
% 4.37/1.20 ------ Parsing...
% 4.37/1.20 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.37/1.20
% 4.37/1.20 ------ Preprocessing... sup_sim: 0 pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 pe_s pe_e
% 4.37/1.20
% 4.37/1.20 ------ Preprocessing... gs_s sp: 0 0s gs_e scvd_s sp: 19 0s scvd_e snvd_s sp: 0 0s snvd_e
% 4.37/1.20
% 4.37/1.20 ------ Preprocessing...
% 4.37/1.20 ------ Proving...
% 4.37/1.20 ------ Problem Properties
% 4.37/1.20
% 4.37/1.20
% 4.37/1.20 clauses 418
% 4.37/1.20 conjectures 1
% 4.37/1.20 EPR 10
% 4.37/1.20 Horn 410
% 4.37/1.20 unary 376
% 4.37/1.20 binary 8
% 4.37/1.20 lits 503
% 4.37/1.20 lits eq 5
% 4.37/1.20 fd_pure 0
% 4.37/1.20 fd_pseudo 0
% 4.37/1.20 fd_cond 0
% 4.37/1.20 fd_pseudo_cond 5
% 4.37/1.20 AC symbols 0
% 4.37/1.20
% 4.37/1.20 ------ Input Options Time Limit: Unbounded
% 4.37/1.20
% 4.37/1.20
% 4.37/1.20 ------
% 4.37/1.20 Current options:
% 4.37/1.20 ------
% 4.37/1.20
% 4.37/1.20
% 4.37/1.20
% 4.37/1.20
% 4.37/1.20 ------ Proving...
% 4.37/1.20
% 4.37/1.20
% 4.37/1.20 % SZS status Theorem for theBenchmark.p
% 4.37/1.20
% 4.37/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.37/1.20
% 4.37/1.20
%------------------------------------------------------------------------------