%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KRS070+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n001.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:12 AM UTC 2026
% Result : Unsatisfiable 0.16s 0.47s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 5
% Syntax : Number of formulae : 36 ( 5 unt; 0 def)
% Number of atoms : 152 ( 8 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 190 ( 74 ~; 65 |; 45 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 76 ( 59 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f30,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( rrx4(X0,X1)
& cc2(X1) )
& ~ ? [X1] :
( rrx3(X0,X1)
& cc2(X1)
& cc1(X1) )
& ? [X1] :
( rrx3(X0,X1)
& cc1(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f31,axiom,
! [X0,X1,X2] :
( ( rrx(X0,X1)
& rrx(X0,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(f36,axiom,
cUnsatisfiable(i2003_11_14_17_18_32242),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
fof(f37,axiom,
! [X0,X1] :
( rrx3(X0,X1)
=> rrx(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_9) ).
fof(f44,axiom,
! [X0,X1] :
( rrx4(X0,X1)
=> rrx(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_16) ).
fof(f45,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( rrx4(X0,X1)
& cc2(X1) )
& ~ ? [X2] :
( rrx3(X0,X2)
& cc2(X2)
& cc1(X2) )
& ? [X3] :
( rrx3(X0,X3)
& cc1(X3) ) ) ),
inference(rectify,[],[f30]) ).
fof(f100,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( rrx4(X0,X1)
& cc2(X1) )
& ! [X2] :
( ~ rrx3(X0,X2)
| ~ cc2(X2)
| ~ cc1(X2) )
& ? [X3] :
( rrx3(X0,X3)
& cc1(X3) ) ) ),
inference(ennf_transformation,[],[f45]) ).
fof(f101,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rrx(X0,X1)
| ~ rrx(X0,X2) ),
inference(ennf_transformation,[],[f31]) ).
fof(f102,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rrx(X0,X1)
| ~ rrx(X0,X2) ),
inference(flattening,[],[f101]) ).
fof(f111,plain,
! [X0,X1] :
( rrx(X0,X1)
| ~ rrx3(X0,X1) ),
inference(ennf_transformation,[],[f37]) ).
fof(f118,plain,
! [X0,X1] :
( rrx(X0,X1)
| ~ rrx4(X0,X1) ),
inference(ennf_transformation,[],[f44]) ).
fof(f120,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ rrx4(X0,X1)
| ~ cc2(X1) )
| ? [X2] :
( rrx3(X0,X2)
& cc2(X2)
& cc1(X2) )
| ! [X3] :
( ~ rrx3(X0,X3)
| ~ cc1(X3) ) )
& ( ( ? [X1] :
( rrx4(X0,X1)
& cc2(X1) )
& ! [X2] :
( ~ rrx3(X0,X2)
| ~ cc2(X2)
| ~ cc1(X2) )
& ? [X3] :
( rrx3(X0,X3)
& cc1(X3) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f100]) ).
fof(f121,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ rrx4(X0,X1)
| ~ cc2(X1) )
| ? [X2] :
( rrx3(X0,X2)
& cc2(X2)
& cc1(X2) )
| ! [X3] :
( ~ rrx3(X0,X3)
| ~ cc1(X3) ) )
& ( ( ? [X1] :
( rrx4(X0,X1)
& cc2(X1) )
& ! [X2] :
( ~ rrx3(X0,X2)
| ~ cc2(X2)
| ~ cc1(X2) )
& ? [X3] :
( rrx3(X0,X3)
& cc1(X3) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(flattening,[],[f120]) ).
fof(f122,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ rrx4(X0,X1)
| ~ cc2(X1) )
| ? [X2] :
( rrx3(X0,X2)
& cc2(X2)
& cc1(X2) )
| ! [X3] :
( ~ rrx3(X0,X3)
| ~ cc1(X3) ) )
& ( ( ? [X4] :
( rrx4(X0,X4)
& cc2(X4) )
& ! [X5] :
( ~ rrx3(X0,X5)
| ~ cc2(X5)
| ~ cc1(X5) )
& ? [X6] :
( rrx3(X0,X6)
& cc1(X6) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(rectify,[],[f121]) ).
fof(f123,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ rrx4(X0,X1)
| ~ cc2(X1) )
| ( rrx3(X0,sK0(X0))
& cc2(sK0(X0))
& cc1(sK0(X0)) )
| ! [X3] :
( ~ rrx3(X0,X3)
| ~ cc1(X3) ) )
& ( ( rrx4(X0,sK1(X0))
& cc2(sK1(X0))
& ! [X5] :
( ~ rrx3(X0,X5)
| ~ cc2(X5)
| ~ cc1(X5) )
& rrx3(X0,sK2(X0))
& cc1(sK2(X0)) )
| ~ cUnsatisfiable(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X2,sK0(X0)),skolemize(X4,sK1(X0)),skolemize(X6,sK2(X0))],[f122]) ).
fof(f155,plain,
! [X0] :
( cc1(sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f123]) ).
fof(f156,plain,
! [X0] :
( rrx3(X0,sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f123]) ).
fof(f157,plain,
! [X0,X5] :
( ~ rrx3(X0,X5)
| ~ cc2(X5)
| ~ cc1(X5)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f123]) ).
fof(f158,plain,
! [X0] :
( cc2(sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f123]) ).
fof(f159,plain,
! [X0] :
( rrx4(X0,sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f123]) ).
fof(f163,plain,
! [X2,X0,X1] :
( ~ rrx(X0,X2)
| ~ rrx(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f102]) ).
fof(f168,plain,
cUnsatisfiable(i2003_11_14_17_18_32242),
inference(cnf_transformation,[],[f36]) ).
fof(f169,plain,
! [X0,X1] :
( ~ rrx3(X0,X1)
| rrx(X0,X1) ),
inference(cnf_transformation,[],[f111]) ).
fof(f176,plain,
! [X0,X1] :
( ~ rrx4(X0,X1)
| rrx(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f205,plain,
! [X0] :
( rrx(X0,sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f169,f156]) ).
fof(f208,plain,
! [X0] :
( rrx(X0,sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f176,f159]) ).
fof(f209,plain,
! [X0] :
( ~ cc2(sK2(X0))
| ~ cc1(sK2(X0))
| ~ cUnsatisfiable(X0)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f157,f156]) ).
fof(f210,plain,
! [X0] :
( ~ cc2(sK2(X0))
| ~ cc1(sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(duplicate_literal_removal,[],[f209]) ).
fof(f211,plain,
! [X0] :
( ~ cc2(sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(forward_subsumption_resolution,[],[f210,f155]) ).
fof(f212,plain,
! [X0,X1] :
( ~ rrx(X0,X1)
| ~ cUnsatisfiable(X0)
| sK2(X0) = X1 ),
inference(resolution,[],[f205,f163]) ).
fof(f223,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| sK1(X0) = sK2(X0)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f212,f208]) ).
fof(f224,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| sK1(X0) = sK2(X0) ),
inference(duplicate_literal_removal,[],[f223]) ).
fof(f227,plain,
sK1(i2003_11_14_17_18_32242) = sK2(i2003_11_14_17_18_32242),
inference(resolution,[],[f224,f168]) ).
fof(f234,plain,
( ~ cc2(sK1(i2003_11_14_17_18_32242))
| ~ cUnsatisfiable(i2003_11_14_17_18_32242) ),
inference(superposition,[],[f211,f227]) ).
fof(f239,plain,
~ cUnsatisfiable(i2003_11_14_17_18_32242),
inference(forward_subsumption_resolution,[],[f234,f158]) ).
fof(f241,plain,
$false,
inference(forward_subsumption_resolution,[],[f239,f168]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS070+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n001.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:25:31 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/0.42 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.47 % (3571311)Will run a generic schedule for satisfiability detection.
% 0.16/0.47 % (3571316)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4287094597_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.47 % TRYING [1]
% 0.16/0.47 % TRYING [2]
% 0.16/0.47 % TRYING [3]
% 0.16/0.47 % TRYING [4]
% 0.16/0.47 % TRYING [5]
% 0.16/0.47 % TRYING [6]
% 0.16/0.47 % TRYING [7]
% 0.16/0.47 % TRYING [8]
% 0.16/0.47 % TRYING [9]
% 0.16/0.47 % (3571317)% WARNING: option uhcvi not known.
% 0.16/0.47 % TRYING [10]
% 0.16/0.47 % TRYING [11]
% 0.16/0.47 % TRYING [12]
% 0.16/0.47 % TRYING [13]
% 0.16/0.47 % TRYING [14]
% 0.16/0.47 % TRYING [15]
% 0.16/0.47 % (3571318)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3852211307:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.47 % (3571320)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=265954070:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.47 % (3571317)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4097152530:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.47 % (3571319)dis+10_1_sil=32000:sp=arity:random_seed=589171876:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.47 % (3571321)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2012209791:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.47 % TRYING [16]
% 0.16/0.47 % (3571322)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4189377887:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.47 % TRYING [17]
% 0.16/0.47 % TRYING [18]
% 0.16/0.47 % (3571319) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3571311-3571319"...
% 0.16/0.47 % TRYING [19]
% 0.16/0.47 % (3571322) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3571311-3571322"...
% 0.16/0.47 % (3571321) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3571311-3571321"...
% 0.16/0.47 % (3571319)...printing done.
% 0.16/0.47 % (3571317) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3571311-3571317"...
% 0.16/0.47 % TRYING [20]
% 0.16/0.47 % (3571319)Refutation found. Thanks to Tanya!
% 0.16/0.47 % SZS status Unsatisfiable for theBenchmark
% 0.16/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.47 % (3571319)------------------------------
% 0.16/0.47 % (3571319)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.47 % (3571319)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.47 % (3571319)CaDiCaL version: 2.1.3
% 0.16/0.47 % (3571319)Termination reason: Refutation
% 0.16/0.47 % (3571319)Time elapsed: 0.003 s
% 0.16/0.47 % (3571319)Peak memory usage: 11 MB
% 0.16/0.47 % (3571319)Instructions burned: 4 (million)
% 0.16/0.47 % (3571311)Success in time 0.042 s
% 0.16/0.47 % Vampire exiting
%------------------------------------------------------------------------------