%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KRS082+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 11:42:14 AM UTC 2026
% Result : Unsatisfiable 0.12s 0.45s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 47 ( 4 unt; 0 def)
% Number of atoms : 182 ( 0 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 210 ( 75 ~; 64 |; 38 &)
% ( 4 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 124 ( 104 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( cUnsatisfiable(X0)
=> ? [X1] :
( rs(X0,X1)
& ? [X2] :
( rp(X1,X2)
& cowlThing(X2) )
& ! [X2] :
( rr(X1,X2)
=> cc(X2) )
& ! [X2] :
( rp(X1,X2)
=> ? [X3] :
( rr(X2,X3)
& cowlThing(X3) ) )
& ! [X2] :
( rp(X1,X2)
=> ? [X3] :
( rp(X2,X3)
& cowlThing(X3) ) )
& ! [X2] :
( rp(X1,X2)
=> ! [X3] :
( rr(X2,X3)
=> cc(X3) ) )
& ? [X2] :
( rr(X1,X2)
& cowlThing(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f4,axiom,
! [X0] :
( cUnsatisfiable(X0)
=> ca(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(f5,axiom,
! [X0] :
( cc(X0)
<=> ! [X1] :
( rinvR(X0,X1)
=> ! [X2] :
( rinvP(X1,X2)
=> ! [X3] :
( rinvS(X2,X3)
=> ~ ca(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(f6,axiom,
! [X0,X1] :
( rinvP(X0,X1)
<=> rp(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(f7,axiom,
! [X0,X1] :
( rinvR(X0,X1)
<=> rr(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
fof(f8,axiom,
! [X0,X1] :
( rinvS(X0,X1)
<=> rs(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).
fof(f10,axiom,
cUnsatisfiable(i2003_11_14_17_19_28752),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_9) ).
fof(f11,plain,
! [X0] :
( cUnsatisfiable(X0)
=> ? [X1] :
( rs(X0,X1)
& ? [X2] :
( rp(X1,X2)
& cowlThing(X2) )
& ! [X3] :
( rr(X1,X3)
=> cc(X3) )
& ! [X4] :
( rp(X1,X4)
=> ? [X5] :
( rr(X4,X5)
& cowlThing(X5) ) )
& ! [X6] :
( rp(X1,X6)
=> ? [X7] :
( rp(X6,X7)
& cowlThing(X7) ) )
& ! [X8] :
( rp(X1,X8)
=> ! [X9] :
( rr(X8,X9)
=> cc(X9) ) )
& ? [X10] :
( rr(X1,X10)
& cowlThing(X10) ) ) ),
inference(rectify,[],[f3]) ).
fof(f12,plain,
! [X0] :
( cc(X0)
=> ! [X1] :
( rinvR(X0,X1)
=> ! [X2] :
( rinvP(X1,X2)
=> ! [X3] :
( rinvS(X2,X3)
=> ~ ca(X3) ) ) ) ),
inference(unused_predicate_definition_removal,[],[f5]) ).
fof(f13,plain,
! [X0,X1] :
( rs(X1,X0)
=> rinvS(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f8]) ).
fof(f14,plain,
! [X0,X1] :
( rp(X1,X0)
=> rinvP(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f6]) ).
fof(f15,plain,
! [X0,X1] :
( rr(X1,X0)
=> rinvR(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f7]) ).
fof(f18,plain,
! [X0] :
( cUnsatisfiable(X0)
=> ? [X1] :
( rs(X0,X1)
& ? [X2] : rp(X1,X2)
& ! [X3] :
( rr(X1,X3)
=> cc(X3) )
& ! [X4] :
( rp(X1,X4)
=> ? [X5] : rr(X4,X5) )
& ! [X6] :
( rp(X1,X6)
=> ? [X7] : rp(X6,X7) )
& ! [X8] :
( rp(X1,X8)
=> ! [X9] :
( rr(X8,X9)
=> cc(X9) ) )
& ? [X10] : rr(X1,X10) ) ),
inference(pure_predicate_removal,[],[f11]) ).
fof(f19,plain,
! [X0] :
( ? [X1] :
( rs(X0,X1)
& ? [X2] : rp(X1,X2)
& ! [X3] :
( cc(X3)
| ~ rr(X1,X3) )
& ! [X4] :
( ? [X5] : rr(X4,X5)
| ~ rp(X1,X4) )
& ! [X6] :
( ? [X7] : rp(X6,X7)
| ~ rp(X1,X6) )
& ! [X8] :
( ! [X9] :
( cc(X9)
| ~ rr(X8,X9) )
| ~ rp(X1,X8) )
& ? [X10] : rr(X1,X10) )
| ~ cUnsatisfiable(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f20,plain,
! [X0] :
( ca(X0)
| ~ cUnsatisfiable(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f21,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ~ ca(X3)
| ~ rinvS(X2,X3) )
| ~ rinvP(X1,X2) )
| ~ rinvR(X0,X1) )
| ~ cc(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f22,plain,
! [X0,X1] :
( rinvP(X0,X1)
| ~ rp(X1,X0) ),
inference(ennf_transformation,[],[f14]) ).
fof(f23,plain,
! [X0,X1] :
( rinvR(X0,X1)
| ~ rr(X1,X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f24,plain,
! [X0,X1] :
( rinvS(X0,X1)
| ~ rs(X1,X0) ),
inference(ennf_transformation,[],[f13]) ).
fof(f27,plain,
! [X0] :
( ( rs(X0,sK0(X0))
& rp(sK0(X0),sK1(X0))
& ! [X3] :
( cc(X3)
| ~ rr(sK0(X0),X3) )
& ! [X4] :
( rr(X4,sK2(X4))
| ~ rp(sK0(X0),X4) )
& ! [X6] :
( rp(X6,sK3(X6))
| ~ rp(sK0(X0),X6) )
& ! [X8] :
( ! [X9] :
( cc(X9)
| ~ rr(X8,X9) )
| ~ rp(sK0(X0),X8) )
& rr(sK0(X0),sK4(X0)) )
| ~ cUnsatisfiable(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X1,sK0(X0)),skolemize(X2,sK1(X0)),skolemize(X5,sK2(X4)),skolemize(X7,sK3(X6)),skolemize(X10,sK4(X0))],[f19]) ).
fof(f29,plain,
! [X0,X8,X9] :
( ~ rp(sK0(X0),X8)
| ~ rr(X8,X9)
| cc(X9)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f31,plain,
! [X0,X4] :
( ~ rp(sK0(X0),X4)
| rr(X4,sK2(X4))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f33,plain,
! [X0] :
( rp(sK0(X0),sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f34,plain,
! [X0] :
( rs(X0,sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f35,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| ca(X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f36,plain,
! [X2,X3,X0,X1] :
( ~ rinvS(X2,X3)
| ~ ca(X3)
| ~ rinvP(X1,X2)
| ~ rinvR(X0,X1)
| ~ cc(X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f37,plain,
! [X0,X1] :
( ~ rp(X1,X0)
| rinvP(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f38,plain,
! [X0,X1] :
( ~ rr(X1,X0)
| rinvR(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f39,plain,
! [X0,X1] :
( ~ rs(X1,X0)
| rinvS(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f41,plain,
cUnsatisfiable(i2003_11_14_17_19_28752),
inference(cnf_transformation,[],[f10]) ).
fof(f43,plain,
! [X0] :
( rinvS(sK0(X0),X0)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f39,f34]) ).
fof(f45,plain,
! [X0] :
( rinvP(sK1(X0),sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f33,f37]) ).
fof(f53,plain,
! [X0] :
( rr(sK1(X0),sK2(sK1(X0)))
| ~ cUnsatisfiable(X0)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f31,f33]) ).
fof(f54,plain,
! [X0] :
( rr(sK1(X0),sK2(sK1(X0)))
| ~ cUnsatisfiable(X0) ),
inference(duplicate_literal_removal,[],[f53]) ).
fof(f55,plain,
! [X0] :
( rinvR(sK2(sK1(X0)),sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f54,f38]) ).
fof(f56,plain,
! [X0,X1] :
( ~ rr(sK1(X0),X1)
| cc(X1)
| ~ cUnsatisfiable(X0)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f29,f33]) ).
fof(f57,plain,
! [X0,X1] :
( ~ rr(sK1(X0),X1)
| cc(X1)
| ~ cUnsatisfiable(X0) ),
inference(duplicate_literal_removal,[],[f56]) ).
fof(f58,plain,
! [X0] :
( cc(sK2(sK1(X0)))
| ~ cUnsatisfiable(X0)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f57,f54]) ).
fof(f59,plain,
! [X0] :
( cc(sK2(sK1(X0)))
| ~ cUnsatisfiable(X0) ),
inference(duplicate_literal_removal,[],[f58]) ).
fof(f60,plain,
! [X2,X0,X1] :
( ~ ca(X0)
| ~ rinvP(X1,sK0(X0))
| ~ rinvR(X2,X1)
| ~ cc(X2)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f36,f43]) ).
fof(f61,plain,
! [X2,X0,X1] :
( ~ rinvP(X1,sK0(X0))
| ~ rinvR(X2,X1)
| ~ cc(X2)
| ~ cUnsatisfiable(X0) ),
inference(forward_subsumption_resolution,[],[f60,f35]) ).
fof(f67,plain,
! [X0,X1] :
( ~ rinvR(X0,sK1(X1))
| ~ cc(X0)
| ~ cUnsatisfiable(X1)
| ~ cUnsatisfiable(X1) ),
inference(resolution,[],[f61,f45]) ).
fof(f68,plain,
! [X0,X1] :
( ~ rinvR(X0,sK1(X1))
| ~ cc(X0)
| ~ cUnsatisfiable(X1) ),
inference(duplicate_literal_removal,[],[f67]) ).
fof(f69,plain,
! [X0] :
( ~ cc(sK2(sK1(X0)))
| ~ cUnsatisfiable(X0)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f68,f55]) ).
fof(f70,plain,
! [X0] :
( ~ cc(sK2(sK1(X0)))
| ~ cUnsatisfiable(X0) ),
inference(duplicate_literal_removal,[],[f69]) ).
fof(f71,plain,
! [X0] : ~ cUnsatisfiable(X0),
inference(forward_subsumption_resolution,[],[f70,f59]) ).
fof(f73,plain,
$false,
inference(resolution,[],[f71,f41]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS082+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n026.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 13:22:56 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41 Running first-order model finding
% 0.12/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.45 % (2849818)Will run a generic schedule for satisfiability detection.
% 0.12/0.45 % (2849826)dis+10_1_sil=32000:sp=arity:random_seed=2371771272:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.12/0.45 % (2849826) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2849818-2849826"...
% 0.12/0.45 % (2849826)...printing done.
% 0.12/0.45 % (2849826)Refutation found. Thanks to Tanya!
% 0.12/0.45 % SZS status Unsatisfiable for theBenchmark
% 0.12/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.46 % (2849826)------------------------------
% 0.12/0.46 % (2849826)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.46 % (2849826)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.46 % (2849826)CaDiCaL version: 2.1.3
% 0.12/0.46 % (2849826)Termination reason: Refutation
% 0.12/0.46 % (2849826)Time elapsed: 0.001 s
% 0.12/0.46 % (2849826)Peak memory usage: 11 MB
% 0.12/0.46 % (2849826)Instructions burned: 3 (million)
% 0.12/0.46 % (2849818)Success in time 0.032 s
% 0.12/0.46 % Vampire exiting
%------------------------------------------------------------------------------