TSTP Solution File: KRS010-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : KRS010-1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n025.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 : Sun May 5 07:19:17 EDT 2024
% Result : Unsatisfiable 0.22s 0.38s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 13
% Syntax : Number of formulae : 64 ( 14 unt; 0 def)
% Number of atoms : 161 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 173 ( 76 ~; 97 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 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 : 24 ( 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f141,plain,
$false,
inference(subsumption_resolution,[],[f140,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(f140,plain,
~ r3least(exist),
inference(resolution,[],[f136,f19]) ).
fof(f19,axiom,
! [X0] :
( ~ equalish(u2r2(X0),u2r1(X0))
| ~ r3least(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_19) ).
fof(f136,plain,
equalish(u2r2(exist),u2r1(exist)),
inference(resolution,[],[f135,f112]) ).
fof(f112,plain,
( ~ c(u2r2(exist))
| equalish(u2r2(exist),u2r1(exist)) ),
inference(resolution,[],[f110,f63]) ).
fof(f63,plain,
( ~ c(u2r1(exist))
| ~ c(u2r2(exist))
| equalish(u2r2(exist),u2r1(exist)) ),
inference(resolution,[],[f59,f34]) ).
fof(f34,plain,
r(exist,u2r2(exist)),
inference(resolution,[],[f23,f32]) ).
fof(f23,axiom,
! [X0] :
( ~ r3least(X0)
| r(X0,u2r2(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_23) ).
fof(f59,plain,
! [X0] :
( ~ r(exist,X0)
| ~ c(u2r1(exist))
| ~ c(X0)
| equalish(X0,u2r1(exist)) ),
inference(subsumption_resolution,[],[f56,f1]) ).
fof(f56,plain,
! [X0] :
( ~ c(X0)
| ~ e(exist)
| ~ c(u2r1(exist))
| ~ r(exist,X0)
| equalish(X0,u2r1(exist)) ),
inference(resolution,[],[f6,f33]) ).
fof(f33,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(f6,axiom,
! [X2,X0,X1] :
( ~ r(X0,X2)
| ~ c(X1)
| ~ e(X0)
| ~ c(X2)
| ~ r(X0,X1)
| equalish(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
fof(f110,plain,
c(u2r1(exist)),
inference(subsumption_resolution,[],[f109,f32]) ).
fof(f109,plain,
( c(u2r1(exist))
| ~ r3least(exist) ),
inference(resolution,[],[f105,f21]) ).
fof(f21,axiom,
! [X0] :
( ~ equalish(u2r3(X0),u2r2(X0))
| ~ r3least(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_21) ).
fof(f105,plain,
( equalish(u2r3(exist),u2r2(exist))
| c(u2r1(exist)) ),
inference(subsumption_resolution,[],[f101,f91]) ).
fof(f91,plain,
( c(u2r1(exist))
| c(u2r2(exist)) ),
inference(subsumption_resolution,[],[f90,f32]) ).
fof(f90,plain,
( c(u2r1(exist))
| c(u2r2(exist))
| ~ r3least(exist) ),
inference(resolution,[],[f88,f19]) ).
fof(f88,plain,
( equalish(u2r2(exist),u2r1(exist))
| c(u2r1(exist))
| c(u2r2(exist)) ),
inference(resolution,[],[f86,f43]) ).
fof(f43,plain,
( d(u2r2(exist))
| c(u2r2(exist)) ),
inference(resolution,[],[f40,f3]) ).
fof(f3,axiom,
! [X0] :
( ~ a(X0)
| d(X0)
| c(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
fof(f40,plain,
a(u2r2(exist)),
inference(subsumption_resolution,[],[f37,f1]) ).
fof(f37,plain,
( a(u2r2(exist))
| ~ e(exist) ),
inference(resolution,[],[f8,f34]) ).
fof(f8,axiom,
! [X3,X0] :
( ~ r(X0,X3)
| a(X3)
| ~ e(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).
fof(f86,plain,
( ~ d(u2r2(exist))
| equalish(u2r2(exist),u2r1(exist))
| c(u2r1(exist)) ),
inference(resolution,[],[f81,f42]) ).
fof(f42,plain,
( d(u2r1(exist))
| c(u2r1(exist)) ),
inference(resolution,[],[f39,f3]) ).
fof(f39,plain,
a(u2r1(exist)),
inference(subsumption_resolution,[],[f36,f1]) ).
fof(f36,plain,
( a(u2r1(exist))
| ~ e(exist) ),
inference(resolution,[],[f8,f33]) ).
fof(f81,plain,
( ~ d(u2r1(exist))
| ~ d(u2r2(exist))
| equalish(u2r2(exist),u2r1(exist)) ),
inference(resolution,[],[f69,f34]) ).
fof(f69,plain,
! [X0] :
( ~ r(exist,X0)
| ~ d(u2r1(exist))
| ~ d(X0)
| equalish(X0,u2r1(exist)) ),
inference(subsumption_resolution,[],[f66,f2]) ).
fof(f2,axiom,
~ f(exist),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
fof(f66,plain,
! [X0] :
( ~ d(X0)
| f(exist)
| ~ d(u2r1(exist))
| ~ r(exist,X0)
| equalish(X0,u2r1(exist)) ),
inference(resolution,[],[f31,f33]) ).
fof(f31,axiom,
! [X2,X3,X0] :
( ~ r(X0,X3)
| ~ d(X2)
| f(X0)
| ~ d(X3)
| ~ r(X0,X2)
| equalish(X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_31) ).
fof(f101,plain,
( c(u2r1(exist))
| ~ c(u2r2(exist))
| equalish(u2r3(exist),u2r2(exist)) ),
inference(resolution,[],[f97,f74]) ).
fof(f74,plain,
( ~ c(u2r3(exist))
| ~ c(u2r2(exist))
| equalish(u2r3(exist),u2r2(exist)) ),
inference(resolution,[],[f60,f35]) ).
fof(f35,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(f60,plain,
! [X0] :
( ~ r(exist,X0)
| ~ c(u2r2(exist))
| ~ c(X0)
| equalish(X0,u2r2(exist)) ),
inference(subsumption_resolution,[],[f57,f1]) ).
fof(f57,plain,
! [X0] :
( ~ c(X0)
| ~ e(exist)
| ~ c(u2r2(exist))
| ~ r(exist,X0)
| equalish(X0,u2r2(exist)) ),
inference(resolution,[],[f6,f34]) ).
fof(f97,plain,
( c(u2r3(exist))
| c(u2r1(exist)) ),
inference(subsumption_resolution,[],[f96,f32]) ).
fof(f96,plain,
( c(u2r3(exist))
| c(u2r1(exist))
| ~ r3least(exist) ),
inference(resolution,[],[f89,f20]) ).
fof(f20,axiom,
! [X0] :
( ~ equalish(u2r3(X0),u2r1(X0))
| ~ r3least(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_20) ).
fof(f89,plain,
( equalish(u2r3(exist),u2r1(exist))
| c(u2r3(exist))
| c(u2r1(exist)) ),
inference(resolution,[],[f87,f42]) ).
fof(f87,plain,
( ~ d(u2r1(exist))
| equalish(u2r3(exist),u2r1(exist))
| c(u2r3(exist)) ),
inference(resolution,[],[f82,f44]) ).
fof(f44,plain,
( d(u2r3(exist))
| c(u2r3(exist)) ),
inference(resolution,[],[f41,f3]) ).
fof(f41,plain,
a(u2r3(exist)),
inference(subsumption_resolution,[],[f38,f1]) ).
fof(f38,plain,
( a(u2r3(exist))
| ~ e(exist) ),
inference(resolution,[],[f8,f35]) ).
fof(f82,plain,
( ~ d(u2r3(exist))
| ~ d(u2r1(exist))
| equalish(u2r3(exist),u2r1(exist)) ),
inference(resolution,[],[f69,f35]) ).
fof(f135,plain,
c(u2r2(exist)),
inference(subsumption_resolution,[],[f134,f32]) ).
fof(f134,plain,
( c(u2r2(exist))
| ~ r3least(exist) ),
inference(resolution,[],[f133,f20]) ).
fof(f133,plain,
( equalish(u2r3(exist),u2r1(exist))
| c(u2r2(exist)) ),
inference(subsumption_resolution,[],[f130,f110]) ).
fof(f130,plain,
( c(u2r2(exist))
| ~ c(u2r1(exist))
| equalish(u2r3(exist),u2r1(exist)) ),
inference(resolution,[],[f125,f64]) ).
fof(f64,plain,
( ~ c(u2r3(exist))
| ~ c(u2r1(exist))
| equalish(u2r3(exist),u2r1(exist)) ),
inference(resolution,[],[f59,f35]) ).
fof(f125,plain,
( c(u2r3(exist))
| c(u2r2(exist)) ),
inference(subsumption_resolution,[],[f124,f32]) ).
fof(f124,plain,
( c(u2r3(exist))
| c(u2r2(exist))
| ~ r3least(exist) ),
inference(resolution,[],[f123,f21]) ).
fof(f123,plain,
( equalish(u2r3(exist),u2r2(exist))
| c(u2r3(exist))
| c(u2r2(exist)) ),
inference(resolution,[],[f122,f43]) ).
fof(f122,plain,
( ~ d(u2r2(exist))
| equalish(u2r3(exist),u2r2(exist))
| c(u2r3(exist)) ),
inference(resolution,[],[f117,f44]) ).
fof(f117,plain,
( ~ d(u2r3(exist))
| ~ d(u2r2(exist))
| equalish(u2r3(exist),u2r2(exist)) ),
inference(resolution,[],[f70,f35]) ).
fof(f70,plain,
! [X0] :
( ~ r(exist,X0)
| ~ d(u2r2(exist))
| ~ d(X0)
| equalish(X0,u2r2(exist)) ),
inference(subsumption_resolution,[],[f67,f2]) ).
fof(f67,plain,
! [X0] :
( ~ d(X0)
| f(exist)
| ~ d(u2r2(exist))
| ~ r(exist,X0)
| equalish(X0,u2r2(exist)) ),
inference(resolution,[],[f31,f34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS010-1 : TPTP v8.1.2. Released v2.0.0.
% 0.03/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35 % Computer : n025.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 19:50:53 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 % (5573)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.38 % (5580)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.22/0.38 % (5574)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.22/0.38 % (5576)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.22/0.38 % (5575)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.22/0.38 % (5577)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.22/0.38 % (5579)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.22/0.38 % (5578)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.22/0.38 TRYING [1]
% 0.22/0.38 TRYING [1]
% 0.22/0.38 TRYING [2]
% 0.22/0.38 TRYING [3]
% 0.22/0.38 TRYING [1,1]
% 0.22/0.38 TRYING [2]
% 0.22/0.38 TRYING [1,1]
% 0.22/0.38 TRYING [3]
% 0.22/0.38 % (5578)First to succeed.
% 0.22/0.38 TRYING [4]
% 0.22/0.38 TRYING [2,2]
% 0.22/0.38 TRYING [2,2]
% 0.22/0.38 TRYING [4]
% 0.22/0.38 % (5578)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-5573"
% 0.22/0.38 TRYING [3,3]
% 0.22/0.38 TRYING [3,3]
% 0.22/0.38 % (5576)Also succeeded, but the first one will report.
% 0.22/0.38 % (5579)Also succeeded, but the first one will report.
% 0.22/0.38 % (5578)Refutation found. Thanks to Tanya!
% 0.22/0.38 % SZS status Unsatisfiable for theBenchmark
% 0.22/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.38 % (5578)------------------------------
% 0.22/0.38 % (5578)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.22/0.38 % (5578)Termination reason: Refutation
% 0.22/0.38
% 0.22/0.38 % (5578)Memory used [KB]: 765
% 0.22/0.38 % (5578)Time elapsed: 0.005 s
% 0.22/0.38 % (5578)Instructions burned: 6 (million)
% 0.22/0.38 % (5573)Success in time 0.021 s
%------------------------------------------------------------------------------