%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KRS077+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 : n005.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.12s 0.47s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 4
% Syntax : Number of formulae : 35 ( 6 unt; 0 def)
% Number of atoms : 108 ( 12 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 104 ( 31 ~; 41 |; 22 &)
% ( 5 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 63 ( 55 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1,X2] :
( ( rr(X0,X1)
& rr(X0,X2) )
=> X1 = X2 )
& ? [X3] :
( rr(X0,X3)
& ! [X4] :
( rinvS(X3,X4)
=> cp(X4) ) )
& ~ cp(X0)
& ? [X3] :
( rs(X0,X3)
& cp(X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f16,axiom,
! [X0,X1] :
( rinvS(X0,X1)
<=> rs(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(f17,axiom,
cUnsatisfiable(i2003_11_14_17_19_09372),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(f18,axiom,
! [X0,X1] :
( rs(X0,X1)
=> rr(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(f19,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1,X2] :
( ( rr(X0,X1)
& rr(X0,X2) )
=> X1 = X2 )
& ? [X3] :
( rr(X0,X3)
& ! [X4] :
( rinvS(X3,X4)
=> cp(X4) ) )
& ~ cp(X0)
& ? [X5] :
( rs(X0,X5)
& cp(X5) ) ) ),
inference(rectify,[],[f15]) ).
fof(f44,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1,X2] :
( X1 = X2
| ~ rr(X0,X1)
| ~ rr(X0,X2) )
& ? [X3] :
( rr(X0,X3)
& ! [X4] :
( cp(X4)
| ~ rinvS(X3,X4) ) )
& ~ cp(X0)
& ? [X5] :
( rs(X0,X5)
& cp(X5) ) ) ),
inference(ennf_transformation,[],[f19]) ).
fof(f45,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1,X2] :
( X1 = X2
| ~ rr(X0,X1)
| ~ rr(X0,X2) )
& ? [X3] :
( rr(X0,X3)
& ! [X4] :
( cp(X4)
| ~ rinvS(X3,X4) ) )
& ~ cp(X0)
& ? [X5] :
( rs(X0,X5)
& cp(X5) ) ) ),
inference(flattening,[],[f44]) ).
fof(f46,plain,
! [X0,X1] :
( rr(X0,X1)
| ~ rs(X0,X1) ),
inference(ennf_transformation,[],[f18]) ).
fof(f63,plain,
! [X0,X4] :
( ~ rinvS(sK1(X0),X4)
| cp(X4)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f45]) ).
fof(f70,plain,
! [X2,X0,X1] :
( ~ rr(X0,X2)
| ~ rr(X0,X1)
| X1 = X2
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f45]) ).
fof(f71,plain,
! [X0] :
( rr(X0,sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f45]) ).
fof(f73,plain,
! [X0] :
( rs(X0,sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f45]) ).
fof(f74,plain,
! [X0] :
( ~ cp(X0)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f45]) ).
fof(f75,plain,
! [X0,X1] :
( ~ rs(X1,X0)
| rinvS(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f77,plain,
cUnsatisfiable(i2003_11_14_17_19_09372),
inference(cnf_transformation,[],[f17]) ).
fof(f78,plain,
! [X0,X1] :
( ~ rs(X0,X1)
| rr(X0,X1) ),
inference(cnf_transformation,[],[f46]) ).
fof(f100,plain,
! [X0] :
( ~ cp(X0)
| cUnsatisfiable(X0) ),
inference(consistent_polarity_flipping,[],[f74]) ).
fof(f101,plain,
! [X0] :
( rs(X0,sK0(X0))
| cUnsatisfiable(X0) ),
inference(consistent_polarity_flipping,[],[f73]) ).
fof(f103,plain,
! [X0] :
( ~ rr(X0,sK1(X0))
| cUnsatisfiable(X0) ),
inference(consistent_polarity_flipping,[],[f71]) ).
fof(f104,plain,
! [X2,X0,X1] :
( rr(X0,X2)
| rr(X0,X1)
| X1 = X2
| cUnsatisfiable(X0) ),
inference(consistent_polarity_flipping,[],[f70]) ).
fof(f111,plain,
! [X0,X4] :
( ~ rinvS(sK1(X0),X4)
| cp(X4)
| cUnsatisfiable(X0) ),
inference(consistent_polarity_flipping,[],[f63]) ).
fof(f112,plain,
~ cUnsatisfiable(i2003_11_14_17_19_09372),
inference(consistent_polarity_flipping,[],[f77]) ).
fof(f113,plain,
! [X0,X1] :
( ~ rr(X0,X1)
| ~ rs(X0,X1) ),
inference(consistent_polarity_flipping,[],[f78]) ).
fof(f116,plain,
! [X0] :
( rinvS(sK0(X0),X0)
| cUnsatisfiable(X0) ),
inference(resolution,[],[f101,f75]) ).
fof(f120,plain,
! [X0,X1] :
( rr(X0,X1)
| sK1(X0) = X1
| cUnsatisfiable(X0)
| cUnsatisfiable(X0) ),
inference(resolution,[],[f104,f103]) ).
fof(f123,plain,
! [X0,X1] :
( rr(X0,X1)
| sK1(X0) = X1
| cUnsatisfiable(X0) ),
inference(duplicate_literal_removal,[],[f120]) ).
fof(f126,plain,
! [X0,X1] :
( ~ rs(X0,X1)
| cUnsatisfiable(X0)
| sK1(X0) = X1 ),
inference(resolution,[],[f123,f113]) ).
fof(f130,plain,
! [X0] :
( cUnsatisfiable(X0)
| sK0(X0) = sK1(X0)
| cUnsatisfiable(X0) ),
inference(resolution,[],[f126,f101]) ).
fof(f131,plain,
! [X0] :
( cUnsatisfiable(X0)
| sK0(X0) = sK1(X0) ),
inference(duplicate_literal_removal,[],[f130]) ).
fof(f134,plain,
sK0(i2003_11_14_17_19_09372) = sK1(i2003_11_14_17_19_09372),
inference(resolution,[],[f131,f112]) ).
fof(f144,plain,
! [X0] :
( ~ rinvS(sK0(i2003_11_14_17_19_09372),X0)
| cp(X0)
| cUnsatisfiable(i2003_11_14_17_19_09372) ),
inference(superposition,[],[f111,f134]) ).
fof(f147,plain,
! [X0] :
( ~ rinvS(sK0(i2003_11_14_17_19_09372),X0)
| cp(X0) ),
inference(forward_subsumption_resolution,[],[f144,f112]) ).
fof(f152,plain,
( cp(i2003_11_14_17_19_09372)
| cUnsatisfiable(i2003_11_14_17_19_09372) ),
inference(resolution,[],[f147,f116]) ).
fof(f153,plain,
cUnsatisfiable(i2003_11_14_17_19_09372),
inference(forward_subsumption_resolution,[],[f152,f100]) ).
fof(f154,plain,
$false,
inference(forward_subsumption_resolution,[],[f153,f112]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS077+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.37 % Computer : n005.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % 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:21:47 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.43 Running first-order model finding
% 0.12/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.12/0.47 % (3986906)Will run a generic schedule for satisfiability detection.
% 0.12/0.47 % (3986912)% WARNING: option uhcvi not known.
% 0.12/0.47 % (3986912)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3428667473:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.12/0.47 % (3986912) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3986906-3986912"...
% 0.12/0.47 % (3986912)...printing done.
% 0.12/0.47 % (3986912)Refutation found. Thanks to Tanya!
% 0.12/0.47 % SZS status Unsatisfiable for theBenchmark
% 0.12/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.47 % (3986912)------------------------------
% 0.12/0.47 % (3986912)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.47 % (3986912)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.47 % (3986912)CaDiCaL version: 2.1.3
% 0.12/0.47 % (3986912)Termination reason: Refutation
% 0.12/0.47 % (3986912)Time elapsed: 0.003 s
% 0.12/0.47 % (3986912)Peak memory usage: 12 MB
% 0.12/0.47 % (3986912)Instructions burned: 4 (million)
% 0.12/0.47 % (3986906)Success in time 0.027 s
% 0.12/0.47 % Vampire exiting
%------------------------------------------------------------------------------