TSTP Solution File: RNG125+4 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : RNG125+4 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n018.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 : Wed May 31 12:32:59 EDT 2023
% Result : Theorem 0.07s 0.29s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 25 ( 5 unt; 0 def)
% Number of atoms : 70 ( 11 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 79 ( 34 ~; 20 |; 21 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 9 (; 5 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f46,hypothesis,
~ ( ( ? [W0] :
( aElement0(W0)
& sdtasdt0(xu,W0) = xa )
| doDivides0(xu,xa)
| aDivisorOf0(xu,xa) )
& ( ? [W0] :
( aElement0(W0)
& sdtasdt0(xu,W0) = xb )
| doDivides0(xu,xb)
| aDivisorOf0(xu,xb) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f48,hypothesis,
~ ~ ( ? [W0] :
( aElement0(W0)
& sdtasdt0(xu,W0) = xa )
& doDivides0(xu,xa) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f49,hypothesis,
~ ~ ( ? [W0] :
( aElement0(W0)
& sdtasdt0(xu,W0) = xb )
& doDivides0(xu,xb) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f280,plain,
( ( ! [W0] :
( ~ aElement0(W0)
| sdtasdt0(xu,W0) != xa )
& ~ doDivides0(xu,xa)
& ~ aDivisorOf0(xu,xa) )
| ( ! [W0] :
( ~ aElement0(W0)
| sdtasdt0(xu,W0) != xb )
& ~ doDivides0(xu,xb)
& ~ aDivisorOf0(xu,xb) ) ),
inference(pre_NNF_transformation,[status(esa)],[f46]) ).
fof(f281,plain,
( pd0_4
=> ( ! [W0] :
( ~ aElement0(W0)
| sdtasdt0(xu,W0) != xa )
& ~ doDivides0(xu,xa)
& ~ aDivisorOf0(xu,xa) ) ),
introduced(predicate_definition,[f280]) ).
fof(f282,plain,
( pd0_4
| ( ! [W0] :
( ~ aElement0(W0)
| sdtasdt0(xu,W0) != xb )
& ~ doDivides0(xu,xb)
& ~ aDivisorOf0(xu,xb) ) ),
inference(formula_renaming,[status(thm)],[f280,f281]) ).
fof(f284,plain,
( pd0_4
| ~ doDivides0(xu,xb) ),
inference(cnf_transformation,[status(esa)],[f282]) ).
fof(f290,plain,
( aElement0(sk0_40)
& sdtasdt0(xu,sk0_40) = xa
& doDivides0(xu,xa) ),
inference(skolemization,[status(esa)],[f48]) ).
fof(f293,plain,
doDivides0(xu,xa),
inference(cnf_transformation,[status(esa)],[f290]) ).
fof(f294,plain,
( aElement0(sk0_41)
& sdtasdt0(xu,sk0_41) = xb
& doDivides0(xu,xb) ),
inference(skolemization,[status(esa)],[f49]) ).
fof(f297,plain,
doDivides0(xu,xb),
inference(cnf_transformation,[status(esa)],[f294]) ).
fof(f317,plain,
( ~ pd0_4
| ( ! [W0] :
( ~ aElement0(W0)
| sdtasdt0(xu,W0) != xa )
& ~ doDivides0(xu,xa)
& ~ aDivisorOf0(xu,xa) ) ),
inference(pre_NNF_transformation,[status(esa)],[f281]) ).
fof(f319,plain,
( ~ pd0_4
| ~ doDivides0(xu,xa) ),
inference(cnf_transformation,[status(esa)],[f317]) ).
fof(f332,plain,
( spl0_2
<=> pd0_4 ),
introduced(split_symbol_definition) ).
fof(f339,plain,
( spl0_4
<=> doDivides0(xu,xb) ),
introduced(split_symbol_definition) ).
fof(f341,plain,
( ~ doDivides0(xu,xb)
| spl0_4 ),
inference(component_clause,[status(thm)],[f339]) ).
fof(f342,plain,
( spl0_2
| ~ spl0_4 ),
inference(split_clause,[status(thm)],[f284,f332,f339]) ).
fof(f351,plain,
( spl0_7
<=> doDivides0(xu,xa) ),
introduced(split_symbol_definition) ).
fof(f353,plain,
( ~ doDivides0(xu,xa)
| spl0_7 ),
inference(component_clause,[status(thm)],[f351]) ).
fof(f354,plain,
( ~ spl0_2
| ~ spl0_7 ),
inference(split_clause,[status(thm)],[f319,f332,f351]) ).
fof(f379,plain,
( $false
| spl0_7 ),
inference(forward_subsumption_resolution,[status(thm)],[f353,f293]) ).
fof(f380,plain,
spl0_7,
inference(contradiction_clause,[status(thm)],[f379]) ).
fof(f381,plain,
( $false
| spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f341,f297]) ).
fof(f382,plain,
spl0_4,
inference(contradiction_clause,[status(thm)],[f381]) ).
fof(f383,plain,
$false,
inference(sat_refutation,[status(thm)],[f342,f354,f380,f382]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.07 % Problem : RNG125+4 : TPTP v8.1.2. Released v4.0.0.
% 0.04/0.08 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.07/0.26 % Computer : n018.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Tue May 30 10:44:55 EDT 2023
% 0.07/0.27 % CPUTime :
% 0.07/0.27 % Drodi V3.5.1
% 0.07/0.29 % Refutation found
% 0.07/0.29 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.07/0.29 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.07/0.29 % Elapsed time: 0.017147 seconds
% 0.07/0.29 % CPU time: 0.025632 seconds
% 0.07/0.29 % Memory used: 15.864 MB
%------------------------------------------------------------------------------