TSTP Solution File: KRS010-1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : KRS010-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n006.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:29:26 EDT 2022
% Result : Unsatisfiable 0.19s 0.51s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 18
% Syntax : Number of formulae : 64 ( 13 unt; 0 def)
% Number of atoms : 142 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 158 ( 80 ~; 73 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 14 ( 13 usr; 6 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 20 ( 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f188,plain,
$false,
inference(avatar_sat_refutation,[],[f76,f85,f126,f128,f136,f169,f187]) ).
fof(f187,plain,
( ~ spl0_2
| ~ spl0_7 ),
inference(avatar_contradiction_clause,[],[f186]) ).
fof(f186,plain,
( $false
| ~ spl0_2
| ~ spl0_7 ),
inference(subsumption_resolution,[],[f185,f182]) ).
fof(f182,plain,
( ~ d(u2r3(exist))
| ~ spl0_2 ),
inference(unit_resulting_resolution,[],[f2,f36,f38,f34,f75,f31]) ).
fof(f31,axiom,
! [X2,X3,X0] :
( ~ r(X0,X3)
| ~ r(X0,X2)
| ~ d(X2)
| equalish(X2,X3)
| f(X0)
| ~ d(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_31) ).
fof(f75,plain,
( d(u2r1(exist))
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f73]) ).
fof(f73,plain,
( spl0_2
<=> d(u2r1(exist)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
fof(f34,plain,
~ equalish(u2r3(exist),u2r1(exist)),
inference(unit_resulting_resolution,[],[f32,f20]) ).
fof(f20,axiom,
! [X0] :
( ~ equalish(u2r3(X0),u2r1(X0))
| ~ r3least(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_20) ).
fof(f32,plain,
r3least(exist),
inference(unit_resulting_resolution,[],[f1,f7]) ).
fof(f7,axiom,
! [X0] :
( r3least(X0)
| ~ e(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
fof(f1,axiom,
e(exist),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
fof(f38,plain,
r(exist,u2r3(exist)),
inference(unit_resulting_resolution,[],[f32,f24]) ).
fof(f24,axiom,
! [X0] :
( r(X0,u2r3(X0))
| ~ r3least(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_24) ).
fof(f36,plain,
r(exist,u2r1(exist)),
inference(unit_resulting_resolution,[],[f32,f22]) ).
fof(f22,axiom,
! [X0] :
( r(X0,u2r1(X0))
| ~ r3least(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_22) ).
fof(f2,axiom,
~ f(exist),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
fof(f185,plain,
( d(u2r3(exist))
| ~ spl0_7 ),
inference(unit_resulting_resolution,[],[f62,f177,f3]) ).
fof(f3,axiom,
! [X0] :
( ~ a(X0)
| d(X0)
| c(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
fof(f177,plain,
( ~ c(u2r3(exist))
| ~ spl0_7 ),
inference(unit_resulting_resolution,[],[f1,f38,f35,f37,f118,f6]) ).
fof(f6,axiom,
! [X2,X0,X1] :
( ~ r(X0,X2)
| ~ e(X0)
| ~ r(X0,X1)
| ~ c(X2)
| equalish(X1,X2)
| ~ c(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
fof(f118,plain,
( c(u2r2(exist))
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f117]) ).
fof(f117,plain,
( spl0_7
<=> c(u2r2(exist)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_7])]) ).
fof(f37,plain,
r(exist,u2r2(exist)),
inference(unit_resulting_resolution,[],[f32,f23]) ).
fof(f23,axiom,
! [X0] :
( r(X0,u2r2(X0))
| ~ r3least(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_23) ).
fof(f35,plain,
~ equalish(u2r3(exist),u2r2(exist)),
inference(unit_resulting_resolution,[],[f32,f21]) ).
fof(f21,axiom,
! [X0] :
( ~ equalish(u2r3(X0),u2r2(X0))
| ~ r3least(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_21) ).
fof(f62,plain,
a(u2r3(exist)),
inference(subsumption_resolution,[],[f58,f1]) ).
fof(f58,plain,
( a(u2r3(exist))
| ~ e(exist) ),
inference(resolution,[],[f38,f8]) ).
fof(f8,axiom,
! [X3,X0] :
( ~ r(X0,X3)
| ~ e(X0)
| a(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).
fof(f169,plain,
( ~ spl0_1
| ~ spl0_5 ),
inference(avatar_contradiction_clause,[],[f168]) ).
fof(f168,plain,
( $false
| ~ spl0_1
| ~ spl0_5 ),
inference(subsumption_resolution,[],[f167,f146]) ).
fof(f146,plain,
( ~ c(u2r3(exist))
| ~ spl0_1 ),
inference(unit_resulting_resolution,[],[f1,f38,f34,f36,f71,f6]) ).
fof(f71,plain,
( c(u2r1(exist))
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f69]) ).
fof(f69,plain,
( spl0_1
<=> c(u2r1(exist)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
fof(f167,plain,
( c(u2r3(exist))
| ~ spl0_5 ),
inference(unit_resulting_resolution,[],[f62,f138,f3]) ).
fof(f138,plain,
( ~ d(u2r3(exist))
| ~ spl0_5 ),
inference(unit_resulting_resolution,[],[f2,f37,f38,f35,f110,f31]) ).
fof(f110,plain,
( d(u2r2(exist))
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f109]) ).
fof(f109,plain,
( spl0_5
<=> d(u2r2(exist)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_5])]) ).
fof(f136,plain,
( ~ spl0_1
| ~ spl0_7 ),
inference(avatar_contradiction_clause,[],[f135]) ).
fof(f135,plain,
( $false
| ~ spl0_1
| ~ spl0_7 ),
inference(subsumption_resolution,[],[f131,f71]) ).
fof(f131,plain,
( ~ c(u2r1(exist))
| ~ spl0_7 ),
inference(unit_resulting_resolution,[],[f1,f36,f33,f37,f118,f6]) ).
fof(f33,plain,
~ equalish(u2r2(exist),u2r1(exist)),
inference(unit_resulting_resolution,[],[f32,f19]) ).
fof(f19,axiom,
! [X0] :
( ~ equalish(u2r2(X0),u2r1(X0))
| ~ r3least(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_19) ).
fof(f128,plain,
( spl0_5
| spl0_7 ),
inference(avatar_contradiction_clause,[],[f127]) ).
fof(f127,plain,
( $false
| spl0_5
| spl0_7 ),
inference(subsumption_resolution,[],[f124,f111]) ).
fof(f111,plain,
( ~ d(u2r2(exist))
| spl0_5 ),
inference(avatar_component_clause,[],[f109]) ).
fof(f124,plain,
( d(u2r2(exist))
| spl0_7 ),
inference(unit_resulting_resolution,[],[f49,f119,f3]) ).
fof(f119,plain,
( ~ c(u2r2(exist))
| spl0_7 ),
inference(avatar_component_clause,[],[f117]) ).
fof(f49,plain,
a(u2r2(exist)),
inference(unit_resulting_resolution,[],[f1,f37,f8]) ).
fof(f126,plain,
( ~ spl0_4
| spl0_7 ),
inference(avatar_contradiction_clause,[],[f125]) ).
fof(f125,plain,
( $false
| ~ spl0_4
| spl0_7 ),
inference(subsumption_resolution,[],[f124,f107]) ).
fof(f107,plain,
( ~ d(u2r2(exist))
| ~ spl0_4 ),
inference(subsumption_resolution,[],[f106,f32]) ).
fof(f106,plain,
( ~ d(u2r2(exist))
| ~ r3least(exist)
| ~ spl0_4 ),
inference(subsumption_resolution,[],[f98,f33]) ).
fof(f98,plain,
( equalish(u2r2(exist),u2r1(exist))
| ~ r3least(exist)
| ~ d(u2r2(exist))
| ~ spl0_4 ),
inference(resolution,[],[f84,f23]) ).
fof(f84,plain,
( ! [X0] :
( ~ r(exist,X0)
| equalish(X0,u2r1(exist))
| ~ d(X0) )
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f83]) ).
fof(f83,plain,
( spl0_4
<=> ! [X0] :
( ~ r(exist,X0)
| ~ d(X0)
| equalish(X0,u2r1(exist)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
fof(f85,plain,
( spl0_4
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f48,f73,f83]) ).
fof(f48,plain,
! [X0] :
( ~ d(u2r1(exist))
| ~ r(exist,X0)
| equalish(X0,u2r1(exist))
| ~ d(X0) ),
inference(subsumption_resolution,[],[f42,f2]) ).
fof(f42,plain,
! [X0] :
( ~ d(X0)
| equalish(X0,u2r1(exist))
| f(exist)
| ~ r(exist,X0)
| ~ d(u2r1(exist)) ),
inference(resolution,[],[f36,f31]) ).
fof(f76,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f64,f73,f69]) ).
fof(f64,plain,
( d(u2r1(exist))
| c(u2r1(exist)) ),
inference(resolution,[],[f47,f3]) ).
fof(f47,plain,
a(u2r1(exist)),
inference(subsumption_resolution,[],[f43,f1]) ).
fof(f43,plain,
( ~ e(exist)
| a(u2r1(exist)) ),
inference(resolution,[],[f36,f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KRS010-1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.33 % Computer : n006.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Aug 30 00:31:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.50 % (19107)dis+1011_3:29_av=off:awrs=decay:awrsf=32:bce=on:drc=off:fde=unused:gsp=on:irw=on:nwc=2.0:spb=goal_then_units:updr=off:urr=ec_only:i=29:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/29Mi)
% 0.19/0.50 % (19115)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=97:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/97Mi)
% 0.19/0.50 % (19099)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.19/0.50 % (19100)lrs+1010_1:4_amm=off:bce=on:sd=1:sos=on:ss=included:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.51 % (19115)First to succeed.
% 0.19/0.51 % (19115)Refutation found. Thanks to Tanya!
% 0.19/0.51 % SZS status Unsatisfiable for theBenchmark
% 0.19/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.51 % (19115)------------------------------
% 0.19/0.51 % (19115)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (19115)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (19115)Termination reason: Refutation
% 0.19/0.51
% 0.19/0.51 % (19115)Memory used [KB]: 5884
% 0.19/0.51 % (19115)Time elapsed: 0.064 s
% 0.19/0.51 % (19115)Instructions burned: 6 (million)
% 0.19/0.51 % (19115)------------------------------
% 0.19/0.51 % (19115)------------------------------
% 0.19/0.51 % (19092)Success in time 0.168 s
%------------------------------------------------------------------------------