%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KRS092+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 : n007.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:15 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.44s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 4 unt; 0 def)
% Number of atoms : 61 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 60 ( 19 ~; 17 |; 15 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 31 ( 26 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( rr(X0,X1)
& cowlThing(X1) )
& ! [X1] :
( rr(X0,X1)
=> ( cd(X1)
& cc(X1) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f4,axiom,
! [X0] :
( cc(X0)
=> ~ cd(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(f9,axiom,
cUnsatisfiable(i2003_11_14_17_20_04172),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).
fof(f10,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( rr(X0,X1)
& cowlThing(X1) )
& ! [X2] :
( rr(X0,X2)
=> ( cd(X2)
& cc(X2) ) ) ) ),
inference(rectify,[],[f3]) ).
fof(f11,plain,
! [X0] :
( cUnsatisfiable(X0)
=> ( ? [X1] :
( rr(X0,X1)
& cowlThing(X1) )
& ! [X2] :
( rr(X0,X2)
=> ( cd(X2)
& cc(X2) ) ) ) ),
inference(unused_predicate_definition_removal,[],[f10]) ).
fof(f13,plain,
! [X0] :
( cUnsatisfiable(X0)
=> ( ? [X1] : rr(X0,X1)
& ! [X2] :
( rr(X0,X2)
=> ( cd(X2)
& cc(X2) ) ) ) ),
inference(pure_predicate_removal,[],[f11]) ).
fof(f19,plain,
! [X0] :
( ( ? [X1] : rr(X0,X1)
& ! [X2] :
( ( cd(X2)
& cc(X2) )
| ~ rr(X0,X2) ) )
| ~ cUnsatisfiable(X0) ),
inference(ennf_transformation,[],[f13]) ).
fof(f20,plain,
! [X0] :
( ~ cd(X0)
| ~ cc(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f21,plain,
! [X0] :
( ( rr(X0,sK0(X0))
& ! [X2] :
( ( cd(X2)
& cc(X2) )
| ~ rr(X0,X2) ) )
| ~ cUnsatisfiable(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0(X0))],[f19]) ).
fof(f22,plain,
! [X2,X0] :
( cc(X2)
| ~ rr(X0,X2)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f23,plain,
! [X2,X0] :
( cd(X2)
| ~ rr(X0,X2)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f24,plain,
! [X0] :
( rr(X0,sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f25,plain,
! [X0] :
( ~ cd(X0)
| ~ cc(X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f26,plain,
cUnsatisfiable(i2003_11_14_17_20_04172),
inference(cnf_transformation,[],[f9]) ).
fof(f27,plain,
! [X0] :
( rr(X0,sK0(X0))
| cUnsatisfiable(X0) ),
inference(consistent_polarity_flipping,[],[f24]) ).
fof(f28,plain,
! [X0,X1] :
( ~ cd(X0)
| ~ rr(X1,X0)
| cUnsatisfiable(X1) ),
inference(consistent_polarity_flipping,[],[f23]) ).
fof(f29,plain,
! [X0,X1] :
( cc(X0)
| ~ rr(X1,X0)
| cUnsatisfiable(X1) ),
inference(consistent_polarity_flipping,[],[f22]) ).
fof(f30,plain,
! [X0] :
( cd(X0)
| ~ cc(X0) ),
inference(consistent_polarity_flipping,[],[f25]) ).
fof(f31,plain,
~ cUnsatisfiable(i2003_11_14_17_20_04172),
inference(consistent_polarity_flipping,[],[f26]) ).
fof(f34,plain,
$false,
inference(finite_model_not_found_(exhaustively_excluded_all_possible_domain_size_assignments),[],[f27,f28,f29,f30,f31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS092+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.10/0.37 % Computer : n007.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 13:21:40 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/0.41 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.10/0.44 % (1417700)Will run a generic schedule for satisfiability detection.
% 0.10/0.44 % (1417705)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3206432339_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.44 % TRYING [1]
% 0.10/0.44 % TRYING [2]
% 0.10/0.44 % (1417705) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1417700-1417705"...
% 0.10/0.44 % (1417705)...printing done.
% 0.10/0.44 % (1417705)Refutation found. Thanks to Tanya!
% 0.10/0.44 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.44 % (1417705)------------------------------
% 0.10/0.44 % (1417705)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.44 % (1417705)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.44 % (1417705)CaDiCaL version: 2.1.3
% 0.10/0.44 % (1417705)Termination reason: Refutation
% 0.10/0.44 % (1417705)Time elapsed: 0.001 s
% 0.10/0.44 % (1417705)Peak memory usage: 11 MB
% 0.10/0.44 % (1417705)Instructions burned: 1 (million)
% 0.10/0.44 % (1417700)Success in time 0.024 s
% 0.10/0.44 % Vampire exiting
%------------------------------------------------------------------------------