%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KRS099+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 : n011.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:16 AM UTC 2026
% Result : Unsatisfiable 0.17s 0.46s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 5 unt; 3 def)
% Number of atoms : 222 ( 56 equ)
% Maximal formula atoms : 16 ( 7 avg)
% Number of connectives : 295 ( 104 ~; 86 |; 91 &)
% ( 8 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-1 aty)
% Number of variables : 107 ( 77 !; 30 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f13,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1,X2,X3] :
( rtt(X0,X1)
& rtt(X0,X2)
& rtt(X0,X3)
& X1 != X2
& X1 != X3
& X2 != X3 )
& ! [X4] :
( rtt(X0,X4)
=> ca(X4) )
& ! [X1,X2] :
( ( rtt(X0,X1)
& rtt(X0,X2) )
=> X1 = X2 )
& ! [X1,X2] :
( ( rtt(X0,X1)
& rtt(X0,X2) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f16,axiom,
cUnsatisfiable(i2003_11_14_17_20_29215),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(f17,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1,X2,X3] :
( rtt(X0,X1)
& rtt(X0,X2)
& rtt(X0,X3)
& X1 != X2
& X1 != X3
& X2 != X3 )
& ! [X4] :
( rtt(X0,X4)
=> ca(X4) )
& ! [X5,X6] :
( ( rtt(X0,X5)
& rtt(X0,X6) )
=> X5 = X6 )
& ! [X7,X8] :
( ( rtt(X0,X7)
& rtt(X0,X8) )
=> X7 = X8 ) ) ),
inference(rectify,[],[f13]) ).
fof(f38,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1,X2,X3] :
( rtt(X0,X1)
& rtt(X0,X2)
& rtt(X0,X3)
& X1 != X2
& X1 != X3
& X2 != X3 )
& ! [X4] :
( ca(X4)
| ~ rtt(X0,X4) )
& ! [X5,X6] :
( X5 = X6
| ~ rtt(X0,X5)
| ~ rtt(X0,X6) )
& ! [X7,X8] :
( X7 = X8
| ~ rtt(X0,X7)
| ~ rtt(X0,X8) ) ) ),
inference(ennf_transformation,[],[f17]) ).
fof(f39,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1,X2,X3] :
( rtt(X0,X1)
& rtt(X0,X2)
& rtt(X0,X3)
& X1 != X2
& X1 != X3
& X2 != X3 )
& ! [X4] :
( ca(X4)
| ~ rtt(X0,X4) )
& ! [X5,X6] :
( X5 = X6
| ~ rtt(X0,X5)
| ~ rtt(X0,X6) )
& ! [X7,X8] :
( X7 = X8
| ~ rtt(X0,X7)
| ~ rtt(X0,X8) ) ) ),
inference(flattening,[],[f38]) ).
fof(f43,definition,
! [X0] :
( sP0(X0)
<=> ! [X7,X8] :
( X7 = X8
| ~ rtt(X0,X7)
| ~ rtt(X0,X8) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f44,definition,
! [X0] :
( sP1(X0)
<=> ? [X1,X2,X3] :
( rtt(X0,X1)
& rtt(X0,X2)
& rtt(X0,X3)
& X1 != X2
& X1 != X3
& X2 != X3 ) ),
introduced(definition,[new_symbols(definition,[sP1])],[predicate_definition_introduction]) ).
fof(f45,definition,
! [X0] :
( sP2(X0)
<=> ( sP1(X0)
& ! [X4] :
( ca(X4)
| ~ rtt(X0,X4) )
& ! [X5,X6] :
( X5 = X6
| ~ rtt(X0,X5)
| ~ rtt(X0,X6) )
& sP0(X0) ) ),
introduced(definition,[new_symbols(definition,[sP2])],[predicate_definition_introduction]) ).
fof(f46,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> sP2(X0) ),
inference(definition_folding,[],[f39,f45,f44,f43]) ).
fof(f48,plain,
! [X0] :
( ( sP2(X0)
| ~ sP1(X0)
| ? [X4] :
( ~ ca(X4)
& rtt(X0,X4) )
| ? [X5,X6] :
( X5 != X6
& rtt(X0,X5)
& rtt(X0,X6) )
| ~ sP0(X0) )
& ( ( sP1(X0)
& ! [X4] :
( ca(X4)
| ~ rtt(X0,X4) )
& ! [X5,X6] :
( X5 = X6
| ~ rtt(X0,X5)
| ~ rtt(X0,X6) )
& sP0(X0) )
| ~ sP2(X0) ) ),
inference(nnf_transformation,[],[f45]) ).
fof(f49,plain,
! [X0] :
( ( sP2(X0)
| ~ sP1(X0)
| ? [X4] :
( ~ ca(X4)
& rtt(X0,X4) )
| ? [X5,X6] :
( X5 != X6
& rtt(X0,X5)
& rtt(X0,X6) )
| ~ sP0(X0) )
& ( ( sP1(X0)
& ! [X4] :
( ca(X4)
| ~ rtt(X0,X4) )
& ! [X5,X6] :
( X5 = X6
| ~ rtt(X0,X5)
| ~ rtt(X0,X6) )
& sP0(X0) )
| ~ sP2(X0) ) ),
inference(flattening,[],[f48]) ).
fof(f50,plain,
! [X0] :
( ( sP2(X0)
| ~ sP1(X0)
| ? [X1] :
( ~ ca(X1)
& rtt(X0,X1) )
| ? [X2,X3] :
( X2 != X3
& rtt(X0,X2)
& rtt(X0,X3) )
| ~ sP0(X0) )
& ( ( sP1(X0)
& ! [X4] :
( ca(X4)
| ~ rtt(X0,X4) )
& ! [X5,X6] :
( X5 = X6
| ~ rtt(X0,X5)
| ~ rtt(X0,X6) )
& sP0(X0) )
| ~ sP2(X0) ) ),
inference(rectify,[],[f49]) ).
fof(f51,plain,
! [X0] :
( ( sP2(X0)
| ~ sP1(X0)
| ( ~ ca(sK3(X0))
& rtt(X0,sK3(X0)) )
| ( sK4(X0) != sK5(X0)
& rtt(X0,sK4(X0))
& rtt(X0,sK5(X0)) )
| ~ sP0(X0) )
& ( ( sP1(X0)
& ! [X4] :
( ca(X4)
| ~ rtt(X0,X4) )
& ! [X5,X6] :
( X5 = X6
| ~ rtt(X0,X5)
| ~ rtt(X0,X6) )
& sP0(X0) )
| ~ sP2(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5]),skolemize(X1,sK3(X0)),skolemize(X2,sK4(X0)),skolemize(X3,sK5(X0))],[f50]) ).
fof(f52,plain,
! [X0] :
( ( sP1(X0)
| ! [X1,X2,X3] :
( ~ rtt(X0,X1)
| ~ rtt(X0,X2)
| ~ rtt(X0,X3)
| X1 = X2
| X1 = X3
| X2 = X3 ) )
& ( ? [X1,X2,X3] :
( rtt(X0,X1)
& rtt(X0,X2)
& rtt(X0,X3)
& X1 != X2
& X1 != X3
& X2 != X3 )
| ~ sP1(X0) ) ),
inference(nnf_transformation,[],[f44]) ).
fof(f53,plain,
! [X0] :
( ( sP1(X0)
| ! [X1,X2,X3] :
( ~ rtt(X0,X1)
| ~ rtt(X0,X2)
| ~ rtt(X0,X3)
| X1 = X2
| X1 = X3
| X2 = X3 ) )
& ( ? [X4,X5,X6] :
( rtt(X0,X4)
& rtt(X0,X5)
& rtt(X0,X6)
& X4 != X5
& X4 != X6
& X5 != X6 )
| ~ sP1(X0) ) ),
inference(rectify,[],[f52]) ).
fof(f54,plain,
! [X0] :
( ( sP1(X0)
| ! [X1,X2,X3] :
( ~ rtt(X0,X1)
| ~ rtt(X0,X2)
| ~ rtt(X0,X3)
| X1 = X2
| X1 = X3
| X2 = X3 ) )
& ( ( rtt(X0,sK6(X0))
& rtt(X0,sK7(X0))
& rtt(X0,sK8(X0))
& sK6(X0) != sK7(X0)
& sK6(X0) != sK8(X0)
& sK7(X0) != sK8(X0) )
| ~ sP1(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7,sK8]),skolemize(X4,sK6(X0)),skolemize(X5,sK7(X0)),skolemize(X6,sK8(X0))],[f53]) ).
fof(f58,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ~ sP2(X0) )
& ( sP2(X0)
| ~ cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f46]) ).
fof(f74,plain,
! [X0,X6,X5] :
( ~ rtt(X0,X6)
| ~ rtt(X0,X5)
| X5 = X6
| ~ sP2(X0) ),
inference(cnf_transformation,[],[f51]) ).
fof(f76,plain,
! [X0] :
( ~ sP2(X0)
| sP1(X0) ),
inference(cnf_transformation,[],[f51]) ).
fof(f83,plain,
! [X0] :
( sK7(X0) != sK8(X0)
| ~ sP1(X0) ),
inference(cnf_transformation,[],[f54]) ).
fof(f86,plain,
! [X0] :
( rtt(X0,sK8(X0))
| ~ sP1(X0) ),
inference(cnf_transformation,[],[f54]) ).
fof(f87,plain,
! [X0] :
( rtt(X0,sK7(X0))
| ~ sP1(X0) ),
inference(cnf_transformation,[],[f54]) ).
fof(f94,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| sP2(X0) ),
inference(cnf_transformation,[],[f58]) ).
fof(f98,plain,
cUnsatisfiable(i2003_11_14_17_20_29215),
inference(cnf_transformation,[],[f16]) ).
fof(f110,plain,
sP2(i2003_11_14_17_20_29215),
inference(resolution,[],[f94,f98]) ).
fof(f127,plain,
! [X0,X1] :
( ~ rtt(X0,X1)
| sK8(X0) = X1
| ~ sP2(X0)
| ~ sP1(X0) ),
inference(resolution,[],[f74,f86]) ).
fof(f130,plain,
! [X0,X1] :
( ~ rtt(X0,X1)
| sK8(X0) = X1
| ~ sP2(X0) ),
inference(forward_subsumption_resolution,[],[f127,f76]) ).
fof(f152,plain,
! [X0] :
( sK7(X0) = sK8(X0)
| ~ sP2(X0)
| ~ sP1(X0) ),
inference(resolution,[],[f130,f87]) ).
fof(f156,plain,
! [X0] :
( ~ sP2(X0)
| ~ sP1(X0) ),
inference(forward_subsumption_resolution,[],[f152,f83]) ).
fof(f158,plain,
! [X0] : ~ sP2(X0),
inference(forward_subsumption_resolution,[],[f156,f76]) ).
fof(f165,plain,
$false,
inference(resolution,[],[f158,f110]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS099+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.38 % Computer : n011.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 13:22:45 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/0.42 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.17/0.46 % (2409073)Will run a generic schedule for satisfiability detection.
% 0.17/0.46 % (2409078)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2361925734_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.46 % TRYING [1]
% 0.17/0.46 % TRYING [2]
% 0.17/0.46 % TRYING [3]
% 0.17/0.46 % TRYING [4]
% 0.17/0.46 % TRYING [5]
% 0.17/0.46 % TRYING [6]
% 0.17/0.46 % TRYING [7]
% 0.17/0.46 % (2409079)% WARNING: option uhcvi not known.
% 0.17/0.46 % TRYING [8]
% 0.17/0.46 % TRYING [9]
% 0.17/0.46 % TRYING [10]
% 0.17/0.46 % TRYING [11]
% 0.17/0.46 % (2409079)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1163306277:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.46 % (2409080)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2701054829:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.46 % TRYING [12]
% 0.17/0.46 % (2409081)dis+10_1_sil=32000:sp=arity:random_seed=2517570014:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.46 % (2409082)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1995563371:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.46 % (2409083)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1005834557:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.46 % (2409084)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3443322789:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.46 % TRYING [13]
% 0.17/0.46 % (2409081) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2409073-2409081"...
% 0.17/0.46 % TRYING [14]
% 0.17/0.46 % (2409079) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2409073-2409079"...
% 0.17/0.46 % (2409084) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2409073-2409084"...
% 0.17/0.46 % (2409082) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2409073-2409082"...
% 0.17/0.46 % (2409081)...printing done.
% 0.17/0.46 % (2409083) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2409073-2409083"...
% 0.17/0.46 % (2409079)...printing done.
% 0.17/0.46 % (2409084)...printing done.
% 0.17/0.46 % TRYING [15]
% 0.17/0.46 % (2409082)...printing done.
% 0.17/0.46 % (2409081)Refutation found. Thanks to Tanya!
% 0.17/0.46 % SZS status Unsatisfiable for theBenchmark
% 0.17/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.46 % (2409081)------------------------------
% 0.17/0.46 % (2409081)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.46 % (2409081)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.46 % (2409081)CaDiCaL version: 2.1.3
% 0.17/0.46 % (2409081)Termination reason: Refutation
% 0.17/0.46 % (2409081)Time elapsed: 0.003 s
% 0.17/0.46 % (2409081)Peak memory usage: 11 MB
% 0.17/0.46 % (2409081)Instructions burned: 4 (million)
% 0.17/0.46 % (2409073)Success in time 0.038 s
% 0.17/0.46 % Vampire exiting
%------------------------------------------------------------------------------