%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KRS088+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 : n010.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:15 AM UTC 2026
% Result : Unsatisfiable 0.12s 0.44s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 29 ( 9 unt; 0 def)
% Number of atoms : 96 ( 6 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 112 ( 45 ~; 39 |; 23 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 54 ( 44 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ? [X1] :
( rf(X0,X1)
& ! [X2] :
( rinvF(X1,X2)
=> ? [X3] :
( rf(X2,X3)
& ~ cp1(X3) ) )
& cp1(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f18,axiom,
! [X0,X1,X2] :
( ( rf(X0,X1)
& rf(X0,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(f19,axiom,
! [X0,X1] :
( rinvF(X0,X1)
<=> rf(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(f22,axiom,
cUnsatisfiable(i2003_11_14_17_19_49673),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).
fof(f51,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ? [X1] :
( rf(X0,X1)
& ! [X2] :
( ? [X3] :
( rf(X2,X3)
& ~ cp1(X3) )
| ~ rinvF(X1,X2) )
& cp1(X1) ) ),
inference(ennf_transformation,[],[f17]) ).
fof(f52,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf(X0,X1)
| ~ rf(X0,X2) ),
inference(ennf_transformation,[],[f18]) ).
fof(f53,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf(X0,X1)
| ~ rf(X0,X2) ),
inference(flattening,[],[f52]) ).
fof(f57,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ rf(X0,X1)
| ? [X2] :
( ! [X3] :
( ~ rf(X2,X3)
| cp1(X3) )
& rinvF(X1,X2) )
| ~ cp1(X1) ) )
& ( ? [X1] :
( rf(X0,X1)
& ! [X2] :
( ? [X3] :
( rf(X2,X3)
& ~ cp1(X3) )
| ~ rinvF(X1,X2) )
& cp1(X1) )
| ~ cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f51]) ).
fof(f58,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ rf(X0,X1)
| ? [X2] :
( ! [X3] :
( ~ rf(X2,X3)
| cp1(X3) )
& rinvF(X1,X2) )
| ~ cp1(X1) ) )
& ( ? [X4] :
( rf(X0,X4)
& ! [X5] :
( ? [X6] :
( rf(X5,X6)
& ~ cp1(X6) )
| ~ rinvF(X4,X5) )
& cp1(X4) )
| ~ cUnsatisfiable(X0) ) ),
inference(rectify,[],[f57]) ).
fof(f59,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ rf(X0,X1)
| ( ! [X3] :
( ~ rf(sK0(X1),X3)
| cp1(X3) )
& rinvF(X1,sK0(X1)) )
| ~ cp1(X1) ) )
& ( ( rf(X0,sK1(X0))
& ! [X5] :
( ( rf(X5,sK2(X5))
& ~ cp1(sK2(X5)) )
| ~ rinvF(sK1(X0),X5) )
& cp1(sK1(X0)) )
| ~ cUnsatisfiable(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X2,sK0(X1)),skolemize(X4,sK1(X0)),skolemize(X6,sK2(X5))],[f58]) ).
fof(f60,plain,
! [X0,X1] :
( ( rinvF(X0,X1)
| ~ rf(X1,X0) )
& ( rf(X1,X0)
| ~ rinvF(X0,X1) ) ),
inference(nnf_transformation,[],[f19]) ).
fof(f80,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| cp1(sK1(X0)) ),
inference(cnf_transformation,[],[f59]) ).
fof(f81,plain,
! [X0,X5] :
( ~ cp1(sK2(X5))
| ~ rinvF(sK1(X0),X5)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f59]) ).
fof(f82,plain,
! [X0,X5] :
( ~ cUnsatisfiable(X0)
| ~ rinvF(sK1(X0),X5)
| rf(X5,sK2(X5)) ),
inference(cnf_transformation,[],[f59]) ).
fof(f83,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rf(X0,sK1(X0)) ),
inference(cnf_transformation,[],[f59]) ).
fof(f86,plain,
! [X2,X0,X1] :
( ~ rf(X0,X1)
| X1 = X2
| ~ rf(X0,X2) ),
inference(cnf_transformation,[],[f53]) ).
fof(f88,plain,
! [X0,X1] :
( ~ rf(X1,X0)
| rinvF(X0,X1) ),
inference(cnf_transformation,[],[f60]) ).
fof(f92,plain,
cUnsatisfiable(i2003_11_14_17_19_49673),
inference(cnf_transformation,[],[f22]) ).
fof(f94,plain,
cp1(sK1(i2003_11_14_17_19_49673)),
inference(resolution,[],[f80,f92]) ).
fof(f95,plain,
rf(i2003_11_14_17_19_49673,sK1(i2003_11_14_17_19_49673)),
inference(resolution,[],[f83,f92]) ).
fof(f96,plain,
rinvF(sK1(i2003_11_14_17_19_49673),i2003_11_14_17_19_49673),
inference(resolution,[],[f88,f95]) ).
fof(f112,plain,
! [X0] :
( ~ rf(i2003_11_14_17_19_49673,X0)
| sK1(i2003_11_14_17_19_49673) = X0 ),
inference(resolution,[],[f86,f95]) ).
fof(f114,plain,
! [X0] :
( ~ rinvF(sK1(i2003_11_14_17_19_49673),X0)
| rf(X0,sK2(X0)) ),
inference(resolution,[],[f82,f92]) ).
fof(f115,plain,
rf(i2003_11_14_17_19_49673,sK2(i2003_11_14_17_19_49673)),
inference(resolution,[],[f114,f96]) ).
fof(f125,plain,
sK1(i2003_11_14_17_19_49673) = sK2(i2003_11_14_17_19_49673),
inference(resolution,[],[f115,f112]) ).
fof(f139,plain,
! [X0] :
( ~ cp1(sK1(i2003_11_14_17_19_49673))
| ~ rinvF(sK1(X0),i2003_11_14_17_19_49673)
| ~ cUnsatisfiable(X0) ),
inference(superposition,[],[f81,f125]) ).
fof(f140,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| ~ rinvF(sK1(X0),i2003_11_14_17_19_49673) ),
inference(forward_subsumption_resolution,[],[f139,f94]) ).
fof(f143,plain,
~ rinvF(sK1(i2003_11_14_17_19_49673),i2003_11_14_17_19_49673),
inference(resolution,[],[f140,f92]) ).
fof(f144,plain,
$false,
inference(forward_subsumption_resolution,[],[f143,f96]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KRS088+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.37 % Computer : n010.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sun Sep 27 13:22:16 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.44 % (967562)Will run a generic schedule for satisfiability detection.
% 0.12/0.44 % (967572)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3431732825:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.12/0.44 % (967572) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-967562-967572"...
% 0.12/0.44 % (967572)...printing done.
% 0.12/0.44 % (967572)Refutation found. Thanks to Tanya!
% 0.12/0.44 % SZS status Unsatisfiable for theBenchmark
% 0.12/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.44 % (967572)------------------------------
% 0.12/0.44 % (967572)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.44 % (967572)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.44 % (967572)CaDiCaL version: 2.1.3
% 0.12/0.44 % (967572)Termination reason: Refutation
% 0.12/0.44 % (967572)Time elapsed: 0.002 s
% 0.12/0.44 % (967572)Peak memory usage: 12 MB
% 0.12/0.44 % (967572)Instructions burned: 3 (million)
% 0.12/0.44 % (967562)Success in time 0.025 s
% 0.12/0.44 % Vampire exiting
%------------------------------------------------------------------------------