TSTP Solution File: RNG125+4 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : RNG125+4 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n002.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 13:55:27 EDT 2023
% Result : Theorem 0.99s 1.17s
% Output : CNFRefutation 0.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 5 unt; 0 def)
% Number of atoms : 83 ( 20 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 98 ( 39 ~; 23 |; 34 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn; 6 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f46,axiom,
~ ( ( aDivisorOf0(xu,xb)
| doDivides0(xu,xb)
| ? [X0] :
( xb = sdtasdt0(xu,X0)
& aElement0(X0) ) )
& ( aDivisorOf0(xu,xa)
| doDivides0(xu,xa)
| ? [X0] :
( xa = sdtasdt0(xu,X0)
& aElement0(X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2383) ).
fof(f48,axiom,
~ ~ ( doDivides0(xu,xa)
& ? [X0] :
( xa = sdtasdt0(xu,X0)
& aElement0(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2479) ).
fof(f49,axiom,
~ ~ ( doDivides0(xu,xb)
& ? [X0] :
( xb = sdtasdt0(xu,X0)
& aElement0(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2612) ).
fof(f64,plain,
~ ( ( aDivisorOf0(xu,xb)
| doDivides0(xu,xb)
| ? [X0] :
( xb = sdtasdt0(xu,X0)
& aElement0(X0) ) )
& ( aDivisorOf0(xu,xa)
| doDivides0(xu,xa)
| ? [X1] :
( xa = sdtasdt0(xu,X1)
& aElement0(X1) ) ) ),
inference(rectify,[],[f46]) ).
fof(f65,plain,
( doDivides0(xu,xa)
& ? [X0] :
( xa = sdtasdt0(xu,X0)
& aElement0(X0) ) ),
inference(flattening,[],[f48]) ).
fof(f66,plain,
( doDivides0(xu,xb)
& ? [X0] :
( xb = sdtasdt0(xu,X0)
& aElement0(X0) ) ),
inference(flattening,[],[f49]) ).
fof(f123,plain,
( ( ~ aDivisorOf0(xu,xb)
& ~ doDivides0(xu,xb)
& ! [X0] :
( xb != sdtasdt0(xu,X0)
| ~ aElement0(X0) ) )
| ( ~ aDivisorOf0(xu,xa)
& ~ doDivides0(xu,xa)
& ! [X1] :
( xa != sdtasdt0(xu,X1)
| ~ aElement0(X1) ) ) ),
inference(ennf_transformation,[],[f64]) ).
fof(f130,plain,
( ( ~ aDivisorOf0(xu,xa)
& ~ doDivides0(xu,xa)
& ! [X1] :
( xa != sdtasdt0(xu,X1)
| ~ aElement0(X1) ) )
| ~ sP4 ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP4])]) ).
fof(f131,plain,
( ( ~ aDivisorOf0(xu,xb)
& ~ doDivides0(xu,xb)
& ! [X0] :
( xb != sdtasdt0(xu,X0)
| ~ aElement0(X0) ) )
| sP4 ),
inference(definition_folding,[],[f123,f130]) ).
fof(f209,plain,
( ( ~ aDivisorOf0(xu,xa)
& ~ doDivides0(xu,xa)
& ! [X1] :
( xa != sdtasdt0(xu,X1)
| ~ aElement0(X1) ) )
| ~ sP4 ),
inference(nnf_transformation,[],[f130]) ).
fof(f210,plain,
( ( ~ aDivisorOf0(xu,xa)
& ~ doDivides0(xu,xa)
& ! [X0] :
( xa != sdtasdt0(xu,X0)
| ~ aElement0(X0) ) )
| ~ sP4 ),
inference(rectify,[],[f209]) ).
fof(f213,plain,
( ? [X0] :
( xa = sdtasdt0(xu,X0)
& aElement0(X0) )
=> ( xa = sdtasdt0(xu,sK45)
& aElement0(sK45) ) ),
introduced(choice_axiom,[]) ).
fof(f214,plain,
( doDivides0(xu,xa)
& xa = sdtasdt0(xu,sK45)
& aElement0(sK45) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK45])],[f65,f213]) ).
fof(f215,plain,
( ? [X0] :
( xb = sdtasdt0(xu,X0)
& aElement0(X0) )
=> ( xb = sdtasdt0(xu,sK46)
& aElement0(sK46) ) ),
introduced(choice_axiom,[]) ).
fof(f216,plain,
( doDivides0(xu,xb)
& xb = sdtasdt0(xu,sK46)
& aElement0(sK46) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK46])],[f66,f215]) ).
fof(f377,plain,
( ~ doDivides0(xu,xa)
| ~ sP4 ),
inference(cnf_transformation,[],[f210]) ).
fof(f380,plain,
( ~ doDivides0(xu,xb)
| sP4 ),
inference(cnf_transformation,[],[f131]) ).
fof(f387,plain,
doDivides0(xu,xa),
inference(cnf_transformation,[],[f214]) ).
fof(f390,plain,
doDivides0(xu,xb),
inference(cnf_transformation,[],[f216]) ).
cnf(c_209,plain,
( ~ doDivides0(xu,xa)
| ~ sP4 ),
inference(cnf_transformation,[],[f377]) ).
cnf(c_212,plain,
( ~ doDivides0(xu,xb)
| sP4 ),
inference(cnf_transformation,[],[f380]) ).
cnf(c_217,plain,
doDivides0(xu,xa),
inference(cnf_transformation,[],[f387]) ).
cnf(c_220,plain,
doDivides0(xu,xb),
inference(cnf_transformation,[],[f390]) ).
cnf(c_225,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_209,c_212,c_217,c_220]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : RNG125+4 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.15/0.35 % Computer : n002.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun Aug 27 02:41:33 EDT 2023
% 0.15/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
% 0.99/1.17 % SZS status Started for theBenchmark.p
% 0.99/1.17 % SZS status Theorem for theBenchmark.p
% 0.99/1.17
% 0.99/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.99/1.17
% 0.99/1.17 ------ iProver source info
% 0.99/1.17
% 0.99/1.17 git: date: 2023-05-31 18:12:56 +0000
% 0.99/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.99/1.17 git: non_committed_changes: false
% 0.99/1.17 git: last_make_outside_of_git: false
% 0.99/1.17
% 0.99/1.17 ------ Parsing...
% 0.99/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.99/1.17
% 0.99/1.17 ------ Preprocessing...
% 0.99/1.17
% 0.99/1.17 % SZS status Theorem for theBenchmark.p
% 0.99/1.17
% 0.99/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.99/1.17
% 0.99/1.17
%------------------------------------------------------------------------------