%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KRS078+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 : n007.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:13 AM UTC 2026
% Result : Unsatisfiable 0.19s 0.47s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 36 ( 11 unt; 1 def)
% Number of atoms : 194 ( 17 equ)
% Maximal formula atoms : 22 ( 5 avg)
% Number of connectives : 243 ( 85 ~; 73 |; 74 &)
% ( 7 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-1 aty)
% Number of variables : 104 ( 71 !; 33 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f16,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( rr(X0,X1)
& ? [X2] :
( rinvR(X1,X2)
& ! [X3] :
( rs(X2,X3)
=> cp(X3) ) )
& ! [X4,X5] :
( ( rinvR(X1,X4)
& rinvR(X1,X5) )
=> X4 = X5 ) )
& ? [X1] :
( rs(X0,X1)
& ~ cq(X1)
& ~ cp(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f17,axiom,
! [X0,X1] :
( rinvR(X0,X1)
<=> rr(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(f18,axiom,
cUnsatisfiable(i2003_11_14_17_19_13721),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(f19,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( rr(X0,X1)
& ? [X2] :
( rinvR(X1,X2)
& ! [X3] :
( rs(X2,X3)
=> cp(X3) ) )
& ! [X4,X5] :
( ( rinvR(X1,X4)
& rinvR(X1,X5) )
=> X4 = X5 ) )
& ? [X6] :
( rs(X0,X6)
& ~ cq(X6)
& ~ cp(X6) ) ) ),
inference(rectify,[],[f16]) ).
fof(f46,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( rr(X0,X1)
& ? [X2] :
( rinvR(X1,X2)
& ! [X3] :
( cp(X3)
| ~ rs(X2,X3) ) )
& ! [X4,X5] :
( X4 = X5
| ~ rinvR(X1,X4)
| ~ rinvR(X1,X5) ) )
& ? [X6] :
( rs(X0,X6)
& ~ cq(X6)
& ~ cp(X6) ) ) ),
inference(ennf_transformation,[],[f19]) ).
fof(f47,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( rr(X0,X1)
& ? [X2] :
( rinvR(X1,X2)
& ! [X3] :
( cp(X3)
| ~ rs(X2,X3) ) )
& ! [X4,X5] :
( X4 = X5
| ~ rinvR(X1,X4)
| ~ rinvR(X1,X5) ) )
& ? [X6] :
( rs(X0,X6)
& ~ cq(X6)
& ~ cp(X6) ) ) ),
inference(flattening,[],[f46]) ).
fof(f48,definition,
! [X0] :
( sP0(X0)
<=> ( ? [X1] :
( rr(X0,X1)
& ? [X2] :
( rinvR(X1,X2)
& ! [X3] :
( cp(X3)
| ~ rs(X2,X3) ) )
& ! [X4,X5] :
( X4 = X5
| ~ rinvR(X1,X4)
| ~ rinvR(X1,X5) ) )
& ? [X6] :
( rs(X0,X6)
& ~ cq(X6)
& ~ cp(X6) ) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f49,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> sP0(X0) ),
inference(definition_folding,[],[f47,f48]) ).
fof(f51,plain,
! [X0] :
( ( sP0(X0)
| ! [X1] :
( ~ rr(X0,X1)
| ! [X2] :
( ~ rinvR(X1,X2)
| ? [X3] :
( ~ cp(X3)
& rs(X2,X3) ) )
| ? [X4,X5] :
( X4 != X5
& rinvR(X1,X4)
& rinvR(X1,X5) ) )
| ! [X6] :
( ~ rs(X0,X6)
| cq(X6)
| cp(X6) ) )
& ( ( ? [X1] :
( rr(X0,X1)
& ? [X2] :
( rinvR(X1,X2)
& ! [X3] :
( cp(X3)
| ~ rs(X2,X3) ) )
& ! [X4,X5] :
( X4 = X5
| ~ rinvR(X1,X4)
| ~ rinvR(X1,X5) ) )
& ? [X6] :
( rs(X0,X6)
& ~ cq(X6)
& ~ cp(X6) ) )
| ~ sP0(X0) ) ),
inference(nnf_transformation,[],[f48]) ).
fof(f52,plain,
! [X0] :
( ( sP0(X0)
| ! [X1] :
( ~ rr(X0,X1)
| ! [X2] :
( ~ rinvR(X1,X2)
| ? [X3] :
( ~ cp(X3)
& rs(X2,X3) ) )
| ? [X4,X5] :
( X4 != X5
& rinvR(X1,X4)
& rinvR(X1,X5) ) )
| ! [X6] :
( ~ rs(X0,X6)
| cq(X6)
| cp(X6) ) )
& ( ( ? [X1] :
( rr(X0,X1)
& ? [X2] :
( rinvR(X1,X2)
& ! [X3] :
( cp(X3)
| ~ rs(X2,X3) ) )
& ! [X4,X5] :
( X4 = X5
| ~ rinvR(X1,X4)
| ~ rinvR(X1,X5) ) )
& ? [X6] :
( rs(X0,X6)
& ~ cq(X6)
& ~ cp(X6) ) )
| ~ sP0(X0) ) ),
inference(flattening,[],[f51]) ).
fof(f53,plain,
! [X0] :
( ( sP0(X0)
| ! [X1] :
( ~ rr(X0,X1)
| ! [X2] :
( ~ rinvR(X1,X2)
| ? [X3] :
( ~ cp(X3)
& rs(X2,X3) ) )
| ? [X4,X5] :
( X4 != X5
& rinvR(X1,X4)
& rinvR(X1,X5) ) )
| ! [X6] :
( ~ rs(X0,X6)
| cq(X6)
| cp(X6) ) )
& ( ( ? [X7] :
( rr(X0,X7)
& ? [X8] :
( rinvR(X7,X8)
& ! [X9] :
( cp(X9)
| ~ rs(X8,X9) ) )
& ! [X10,X11] :
( X10 = X11
| ~ rinvR(X7,X10)
| ~ rinvR(X7,X11) ) )
& ? [X12] :
( rs(X0,X12)
& ~ cq(X12)
& ~ cp(X12) ) )
| ~ sP0(X0) ) ),
inference(rectify,[],[f52]) ).
fof(f54,plain,
! [X0] :
( ( sP0(X0)
| ! [X1] :
( ~ rr(X0,X1)
| ! [X2] :
( ~ rinvR(X1,X2)
| ( ~ cp(sK1(X2))
& rs(X2,sK1(X2)) ) )
| ( sK2(X1) != sK3(X1)
& rinvR(X1,sK2(X1))
& rinvR(X1,sK3(X1)) ) )
| ! [X6] :
( ~ rs(X0,X6)
| cq(X6)
| cp(X6) ) )
& ( ( rr(X0,sK4(X0))
& rinvR(sK4(X0),sK5(X0))
& ! [X9] :
( cp(X9)
| ~ rs(sK5(X0),X9) )
& ! [X10,X11] :
( X10 = X11
| ~ rinvR(sK4(X0),X10)
| ~ rinvR(sK4(X0),X11) )
& rs(X0,sK6(X0))
& ~ cq(sK6(X0))
& ~ cp(sK6(X0)) )
| ~ sP0(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5,sK6]),skolemize(X3,sK1(X2)),skolemize(X4,sK2(X1)),skolemize(X5,sK3(X1)),skolemize(X7,sK4(X0)),skolemize(X8,sK5(X0)),skolemize(X12,sK6(X0))],[f53]) ).
fof(f55,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ~ sP0(X0) )
& ( sP0(X0)
| ~ cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f49]) ).
fof(f56,plain,
! [X0,X1] :
( ( rinvR(X0,X1)
| ~ rr(X1,X0) )
& ( rr(X1,X0)
| ~ rinvR(X0,X1) ) ),
inference(nnf_transformation,[],[f17]) ).
fof(f74,plain,
! [X0] :
( ~ sP0(X0)
| ~ cp(sK6(X0)) ),
inference(cnf_transformation,[],[f54]) ).
fof(f76,plain,
! [X0] :
( ~ sP0(X0)
| rs(X0,sK6(X0)) ),
inference(cnf_transformation,[],[f54]) ).
fof(f77,plain,
! [X10,X0,X11] :
( ~ sP0(X0)
| ~ rinvR(sK4(X0),X10)
| ~ rinvR(sK4(X0),X11)
| X10 = X11 ),
inference(cnf_transformation,[],[f54]) ).
fof(f78,plain,
! [X0,X9] :
( ~ sP0(X0)
| ~ rs(sK5(X0),X9)
| cp(X9) ),
inference(cnf_transformation,[],[f54]) ).
fof(f79,plain,
! [X0] :
( ~ sP0(X0)
| rinvR(sK4(X0),sK5(X0)) ),
inference(cnf_transformation,[],[f54]) ).
fof(f80,plain,
! [X0] :
( ~ sP0(X0)
| rr(X0,sK4(X0)) ),
inference(cnf_transformation,[],[f54]) ).
fof(f87,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| sP0(X0) ),
inference(cnf_transformation,[],[f55]) ).
fof(f90,plain,
! [X0,X1] :
( ~ rr(X1,X0)
| rinvR(X0,X1) ),
inference(cnf_transformation,[],[f56]) ).
fof(f91,plain,
cUnsatisfiable(i2003_11_14_17_19_13721),
inference(cnf_transformation,[],[f18]) ).
fof(f93,plain,
sP0(i2003_11_14_17_19_13721),
inference(resolution,[],[f87,f91]) ).
fof(f95,plain,
~ cp(sK6(i2003_11_14_17_19_13721)),
inference(resolution,[],[f74,f93]) ).
fof(f97,plain,
rs(i2003_11_14_17_19_13721,sK6(i2003_11_14_17_19_13721)),
inference(resolution,[],[f76,f93]) ).
fof(f98,plain,
rr(i2003_11_14_17_19_13721,sK4(i2003_11_14_17_19_13721)),
inference(resolution,[],[f80,f93]) ).
fof(f99,plain,
rinvR(sK4(i2003_11_14_17_19_13721),i2003_11_14_17_19_13721),
inference(resolution,[],[f90,f98]) ).
fof(f104,plain,
rinvR(sK4(i2003_11_14_17_19_13721),sK5(i2003_11_14_17_19_13721)),
inference(resolution,[],[f79,f93]) ).
fof(f106,plain,
! [X0] :
( ~ rs(sK5(i2003_11_14_17_19_13721),X0)
| cp(X0) ),
inference(resolution,[],[f78,f93]) ).
fof(f123,plain,
! [X0,X1] :
( ~ rinvR(sK4(i2003_11_14_17_19_13721),X0)
| ~ rinvR(sK4(i2003_11_14_17_19_13721),X1)
| X0 = X1 ),
inference(resolution,[],[f77,f93]) ).
fof(f134,plain,
! [X0] :
( ~ rinvR(sK4(i2003_11_14_17_19_13721),X0)
| sK5(i2003_11_14_17_19_13721) = X0 ),
inference(resolution,[],[f123,f104]) ).
fof(f135,plain,
i2003_11_14_17_19_13721 = sK5(i2003_11_14_17_19_13721),
inference(resolution,[],[f134,f99]) ).
fof(f139,plain,
! [X0] :
( ~ rs(i2003_11_14_17_19_13721,X0)
| cp(X0) ),
inference(superposition,[],[f106,f135]) ).
fof(f144,plain,
cp(sK6(i2003_11_14_17_19_13721)),
inference(resolution,[],[f139,f97]) ).
fof(f145,plain,
$false,
inference(forward_subsumption_resolution,[],[f144,f95]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KRS078+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.11/0.40 % Computer : n007.cluster.edu
% 0.11/0.40 % Model : x86_64 x86_64
% 0.11/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.40 % Memory : 8046.5625MB
% 0.11/0.40 % OS : Linux 6.8.0-71-generic
% 0.11/0.40 % CPULimit : 300
% 0.11/0.40 % WCLimit : 300
% 0.11/0.40 % DateTime : Sun Sep 27 13:19:40 UTC 2026
% 0.11/0.40 % CPUTime :
% 0.11/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.43 Running first-order model finding
% 0.11/0.43 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.19/0.47 % (1414021)Will run a generic schedule for satisfiability detection.
% 0.19/0.47 % (1414031)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2167097777:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.47 % (1414031) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1414021-1414031"...
% 0.19/0.47 % (1414027)% WARNING: option uhcvi not known.
% 0.19/0.47 % (1414031)...printing done.
% 0.19/0.47 % (1414031)Refutation found. Thanks to Tanya!
% 0.19/0.47 % SZS status Unsatisfiable for theBenchmark
% 0.19/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.47 % (1414031)------------------------------
% 0.19/0.47 % (1414031)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.47 % (1414031)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.47 % (1414031)CaDiCaL version: 2.1.3
% 0.19/0.47 % (1414031)Termination reason: Refutation
% 0.19/0.47 % (1414031)Time elapsed: 0.002 s
% 0.19/0.47 % (1414031)Peak memory usage: 12 MB
% 0.19/0.47 % (1414031)Instructions burned: 4 (million)
% 0.19/0.47 % (1414021)Success in time 0.03 s
% 0.19/0.47 % Vampire exiting
%------------------------------------------------------------------------------