%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KRS085+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 : n006.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:14 AM UTC 2026
% Result : Unsatisfiable 0.11s 0.44s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 4
% Syntax : Number of formulae : 27 ( 4 unt; 0 def)
% Number of atoms : 118 ( 0 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 149 ( 58 ~; 52 |; 34 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 64 ( 51 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( rr(X0,X1)
& ? [X2] :
( rr(X1,X2)
& cp1(X2)
& ! [X3] :
( rinvR(X2,X3)
=> ~ cp1(X3) ) ) )
& cp1(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f20,axiom,
! [X0,X1] :
( rinvR(X0,X1)
<=> rr(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(f21,axiom,
! [X0,X1,X2] :
( ( rr(X0,X1)
& rr(X1,X2) )
=> rr(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(f22,axiom,
cUnsatisfiable(i2003_11_14_17_19_39537),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(f51,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( rr(X0,X1)
& ? [X2] :
( rr(X1,X2)
& cp1(X2)
& ! [X3] :
( ~ cp1(X3)
| ~ rinvR(X2,X3) ) ) )
& cp1(X0) ) ),
inference(ennf_transformation,[],[f17]) ).
fof(f54,plain,
! [X0,X1,X2] :
( rr(X0,X2)
| ~ rr(X0,X1)
| ~ rr(X1,X2) ),
inference(ennf_transformation,[],[f21]) ).
fof(f55,plain,
! [X0,X1,X2] :
( rr(X0,X2)
| ~ rr(X0,X1)
| ~ rr(X1,X2) ),
inference(flattening,[],[f54]) ).
fof(f57,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ rr(X0,X1)
| ! [X2] :
( ~ rr(X1,X2)
| ~ cp1(X2)
| ? [X3] :
( cp1(X3)
& rinvR(X2,X3) ) ) )
| ~ cp1(X0) )
& ( ( ? [X1] :
( rr(X0,X1)
& ? [X2] :
( rr(X1,X2)
& cp1(X2)
& ! [X3] :
( ~ cp1(X3)
| ~ rinvR(X2,X3) ) ) )
& cp1(X0) )
| ~ cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f51]) ).
fof(f58,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ rr(X0,X1)
| ! [X2] :
( ~ rr(X1,X2)
| ~ cp1(X2)
| ? [X3] :
( cp1(X3)
& rinvR(X2,X3) ) ) )
| ~ cp1(X0) )
& ( ( ? [X1] :
( rr(X0,X1)
& ? [X2] :
( rr(X1,X2)
& cp1(X2)
& ! [X3] :
( ~ cp1(X3)
| ~ rinvR(X2,X3) ) ) )
& cp1(X0) )
| ~ cUnsatisfiable(X0) ) ),
inference(flattening,[],[f57]) ).
fof(f59,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ rr(X0,X1)
| ! [X2] :
( ~ rr(X1,X2)
| ~ cp1(X2)
| ? [X3] :
( cp1(X3)
& rinvR(X2,X3) ) ) )
| ~ cp1(X0) )
& ( ( ? [X4] :
( rr(X0,X4)
& ? [X5] :
( rr(X4,X5)
& cp1(X5)
& ! [X6] :
( ~ cp1(X6)
| ~ rinvR(X5,X6) ) ) )
& cp1(X0) )
| ~ cUnsatisfiable(X0) ) ),
inference(rectify,[],[f58]) ).
fof(f60,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ rr(X0,X1)
| ! [X2] :
( ~ rr(X1,X2)
| ~ cp1(X2)
| ( cp1(sK0(X2))
& rinvR(X2,sK0(X2)) ) ) )
| ~ cp1(X0) )
& ( ( rr(X0,sK1(X0))
& rr(sK1(X0),sK2(X0))
& cp1(sK2(X0))
& ! [X6] :
( ~ cp1(X6)
| ~ rinvR(sK2(X0),X6) )
& cp1(X0) )
| ~ cUnsatisfiable(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X3,sK0(X2)),skolemize(X4,sK1(X0)),skolemize(X5,sK2(X0))],[f59]) ).
fof(f62,plain,
! [X0,X1] :
( ( rinvR(X0,X1)
| ~ rr(X1,X0) )
& ( rr(X1,X0)
| ~ rinvR(X0,X1) ) ),
inference(nnf_transformation,[],[f20]) ).
fof(f81,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| cp1(X0) ),
inference(cnf_transformation,[],[f60]) ).
fof(f82,plain,
! [X0,X6] :
( ~ rinvR(sK2(X0),X6)
| ~ cp1(X6)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f60]) ).
fof(f84,plain,
! [X0] :
( rr(sK1(X0),sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f60]) ).
fof(f85,plain,
! [X0] :
( rr(X0,sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f60]) ).
fof(f92,plain,
! [X0,X1] :
( ~ rr(X1,X0)
| rinvR(X0,X1) ),
inference(cnf_transformation,[],[f62]) ).
fof(f93,plain,
! [X2,X0,X1] :
( ~ rr(X1,X2)
| ~ rr(X0,X1)
| rr(X0,X2) ),
inference(cnf_transformation,[],[f55]) ).
fof(f94,plain,
cUnsatisfiable(i2003_11_14_17_19_39537),
inference(cnf_transformation,[],[f22]) ).
fof(f118,plain,
! [X0,X1] :
( ~ rr(X0,sK1(X1))
| rr(X0,sK2(X1))
| ~ cUnsatisfiable(X1) ),
inference(resolution,[],[f93,f84]) ).
fof(f131,plain,
! [X0] :
( rr(X0,sK2(X0))
| ~ cUnsatisfiable(X0)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f118,f85]) ).
fof(f134,plain,
! [X0] :
( rr(X0,sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(duplicate_literal_removal,[],[f131]) ).
fof(f138,plain,
! [X0] :
( rinvR(sK2(X0),X0)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f134,f92]) ).
fof(f145,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| ~ cp1(X0)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f138,f82]) ).
fof(f147,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| ~ cp1(X0) ),
inference(duplicate_literal_removal,[],[f145]) ).
fof(f148,plain,
! [X0] : ~ cUnsatisfiable(X0),
inference(forward_subsumption_resolution,[],[f147,f81]) ).
fof(f153,plain,
$false,
inference(resolution,[],[f148,f94]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS085+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n006.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 13:21:55 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 Running first-order model finding
% 0.11/0.40 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.11/0.44 % (2975387)Will run a generic schedule for satisfiability detection.
% 0.11/0.44 % (2975398)dis+10_1_sil=32000:sp=arity:random_seed=1944308503:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.44 % (2975398) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2975387-2975398"...
% 0.11/0.44 % (2975398)...printing done.
% 0.11/0.44 % (2975398)Refutation found. Thanks to Tanya!
% 0.11/0.44 % SZS status Unsatisfiable for theBenchmark
% 0.11/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.44 % (2975398)------------------------------
% 0.11/0.44 % (2975398)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.44 % (2975398)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.44 % (2975398)CaDiCaL version: 2.1.3
% 0.11/0.44 % (2975398)Termination reason: Refutation
% 0.11/0.44 % (2975398)Time elapsed: 0.002 s
% 0.11/0.44 % (2975398)Peak memory usage: 11 MB
% 0.11/0.44 % (2975398)Instructions burned: 3 (million)
% 0.11/0.44 % (2975387)Success in time 0.025 s
% 0.11/0.44 % Vampire exiting
%------------------------------------------------------------------------------