%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : RNG125+4 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 02:39:14 PM UTC 2026
% Result : Theorem 0.31s 1.10s
% Output : CNFRefutation 0.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 5 unt; 1 def)
% Number of atoms : 75 ( 16 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 92 ( 39 ~; 23 |; 30 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 0 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% 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 : 14 ( 0 sgn 6 !; 8 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
fof(f46,axiom,
~ ( ( aDivisorOf0(xu,xb)
| doDivides0(xu,xb)
| ? [X0] :
( sdtasdt0(xu,X0) = xb
& aElement0(X0) ) )
& ( aDivisorOf0(xu,xa)
| doDivides0(xu,xa)
| ? [X0] :
( sdtasdt0(xu,X0) = xa
& aElement0(X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2383) ).
fof(f48,axiom,
~ ~ ( doDivides0(xu,xa)
& ? [X0] :
( sdtasdt0(xu,X0) = xa
& aElement0(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2479) ).
fof(f49,axiom,
~ ~ ( doDivides0(xu,xb)
& ? [X0] :
( sdtasdt0(xu,X0) = xb
& aElement0(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2612) ).
fof(f64,plain,
~ ( ( aDivisorOf0(xu,xb)
| doDivides0(xu,xb)
| ? [X1] :
( xb = sdtasdt0(xu,X1)
& aElement0(X1) ) )
& ( aDivisorOf0(xu,xa)
| doDivides0(xu,xa)
| ? [X0] :
( sdtasdt0(xu,X0) = xa
& aElement0(X0) ) ) ),
inference(rectify,[],[f46]) ).
fof(f65,plain,
( doDivides0(xu,xa)
& ? [X0] :
( sdtasdt0(xu,X0) = xa
& aElement0(X0) ) ),
inference(flattening,[],[f48]) ).
fof(f66,plain,
( doDivides0(xu,xb)
& ? [X0] :
( sdtasdt0(xu,X0) = xb
& aElement0(X0) ) ),
inference(flattening,[],[f49]) ).
fof(f123,plain,
( ( ~ aDivisorOf0(xu,xb)
& ~ doDivides0(xu,xb)
& ! [X1] :
( xb != sdtasdt0(xu,X1)
| ~ aElement0(X1) ) )
| ( ~ aDivisorOf0(xu,xa)
& ~ doDivides0(xu,xa)
& ! [X0] :
( xa != sdtasdt0(xu,X0)
| ~ aElement0(X0) ) ) ),
inference(ennf_transformation,[],[f64]) ).
fof(f182,plain,
( doDivides0(xu,xa)
& xa = sdtasdt0(xu,sK45)
& aElement0(sK45) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK45]),skolemize(X0,sK45)],[f65]) ).
fof(f183,plain,
( doDivides0(xu,xb)
& xb = sdtasdt0(xu,sK46)
& aElement0(sK46) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK46]),skolemize(X0,sK46)],[f66]) ).
fof(f347,plain,
( sP4
| ~ doDivides0(xu,xa) ),
inference(cnf_transformation,[],[f131]) ).
fof(f352,plain,
doDivides0(xu,xa),
inference(cnf_transformation,[],[f182]) ).
fof(f355,plain,
doDivides0(xu,xb),
inference(cnf_transformation,[],[f183]) ).
tcf(c_212,plain,
( sP4
| ~ doDivides0(xu,xa) ),
inference(cnf_transformation,[],[f347]) ).
tcf(c_219,plain,
doDivides0(xu,xa),
inference(cnf_transformation,[],[f352]) ).
tcf(c_222,plain,
doDivides0(xu,xb),
inference(cnf_transformation,[],[f355]) ).
fof(f130,definition,
( ~ sP4
| ( ~ aDivisorOf0(xu,xb)
& ~ doDivides0(xu,xb)
& ! [X1] :
( xb != sdtasdt0(xu,X1)
| ~ aElement0(X1) ) ) ),
introduced(definition,[new_symbols(definition,[sP4])],[predicate_definition_introduction]) ).
fof(f131,plain,
( sP4
| ( ~ aDivisorOf0(xu,xa)
& ~ doDivides0(xu,xa)
& ! [X0] :
( xa != sdtasdt0(xu,X0)
| ~ aElement0(X0) ) ) ),
inference(definition_folding,[],[f123,f130]) ).
fof(f179,plain,
( ~ sP4
| ( ~ aDivisorOf0(xu,xb)
& ~ doDivides0(xu,xb)
& ! [X1] :
( xb != sdtasdt0(xu,X1)
| ~ aElement0(X1) ) ) ),
inference(nnf_transformation,[],[f130]) ).
fof(f180,plain,
( ~ sP4
| ( ~ aDivisorOf0(xu,xb)
& ~ doDivides0(xu,xb)
& ! [X0] :
( xb != sdtasdt0(xu,X0)
| ~ aElement0(X0) ) ) ),
inference(rectify,[],[f179]) ).
fof(f344,plain,
( ~ sP4
| ~ doDivides0(xu,xb) ),
inference(cnf_transformation,[],[f180]) ).
tcf(c_209,plain,
( ~ sP4
| ~ doDivides0(xu,xb) ),
inference(cnf_transformation,[],[f344]) ).
tcf(c_225,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_209,c_212,c_219,c_222]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : RNG125+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.03/0.29 % Computer : n012.cluster.edu
% 0.03/0.29 % Model : x86_64 x86_64
% 0.03/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.29 % Memory : 8046.5625MB
% 0.03/0.29 % OS : Linux 6.8.0-71-generic
% 0.03/0.29 % CPULimit : 300
% 0.03/0.29 % WCLimit : 300
% 0.03/0.29 % DateTime : Thu Sep 24 08:21:21 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.03/0.33 Running first-order theorem proving
% 0.03/0.33 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.34
% 0.03/0.34 % ======== iProver multi-core TPTP/SMT =========
% 0.03/0.34
% 0.03/0.34 % Detected problem language: tptp
% 0.03/0.36 % Proving...
% 0.31/1.10 % SZS status Started for theBenchmark.p
% 0.31/1.10 % SZS status Theorem for theBenchmark.p
% 0.31/1.10
% 0.31/1.10 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.31/1.10
% 0.31/1.10 % ------ iProver source info
% 0.31/1.10
% 0.31/1.10 % git: date: 2026-07-19 20:42:38 +0200
% 0.31/1.10 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.31/1.10 % git: non_committed_changes: false
% 0.31/1.10
% 0.31/1.10 % ------ Parsing...
% 0.31/1.10 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.31/1.10
% 0.31/1.10 % ------ Preprocessing...%
% 0.31/1.10
% 0.31/1.10 % SZS status Theorem for theBenchmark.p
% 0.31/1.10
% 0.31/1.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.31/1.10
% 0.31/1.10
%------------------------------------------------------------------------------