%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KRS069+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 : 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:12 AM UTC 2026
% Result : Unsatisfiable 0.15s 0.52s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 38 ( 7 unt; 0 def)
% Number of atoms : 93 ( 18 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 97 ( 42 ~; 37 |; 12 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 61 ( 55 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f16,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( rf1(X0,X1)
& cp1(X1) )
& ? [X1] :
( rf2(X0,X1)
& ~ cp1(X1) )
& ? [X1] :
( rf3(X0,X1)
& cp2(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f17,axiom,
! [X0,X1,X2] :
( ( rf1(X0,X1)
& rf1(X0,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(f18,axiom,
! [X0,X1,X2] :
( ( rf2(X0,X1)
& rf2(X0,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(f20,axiom,
cUnsatisfiable(i2003_11_14_17_18_2750),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(f21,axiom,
! [X0,X1] :
( rf3(X0,X1)
=> rf1(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(f22,axiom,
! [X0,X1] :
( rf3(X0,X1)
=> rf2(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
fof(f23,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( rf1(X0,X1)
& cp1(X1) )
& ? [X2] :
( rf2(X0,X2)
& ~ cp1(X2) )
& ? [X3] :
( rf3(X0,X3)
& cp2(X3) ) ) ),
inference(rectify,[],[f16]) ).
fof(f50,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf1(X0,X1)
| ~ rf1(X0,X2) ),
inference(ennf_transformation,[],[f17]) ).
fof(f51,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf1(X0,X1)
| ~ rf1(X0,X2) ),
inference(flattening,[],[f50]) ).
fof(f52,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf2(X0,X1)
| ~ rf2(X0,X2) ),
inference(ennf_transformation,[],[f18]) ).
fof(f53,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf2(X0,X1)
| ~ rf2(X0,X2) ),
inference(flattening,[],[f52]) ).
fof(f56,plain,
! [X0,X1] :
( rf1(X0,X1)
| ~ rf3(X0,X1) ),
inference(ennf_transformation,[],[f21]) ).
fof(f57,plain,
! [X0,X1] :
( rf2(X0,X1)
| ~ rf3(X0,X1) ),
inference(ennf_transformation,[],[f22]) ).
fof(f75,plain,
! [X0] :
( cp1(sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f76,plain,
! [X0] :
( rf1(X0,sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f78,plain,
! [X0] :
( ~ cp1(sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f79,plain,
! [X0] :
( rf2(X0,sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f81,plain,
! [X0] :
( rf3(X0,sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f82,plain,
! [X2,X0,X1] :
( ~ rf1(X0,X2)
| ~ rf1(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f51]) ).
fof(f83,plain,
! [X2,X0,X1] :
( ~ rf2(X0,X2)
| ~ rf2(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f53]) ).
fof(f85,plain,
cUnsatisfiable(i2003_11_14_17_18_2750),
inference(cnf_transformation,[],[f20]) ).
fof(f86,plain,
! [X0,X1] :
( rf1(X0,X1)
| ~ rf3(X0,X1) ),
inference(cnf_transformation,[],[f56]) ).
fof(f87,plain,
! [X0,X1] :
( rf2(X0,X1)
| ~ rf3(X0,X1) ),
inference(cnf_transformation,[],[f57]) ).
fof(f104,plain,
! [X0,X1] :
( ~ rf1(X0,X1)
| sK2(X0) = X1
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f82,f76]) ).
fof(f108,plain,
! [X0,X1] :
( ~ rf2(X0,X1)
| sK1(X0) = X1
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f83,f79]) ).
fof(f113,plain,
! [X0,X1] :
( ~ rf3(X0,X1)
| ~ cUnsatisfiable(X0)
| sK2(X0) = X1 ),
inference(resolution,[],[f104,f86]) ).
fof(f119,plain,
! [X0,X1] :
( ~ rf3(X0,X1)
| ~ cUnsatisfiable(X0)
| sK1(X0) = X1 ),
inference(resolution,[],[f108,f87]) ).
fof(f125,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| sK0(X0) = sK2(X0)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f113,f81]) ).
fof(f126,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| sK0(X0) = sK2(X0) ),
inference(duplicate_literal_removal,[],[f125]) ).
fof(f131,plain,
sK0(i2003_11_14_17_18_2750) = sK2(i2003_11_14_17_18_2750),
inference(resolution,[],[f126,f85]) ).
fof(f132,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| sK0(X0) = sK1(X0)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f119,f81]) ).
fof(f133,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| sK0(X0) = sK1(X0) ),
inference(duplicate_literal_removal,[],[f132]) ).
fof(f135,plain,
( cp1(sK0(i2003_11_14_17_18_2750))
| ~ cUnsatisfiable(i2003_11_14_17_18_2750) ),
inference(superposition,[],[f75,f131]) ).
fof(f136,plain,
cp1(sK0(i2003_11_14_17_18_2750)),
inference(forward_subsumption_resolution,[],[f135,f85]) ).
fof(f158,plain,
sK0(i2003_11_14_17_18_2750) = sK1(i2003_11_14_17_18_2750),
inference(resolution,[],[f133,f85]) ).
fof(f164,plain,
( ~ cp1(sK0(i2003_11_14_17_18_2750))
| ~ cUnsatisfiable(i2003_11_14_17_18_2750) ),
inference(superposition,[],[f78,f158]) ).
fof(f165,plain,
~ cUnsatisfiable(i2003_11_14_17_18_2750),
inference(forward_subsumption_resolution,[],[f164,f136]) ).
fof(f168,plain,
$false,
inference(forward_subsumption_resolution,[],[f165,f85]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KRS069+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.10/0.44 % Computer : n011.cluster.edu
% 0.10/0.44 % Model : x86_64 x86_64
% 0.10/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.44 % Memory : 8046.5625MB
% 0.10/0.44 % OS : Linux 6.8.0-71-generic
% 0.10/0.45 % CPULimit : 300
% 0.10/0.45 % WCLimit : 300
% 0.10/0.45 % DateTime : Sun Sep 27 13:19:45 UTC 2026
% 0.10/0.45 % CPUTime :
% 0.10/0.45 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.15/0.48 Running first-order model finding
% 0.15/0.48 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.15/0.52 % (2407026)Will run a generic schedule for satisfiability detection.
% 0.15/0.52 % (2407035)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4180137479:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.52 % (2407035) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2407026-2407035"...
% 0.15/0.52 % (2407032)% WARNING: option uhcvi not known.
% 0.15/0.52 % (2407035)...printing done.
% 0.15/0.52 % (2407035)Refutation found. Thanks to Tanya!
% 0.15/0.52 % SZS status Unsatisfiable for theBenchmark
% 0.15/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.52 % (2407035)------------------------------
% 0.15/0.52 % (2407035)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.52 % (2407035)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.52 % (2407035)CaDiCaL version: 2.1.3
% 0.15/0.52 % (2407035)Termination reason: Refutation
% 0.15/0.52 % (2407035)Time elapsed: 0.003 s
% 0.15/0.52 % (2407035)Peak memory usage: 12 MB
% 0.15/0.52 % (2407035)Instructions burned: 7 (million)
% 0.15/0.52 % (2407026)Success in time 0.027 s
% 0.15/0.52 % Vampire exiting
%------------------------------------------------------------------------------