TSTP Solution File: KRS087+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : KRS087+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n013.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 : Tue Apr 30 20:24:44 EDT 2024
% Result : Unsatisfiable 0.13s 0.36s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 10 unt; 0 def)
% Number of atoms : 117 ( 0 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 129 ( 48 ~; 45 |; 29 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 3 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-3 aty)
% Number of variables : 56 ( 46 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
! [X] :
( cUnsatisfiable(X)
<=> ( cp1(X)
& ? [Y] :
( rr(X,Y)
& ? [Z] :
( rr(Y,Z)
& ! [W] :
( rinvR(Z,W)
=> ~ cp1(W) )
& cp1(Z) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f20,axiom,
! [X,Y] :
( rinvR(X,Y)
<=> rr(Y,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f21,axiom,
! [X,Y,Z] :
( ( rr(X,Y)
& rr(Y,Z) )
=> rr(X,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f22,axiom,
cUnsatisfiable(i2003_11_14_17_19_46763),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f72,plain,
! [X] :
( cUnsatisfiable(X)
<=> ( cp1(X)
& ? [Y] :
( rr(X,Y)
& ? [Z] :
( rr(Y,Z)
& ! [W] :
( ~ rinvR(Z,W)
| ~ cp1(W) )
& cp1(Z) ) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f17]) ).
fof(f73,plain,
! [X] :
( ( ~ cUnsatisfiable(X)
| ( cp1(X)
& ? [Y] :
( rr(X,Y)
& ? [Z] :
( rr(Y,Z)
& ! [W] :
( ~ rinvR(Z,W)
| ~ cp1(W) )
& cp1(Z) ) ) ) )
& ( cUnsatisfiable(X)
| ~ cp1(X)
| ! [Y] :
( ~ rr(X,Y)
| ! [Z] :
( ~ rr(Y,Z)
| ? [W] :
( rinvR(Z,W)
& cp1(W) )
| ~ cp1(Z) ) ) ) ),
inference(NNF_transformation,[status(esa)],[f72]) ).
fof(f74,plain,
( ! [X] :
( ~ cUnsatisfiable(X)
| ( cp1(X)
& ? [Y] :
( rr(X,Y)
& ? [Z] :
( rr(Y,Z)
& ! [W] :
( ~ rinvR(Z,W)
| ~ cp1(W) )
& cp1(Z) ) ) ) )
& ! [X] :
( cUnsatisfiable(X)
| ~ cp1(X)
| ! [Y] :
( ~ rr(X,Y)
| ! [Z] :
( ~ rr(Y,Z)
| ? [W] :
( rinvR(Z,W)
& cp1(W) )
| ~ cp1(Z) ) ) ) ),
inference(miniscoping,[status(esa)],[f73]) ).
fof(f75,plain,
( ! [X] :
( ~ cUnsatisfiable(X)
| ( cp1(X)
& rr(X,sk0_0(X))
& rr(sk0_0(X),sk0_1(X))
& ! [W] :
( ~ rinvR(sk0_1(X),W)
| ~ cp1(W) )
& cp1(sk0_1(X)) ) )
& ! [X] :
( cUnsatisfiable(X)
| ~ cp1(X)
| ! [Y] :
( ~ rr(X,Y)
| ! [Z] :
( ~ rr(Y,Z)
| ( rinvR(Z,sk0_2(Z,Y,X))
& cp1(sk0_2(Z,Y,X)) )
| ~ cp1(Z) ) ) ) ),
inference(skolemization,[status(esa)],[f74]) ).
fof(f76,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| cp1(X0) ),
inference(cnf_transformation,[status(esa)],[f75]) ).
fof(f77,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rr(X0,sk0_0(X0)) ),
inference(cnf_transformation,[status(esa)],[f75]) ).
fof(f78,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rr(sk0_0(X0),sk0_1(X0)) ),
inference(cnf_transformation,[status(esa)],[f75]) ).
fof(f79,plain,
! [X0,X1] :
( ~ cUnsatisfiable(X0)
| ~ rinvR(sk0_1(X0),X1)
| ~ cp1(X1) ),
inference(cnf_transformation,[status(esa)],[f75]) ).
fof(f90,plain,
! [X,Y] :
( ( ~ rinvR(X,Y)
| rr(Y,X) )
& ( rinvR(X,Y)
| ~ rr(Y,X) ) ),
inference(NNF_transformation,[status(esa)],[f20]) ).
fof(f91,plain,
( ! [X,Y] :
( ~ rinvR(X,Y)
| rr(Y,X) )
& ! [X,Y] :
( rinvR(X,Y)
| ~ rr(Y,X) ) ),
inference(miniscoping,[status(esa)],[f90]) ).
fof(f93,plain,
! [X0,X1] :
( rinvR(X0,X1)
| ~ rr(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f91]) ).
fof(f94,plain,
! [X,Y,Z] :
( ~ rr(X,Y)
| ~ rr(Y,Z)
| rr(X,Z) ),
inference(pre_NNF_transformation,[status(esa)],[f21]) ).
fof(f95,plain,
! [X,Z] :
( ! [Y] :
( ~ rr(X,Y)
| ~ rr(Y,Z) )
| rr(X,Z) ),
inference(miniscoping,[status(esa)],[f94]) ).
fof(f96,plain,
! [X0,X1,X2] :
( ~ rr(X0,X1)
| ~ rr(X1,X2)
| rr(X0,X2) ),
inference(cnf_transformation,[status(esa)],[f95]) ).
fof(f97,plain,
cUnsatisfiable(i2003_11_14_17_19_46763),
inference(cnf_transformation,[status(esa)],[f22]) ).
fof(f98,plain,
cp1(i2003_11_14_17_19_46763),
inference(resolution,[status(thm)],[f76,f97]) ).
fof(f99,plain,
rr(i2003_11_14_17_19_46763,sk0_0(i2003_11_14_17_19_46763)),
inference(resolution,[status(thm)],[f77,f97]) ).
fof(f101,plain,
rr(sk0_0(i2003_11_14_17_19_46763),sk0_1(i2003_11_14_17_19_46763)),
inference(resolution,[status(thm)],[f78,f97]) ).
fof(f103,plain,
( spl0_0
<=> cUnsatisfiable(i2003_11_14_17_19_46763) ),
introduced(split_symbol_definition) ).
fof(f105,plain,
( ~ cUnsatisfiable(i2003_11_14_17_19_46763)
| spl0_0 ),
inference(component_clause,[status(thm)],[f103]) ).
fof(f106,plain,
( spl0_1
<=> cp1(i2003_11_14_17_19_46763) ),
introduced(split_symbol_definition) ).
fof(f108,plain,
( ~ cp1(i2003_11_14_17_19_46763)
| spl0_1 ),
inference(component_clause,[status(thm)],[f106]) ).
fof(f119,plain,
( $false
| spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f108,f98]) ).
fof(f120,plain,
spl0_1,
inference(contradiction_clause,[status(thm)],[f119]) ).
fof(f143,plain,
! [X0] :
( ~ rr(sk0_0(i2003_11_14_17_19_46763),X0)
| rr(i2003_11_14_17_19_46763,X0) ),
inference(resolution,[status(thm)],[f96,f99]) ).
fof(f144,plain,
rr(i2003_11_14_17_19_46763,sk0_1(i2003_11_14_17_19_46763)),
inference(resolution,[status(thm)],[f143,f101]) ).
fof(f146,plain,
rinvR(sk0_1(i2003_11_14_17_19_46763),i2003_11_14_17_19_46763),
inference(resolution,[status(thm)],[f144,f93]) ).
fof(f157,plain,
( ~ cUnsatisfiable(i2003_11_14_17_19_46763)
| ~ cp1(i2003_11_14_17_19_46763) ),
inference(resolution,[status(thm)],[f146,f79]) ).
fof(f158,plain,
( ~ spl0_0
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f157,f103,f106]) ).
fof(f160,plain,
( $false
| spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f105,f97]) ).
fof(f161,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f160]) ).
fof(f162,plain,
$false,
inference(sat_refutation,[status(thm)],[f120,f158,f161]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : KRS087+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.35 % Computer : n013.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Apr 29 23:17:34 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.36 % Drodi V3.6.0
% 0.13/0.36 % Refutation found
% 0.13/0.36 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.38 % Elapsed time: 0.021156 seconds
% 0.13/0.38 % CPU time: 0.041364 seconds
% 0.13/0.38 % Total memory used: 721.936 KB
% 0.13/0.38 % Net memory used: 707.696 KB
%------------------------------------------------------------------------------