TSTP Solution File: KRS010-1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---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_sat --cores 0 -t %d %s
% Computer : n011.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:35 EDT 2022
% Result : Unsatisfiable 1.39s 0.57s
% Output : Refutation 1.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 13
% Syntax : Number of formulae : 63 ( 14 unt; 0 def)
% Number of atoms : 175 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 213 ( 101 ~; 112 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 37 ( 37 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f131,plain,
$false,
inference(subsumption_resolution,[],[f130,f45]) ).
fof(f45,plain,
r(exist,u2r2(exist)),
inference(resolution,[],[f23,f32]) ).
fof(f32,plain,
r3least(exist),
inference(resolution,[],[f7,f1]) ).
fof(f1,axiom,
e(exist),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
fof(f7,axiom,
! [X0] :
( ~ e(X0)
| r3least(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
fof(f23,axiom,
! [X0] :
( ~ r3least(X0)
| r(X0,u2r2(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_23) ).
fof(f130,plain,
~ r(exist,u2r2(exist)),
inference(subsumption_resolution,[],[f129,f32]) ).
fof(f129,plain,
( ~ r3least(exist)
| ~ r(exist,u2r2(exist)) ),
inference(subsumption_resolution,[],[f127,f104]) ).
fof(f104,plain,
c(u2r2(exist)),
inference(subsumption_resolution,[],[f103,f81]) ).
fof(f81,plain,
( c(u2r3(exist))
| c(u2r2(exist)) ),
inference(resolution,[],[f80,f53]) ).
fof(f53,plain,
( d(u2r3(exist))
| c(u2r3(exist)) ),
inference(resolution,[],[f52,f3]) ).
fof(f3,axiom,
! [X0] :
( ~ a(X0)
| c(X0)
| d(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
fof(f52,plain,
a(u2r3(exist)),
inference(resolution,[],[f51,f33]) ).
fof(f33,plain,
! [X0] :
( ~ r(exist,X0)
| a(X0) ),
inference(resolution,[],[f8,f1]) ).
fof(f8,axiom,
! [X3,X0] :
( ~ e(X0)
| ~ r(X0,X3)
| a(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).
fof(f51,plain,
r(exist,u2r3(exist)),
inference(resolution,[],[f24,f32]) ).
fof(f24,axiom,
! [X0] :
( ~ r3least(X0)
| r(X0,u2r3(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_24) ).
fof(f80,plain,
( ~ d(u2r3(exist))
| c(u2r2(exist)) ),
inference(subsumption_resolution,[],[f79,f32]) ).
fof(f79,plain,
( ~ r3least(exist)
| c(u2r2(exist))
| ~ d(u2r3(exist)) ),
inference(subsumption_resolution,[],[f78,f51]) ).
fof(f78,plain,
( ~ r(exist,u2r3(exist))
| c(u2r2(exist))
| ~ r3least(exist)
| ~ d(u2r3(exist)) ),
inference(resolution,[],[f77,f21]) ).
fof(f21,axiom,
! [X0] :
( ~ equalish(u2r3(X0),u2r2(X0))
| ~ r3least(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_21) ).
fof(f77,plain,
! [X0] :
( equalish(X0,u2r2(exist))
| c(u2r2(exist))
| ~ r(exist,X0)
| ~ d(X0) ),
inference(subsumption_resolution,[],[f76,f2]) ).
fof(f2,axiom,
~ f(exist),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
fof(f76,plain,
! [X0] :
( ~ r(exist,X0)
| c(u2r2(exist))
| f(exist)
| equalish(X0,u2r2(exist))
| ~ d(X0) ),
inference(resolution,[],[f50,f45]) ).
fof(f50,plain,
! [X0,X1] :
( ~ r(X0,u2r2(exist))
| c(u2r2(exist))
| f(X0)
| ~ d(X1)
| ~ r(X0,X1)
| equalish(X1,u2r2(exist)) ),
inference(resolution,[],[f47,f31]) ).
fof(f31,axiom,
! [X2,X3,X0] :
( ~ d(X3)
| f(X0)
| ~ d(X2)
| ~ r(X0,X3)
| equalish(X2,X3)
| ~ r(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_31) ).
fof(f47,plain,
( d(u2r2(exist))
| c(u2r2(exist)) ),
inference(resolution,[],[f46,f3]) ).
fof(f46,plain,
a(u2r2(exist)),
inference(resolution,[],[f45,f33]) ).
fof(f103,plain,
( ~ c(u2r3(exist))
| c(u2r2(exist)) ),
inference(subsumption_resolution,[],[f102,f32]) ).
fof(f102,plain,
( c(u2r2(exist))
| ~ c(u2r3(exist))
| ~ r3least(exist) ),
inference(subsumption_resolution,[],[f101,f51]) ).
fof(f101,plain,
( ~ r(exist,u2r3(exist))
| ~ c(u2r3(exist))
| c(u2r2(exist))
| ~ r3least(exist) ),
inference(resolution,[],[f97,f20]) ).
fof(f20,axiom,
! [X0] :
( ~ equalish(u2r3(X0),u2r1(X0))
| ~ r3least(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_20) ).
fof(f97,plain,
! [X0] :
( equalish(X0,u2r1(exist))
| ~ c(X0)
| ~ r(exist,X0)
| c(u2r2(exist)) ),
inference(subsumption_resolution,[],[f96,f1]) ).
fof(f96,plain,
! [X0] :
( ~ c(X0)
| ~ e(exist)
| ~ r(exist,X0)
| c(u2r2(exist))
| equalish(X0,u2r1(exist)) ),
inference(resolution,[],[f73,f34]) ).
fof(f34,plain,
r(exist,u2r1(exist)),
inference(resolution,[],[f22,f32]) ).
fof(f22,axiom,
! [X0] :
( ~ r3least(X0)
| r(X0,u2r1(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_22) ).
fof(f73,plain,
! [X0,X1] :
( ~ r(X1,u2r1(exist))
| c(u2r2(exist))
| ~ e(X1)
| equalish(X0,u2r1(exist))
| ~ r(X1,X0)
| ~ c(X0) ),
inference(resolution,[],[f70,f6]) ).
fof(f6,axiom,
! [X2,X0,X1] :
( ~ c(X2)
| equalish(X1,X2)
| ~ r(X0,X2)
| ~ r(X0,X1)
| ~ c(X1)
| ~ e(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
fof(f70,plain,
( c(u2r1(exist))
| c(u2r2(exist)) ),
inference(resolution,[],[f67,f47]) ).
fof(f67,plain,
( ~ d(u2r2(exist))
| c(u2r1(exist)) ),
inference(subsumption_resolution,[],[f66,f45]) ).
fof(f66,plain,
( ~ r(exist,u2r2(exist))
| ~ d(u2r2(exist))
| c(u2r1(exist)) ),
inference(subsumption_resolution,[],[f64,f32]) ).
fof(f64,plain,
( ~ r3least(exist)
| ~ d(u2r2(exist))
| ~ r(exist,u2r2(exist))
| c(u2r1(exist)) ),
inference(resolution,[],[f63,f19]) ).
fof(f19,axiom,
! [X0] :
( ~ equalish(u2r2(X0),u2r1(X0))
| ~ r3least(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_19) ).
fof(f63,plain,
! [X0] :
( equalish(X0,u2r1(exist))
| c(u2r1(exist))
| ~ r(exist,X0)
| ~ d(X0) ),
inference(subsumption_resolution,[],[f62,f2]) ).
fof(f62,plain,
! [X0] :
( ~ r(exist,X0)
| f(exist)
| equalish(X0,u2r1(exist))
| ~ d(X0)
| c(u2r1(exist)) ),
inference(resolution,[],[f44,f34]) ).
fof(f44,plain,
! [X0,X1] :
( ~ r(X0,u2r1(exist))
| ~ r(X0,X1)
| ~ d(X1)
| equalish(X1,u2r1(exist))
| f(X0)
| c(u2r1(exist)) ),
inference(resolution,[],[f40,f31]) ).
fof(f40,plain,
( d(u2r1(exist))
| c(u2r1(exist)) ),
inference(resolution,[],[f3,f35]) ).
fof(f35,plain,
a(u2r1(exist)),
inference(resolution,[],[f34,f33]) ).
fof(f127,plain,
( ~ c(u2r2(exist))
| ~ r(exist,u2r2(exist))
| ~ r3least(exist) ),
inference(resolution,[],[f123,f19]) ).
fof(f123,plain,
! [X0] :
( equalish(X0,u2r1(exist))
| ~ c(X0)
| ~ r(exist,X0) ),
inference(subsumption_resolution,[],[f122,f1]) ).
fof(f122,plain,
! [X0] :
( ~ c(X0)
| ~ e(exist)
| ~ r(exist,X0)
| equalish(X0,u2r1(exist)) ),
inference(resolution,[],[f120,f34]) ).
fof(f120,plain,
! [X0,X1] :
( ~ r(X1,u2r1(exist))
| equalish(X0,u2r1(exist))
| ~ r(X1,X0)
| ~ c(X0)
| ~ e(X1) ),
inference(resolution,[],[f118,f6]) ).
fof(f118,plain,
c(u2r1(exist)),
inference(resolution,[],[f115,f71]) ).
fof(f71,plain,
( c(u2r3(exist))
| c(u2r1(exist)) ),
inference(resolution,[],[f69,f53]) ).
fof(f69,plain,
( ~ d(u2r3(exist))
| c(u2r1(exist)) ),
inference(subsumption_resolution,[],[f68,f32]) ).
fof(f68,plain,
( ~ d(u2r3(exist))
| c(u2r1(exist))
| ~ r3least(exist) ),
inference(subsumption_resolution,[],[f65,f51]) ).
fof(f65,plain,
( ~ d(u2r3(exist))
| ~ r(exist,u2r3(exist))
| c(u2r1(exist))
| ~ r3least(exist) ),
inference(resolution,[],[f63,f20]) ).
fof(f115,plain,
~ c(u2r3(exist)),
inference(subsumption_resolution,[],[f114,f32]) ).
fof(f114,plain,
( ~ c(u2r3(exist))
| ~ r3least(exist) ),
inference(subsumption_resolution,[],[f113,f51]) ).
fof(f113,plain,
( ~ r(exist,u2r3(exist))
| ~ c(u2r3(exist))
| ~ r3least(exist) ),
inference(resolution,[],[f112,f21]) ).
fof(f112,plain,
! [X0] :
( equalish(X0,u2r2(exist))
| ~ c(X0)
| ~ r(exist,X0) ),
inference(subsumption_resolution,[],[f111,f1]) ).
fof(f111,plain,
! [X0] :
( ~ e(exist)
| equalish(X0,u2r2(exist))
| ~ c(X0)
| ~ r(exist,X0) ),
inference(resolution,[],[f108,f45]) ).
fof(f108,plain,
! [X0,X1] :
( ~ r(X1,u2r2(exist))
| ~ r(X1,X0)
| ~ e(X1)
| equalish(X0,u2r2(exist))
| ~ c(X0) ),
inference(resolution,[],[f104,f6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS010-1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/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.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 00:30:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.55 % (7406)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.19/0.55 % (7398)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)
% 1.39/0.56 % (7385)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)
% 1.39/0.56 % (7385)First to succeed.
% 1.39/0.56 % (7390)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.39/0.57 % (7405)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 1.39/0.57 % (7406)Also succeeded, but the first one will report.
% 1.39/0.57 % (7385)Refutation found. Thanks to Tanya!
% 1.39/0.57 % SZS status Unsatisfiable for theBenchmark
% 1.39/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 1.39/0.57 % (7385)------------------------------
% 1.39/0.57 % (7385)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.39/0.57 % (7385)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.39/0.57 % (7385)Termination reason: Refutation
% 1.39/0.57
% 1.39/0.57 % (7385)Memory used [KB]: 1023
% 1.39/0.57 % (7385)Time elapsed: 0.135 s
% 1.39/0.57 % (7385)Instructions burned: 5 (million)
% 1.39/0.57 % (7385)------------------------------
% 1.39/0.57 % (7385)------------------------------
% 1.39/0.57 % (7382)Success in time 0.219 s
%------------------------------------------------------------------------------