TSTP Solution File: KRS097+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : KRS097+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n029.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 Aug 31 17:30:48 EDT 2022
% Result : Unsatisfiable 0.21s 0.51s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 8
% Syntax : Number of formulae : 41 ( 8 unt; 0 def)
% Number of atoms : 183 ( 23 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 221 ( 79 ~; 66 |; 67 &)
% ( 5 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 95 ( 59 !; 36 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f285,plain,
$false,
inference(subsumption_resolution,[],[f284,f177]) ).
fof(f177,plain,
cUnsatisfiable(i2003_11_14_17_20_21603),
inference(cnf_transformation,[],[f30]) ).
fof(f30,axiom,
cUnsatisfiable(i2003_11_14_17_20_21603),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(f284,plain,
~ cUnsatisfiable(i2003_11_14_17_20_21603),
inference(resolution,[],[f283,f204]) ).
fof(f204,plain,
! [X0] :
( sP0(X0)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f156]) ).
fof(f156,plain,
! [X0] :
( ( sP0(X0)
| ~ cUnsatisfiable(X0) )
& ( cUnsatisfiable(X0)
| ~ sP0(X0) ) ),
inference(nnf_transformation,[],[f134]) ).
fof(f134,plain,
! [X0] :
( sP0(X0)
<=> cUnsatisfiable(X0) ),
inference(definition_folding,[],[f120,f133]) ).
fof(f133,plain,
! [X0] :
( sP0(X0)
<=> ( ? [X5] : rr(X0,X5)
& ? [X1] :
( cd(X1)
& rr(X0,X1) )
& ? [X4] :
( rr(X0,X4)
& cc(X4) )
& ! [X2,X3] :
( ~ rr(X0,X2)
| ~ rr(X0,X3)
| X2 = X3 ) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f120,plain,
! [X0] :
( ( ? [X5] : rr(X0,X5)
& ? [X1] :
( cd(X1)
& rr(X0,X1) )
& ? [X4] :
( rr(X0,X4)
& cc(X4) )
& ! [X2,X3] :
( ~ rr(X0,X2)
| ~ rr(X0,X3)
| X2 = X3 ) )
<=> cUnsatisfiable(X0) ),
inference(ennf_transformation,[],[f45]) ).
fof(f45,plain,
! [X0] :
( ( ? [X4] :
( rr(X0,X4)
& cc(X4) )
& ? [X5] : rr(X0,X5)
& ~ ? [X3,X2] :
( rr(X0,X3)
& X2 != X3
& rr(X0,X2) )
& ? [X1] :
( cd(X1)
& rr(X0,X1) ) )
<=> cUnsatisfiable(X0) ),
inference(rectify,[],[f28]) ).
fof(f28,axiom,
! [X3] :
( cUnsatisfiable(X3)
<=> ( ? [X5] :
( cd(X5)
& rr(X3,X5) )
& ~ ? [X4,X6] :
( X4 != X6
& rr(X3,X4)
& rr(X3,X6) )
& ? [X5] :
( cc(X5)
& rr(X3,X5) )
& ? [X4] : rr(X3,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f283,plain,
~ sP0(i2003_11_14_17_20_21603),
inference(subsumption_resolution,[],[f282,f254]) ).
fof(f254,plain,
~ cc(sK4(i2003_11_14_17_20_21603)),
inference(resolution,[],[f252,f185]) ).
fof(f185,plain,
! [X0] :
( ~ cd(X0)
| ~ cc(X0) ),
inference(cnf_transformation,[],[f93]) ).
fof(f93,plain,
! [X0] :
( ~ cc(X0)
| ~ cd(X0) ),
inference(ennf_transformation,[],[f72]) ).
fof(f72,plain,
! [X0] :
~ ( cd(X0)
& cc(X0) ),
inference(rectify,[],[f32]) ).
fof(f32,axiom,
! [X3] :
~ ( cd(X3)
& cc(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
fof(f252,plain,
cd(sK4(i2003_11_14_17_20_21603)),
inference(resolution,[],[f251,f177]) ).
fof(f251,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| cd(sK4(X0)) ),
inference(resolution,[],[f198,f204]) ).
fof(f198,plain,
! [X0] :
( ~ sP0(X0)
| cd(sK4(X0)) ),
inference(cnf_transformation,[],[f155]) ).
fof(f155,plain,
! [X0] :
( ( sP0(X0)
| ! [X1] : ~ rr(X0,X1)
| ! [X2] :
( ~ cd(X2)
| ~ rr(X0,X2) )
| ! [X3] :
( ~ rr(X0,X3)
| ~ cc(X3) )
| ( rr(X0,sK1(X0))
& rr(X0,sK2(X0))
& sK2(X0) != sK1(X0) ) )
& ( ( rr(X0,sK3(X0))
& cd(sK4(X0))
& rr(X0,sK4(X0))
& rr(X0,sK5(X0))
& cc(sK5(X0))
& ! [X9,X10] :
( ~ rr(X0,X9)
| ~ rr(X0,X10)
| X9 = X10 ) )
| ~ sP0(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5])],[f150,f154,f153,f152,f151]) ).
fof(f151,plain,
! [X0] :
( ? [X4,X5] :
( rr(X0,X4)
& rr(X0,X5)
& X4 != X5 )
=> ( rr(X0,sK1(X0))
& rr(X0,sK2(X0))
& sK2(X0) != sK1(X0) ) ),
introduced(choice_axiom,[]) ).
fof(f152,plain,
! [X0] :
( ? [X6] : rr(X0,X6)
=> rr(X0,sK3(X0)) ),
introduced(choice_axiom,[]) ).
fof(f153,plain,
! [X0] :
( ? [X7] :
( cd(X7)
& rr(X0,X7) )
=> ( cd(sK4(X0))
& rr(X0,sK4(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f154,plain,
! [X0] :
( ? [X8] :
( rr(X0,X8)
& cc(X8) )
=> ( rr(X0,sK5(X0))
& cc(sK5(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f150,plain,
! [X0] :
( ( sP0(X0)
| ! [X1] : ~ rr(X0,X1)
| ! [X2] :
( ~ cd(X2)
| ~ rr(X0,X2) )
| ! [X3] :
( ~ rr(X0,X3)
| ~ cc(X3) )
| ? [X4,X5] :
( rr(X0,X4)
& rr(X0,X5)
& X4 != X5 ) )
& ( ( ? [X6] : rr(X0,X6)
& ? [X7] :
( cd(X7)
& rr(X0,X7) )
& ? [X8] :
( rr(X0,X8)
& cc(X8) )
& ! [X9,X10] :
( ~ rr(X0,X9)
| ~ rr(X0,X10)
| X9 = X10 ) )
| ~ sP0(X0) ) ),
inference(rectify,[],[f149]) ).
fof(f149,plain,
! [X0] :
( ( sP0(X0)
| ! [X5] : ~ rr(X0,X5)
| ! [X1] :
( ~ cd(X1)
| ~ rr(X0,X1) )
| ! [X4] :
( ~ rr(X0,X4)
| ~ cc(X4) )
| ? [X2,X3] :
( rr(X0,X2)
& rr(X0,X3)
& X2 != X3 ) )
& ( ( ? [X5] : rr(X0,X5)
& ? [X1] :
( cd(X1)
& rr(X0,X1) )
& ? [X4] :
( rr(X0,X4)
& cc(X4) )
& ! [X2,X3] :
( ~ rr(X0,X2)
| ~ rr(X0,X3)
| X2 = X3 ) )
| ~ sP0(X0) ) ),
inference(flattening,[],[f148]) ).
fof(f148,plain,
! [X0] :
( ( sP0(X0)
| ! [X5] : ~ rr(X0,X5)
| ! [X1] :
( ~ cd(X1)
| ~ rr(X0,X1) )
| ! [X4] :
( ~ rr(X0,X4)
| ~ cc(X4) )
| ? [X2,X3] :
( rr(X0,X2)
& rr(X0,X3)
& X2 != X3 ) )
& ( ( ? [X5] : rr(X0,X5)
& ? [X1] :
( cd(X1)
& rr(X0,X1) )
& ? [X4] :
( rr(X0,X4)
& cc(X4) )
& ! [X2,X3] :
( ~ rr(X0,X2)
| ~ rr(X0,X3)
| X2 = X3 ) )
| ~ sP0(X0) ) ),
inference(nnf_transformation,[],[f133]) ).
fof(f282,plain,
( cc(sK4(i2003_11_14_17_20_21603))
| ~ sP0(i2003_11_14_17_20_21603) ),
inference(superposition,[],[f195,f274]) ).
fof(f274,plain,
sK4(i2003_11_14_17_20_21603) = sK5(i2003_11_14_17_20_21603),
inference(subsumption_resolution,[],[f273,f177]) ).
fof(f273,plain,
( ~ cUnsatisfiable(i2003_11_14_17_20_21603)
| sK4(i2003_11_14_17_20_21603) = sK5(i2003_11_14_17_20_21603) ),
inference(resolution,[],[f268,f204]) ).
fof(f268,plain,
( ~ sP0(i2003_11_14_17_20_21603)
| sK4(i2003_11_14_17_20_21603) = sK5(i2003_11_14_17_20_21603) ),
inference(resolution,[],[f266,f197]) ).
fof(f197,plain,
! [X0] :
( rr(X0,sK4(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f155]) ).
fof(f266,plain,
! [X0] :
( ~ rr(i2003_11_14_17_20_21603,X0)
| sK5(i2003_11_14_17_20_21603) = X0 ),
inference(subsumption_resolution,[],[f265,f177]) ).
fof(f265,plain,
! [X0] :
( sK5(i2003_11_14_17_20_21603) = X0
| ~ cUnsatisfiable(i2003_11_14_17_20_21603)
| ~ rr(i2003_11_14_17_20_21603,X0) ),
inference(resolution,[],[f260,f204]) ).
fof(f260,plain,
! [X0] :
( ~ sP0(i2003_11_14_17_20_21603)
| sK5(i2003_11_14_17_20_21603) = X0
| ~ rr(i2003_11_14_17_20_21603,X0) ),
inference(resolution,[],[f258,f196]) ).
fof(f196,plain,
! [X0] :
( rr(X0,sK5(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f155]) ).
fof(f258,plain,
! [X0,X1] :
( ~ rr(i2003_11_14_17_20_21603,X1)
| X0 = X1
| ~ rr(i2003_11_14_17_20_21603,X0) ),
inference(resolution,[],[f257,f177]) ).
fof(f257,plain,
! [X2,X0,X1] :
( ~ cUnsatisfiable(X0)
| ~ rr(X0,X2)
| ~ rr(X0,X1)
| X1 = X2 ),
inference(resolution,[],[f194,f204]) ).
fof(f194,plain,
! [X10,X0,X9] :
( ~ sP0(X0)
| ~ rr(X0,X10)
| X9 = X10
| ~ rr(X0,X9) ),
inference(cnf_transformation,[],[f155]) ).
fof(f195,plain,
! [X0] :
( cc(sK5(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f155]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS097+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.34 % Computer : n029.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 30 00:43:26 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.21/0.50 % (31599)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.21/0.50 TRYING [1]
% 0.21/0.50 % (31614)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.21/0.50 TRYING [2]
% 0.21/0.50 TRYING [3]
% 0.21/0.50 TRYING [4]
% 0.21/0.50 TRYING [5]
% 0.21/0.50 TRYING [6]
% 0.21/0.50 % (31606)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.50 % (31614)First to succeed.
% 0.21/0.51 % (31610)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.21/0.51 % (31599)Also succeeded, but the first one will report.
% 0.21/0.51 % (31601)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.21/0.51 % (31614)Refutation found. Thanks to Tanya!
% 0.21/0.51 % SZS status Unsatisfiable for theBenchmark
% 0.21/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.51 % (31614)------------------------------
% 0.21/0.51 % (31614)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51 % (31614)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51 % (31614)Termination reason: Refutation
% 0.21/0.51
% 0.21/0.51 % (31614)Memory used [KB]: 1023
% 0.21/0.51 % (31614)Time elapsed: 0.101 s
% 0.21/0.51 % (31614)Instructions burned: 4 (million)
% 0.21/0.51 % (31614)------------------------------
% 0.21/0.51 % (31614)------------------------------
% 0.21/0.51 % (31598)Success in time 0.157 s
%------------------------------------------------------------------------------