%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KRS012-1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n014.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:05 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.43s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 45 ( 12 unt; 5 def)
% Number of atoms : 93 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 81 ( 33 ~; 43 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 6 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 16 ( 0 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
c(exists),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
fof(f2,negated_conjecture,
~ f(exists),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
fof(f3,axiom,
! [X0,X1] :
( e(X0)
| ~ c(X1)
| ~ r(X1,X0)
| ~ d(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
fof(f4,axiom,
! [X0,X1] :
( d(X0)
| ~ c(X1)
| ~ r(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
fof(f12,axiom,
! [X0] :
( f(X0)
| ~ e(u1r1(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_12) ).
fof(f13,axiom,
! [X0] :
( f(X0)
| r(X0,u1r1(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_13) ).
fof(f14,plain,
~ c(exists),
inference(consistent_polarity_flipping,[],[f1]) ).
fof(f15,plain,
! [X0,X1] :
( d(X0)
| c(X1)
| r(X1,X0)
| ~ e(X0) ),
inference(consistent_polarity_flipping,[],[f3]) ).
fof(f16,plain,
! [X0,X1] :
( c(X1)
| ~ d(X0)
| r(X1,X0) ),
inference(consistent_polarity_flipping,[],[f4]) ).
fof(f24,plain,
! [X0] :
( e(u1r1(X0))
| f(X0) ),
inference(consistent_polarity_flipping,[],[f12]) ).
fof(f25,plain,
! [X0] :
( ~ r(X0,u1r1(X0))
| f(X0) ),
inference(consistent_polarity_flipping,[],[f13]) ).
fof(f26,plain,
! [X0] :
( r(exists,X0)
| ~ d(X0) ),
inference(resolution,[],[f16,f14]) ).
fof(f27,plain,
( ~ d(u1r1(exists))
| f(exists) ),
inference(resolution,[],[f26,f25]) ).
fof(f29,definition,
( spl0_1
<=> f(exists) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f31,plain,
( f(exists)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f29]) ).
fof(f33,definition,
( spl0_2
<=> d(u1r1(exists)) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f35,plain,
( ~ d(u1r1(exists))
| spl0_2 ),
inference(avatar_component_clause,[],[f33]) ).
fof(f36,plain,
( spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f27,f33,f29]) ).
fof(f38,plain,
( ! [X0] :
( c(X0)
| r(X0,u1r1(exists))
| ~ e(u1r1(exists)) )
| spl0_2 ),
inference(resolution,[],[f15,f35]) ).
fof(f40,definition,
( spl0_3
<=> e(u1r1(exists)) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f42,plain,
( ~ e(u1r1(exists))
| spl0_3 ),
inference(avatar_component_clause,[],[f40]) ).
fof(f44,definition,
( spl0_4
<=> ! [X0] :
( c(X0)
| r(X0,u1r1(exists)) ) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f45,plain,
( ! [X0] :
( r(X0,u1r1(exists))
| c(X0) )
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f44]) ).
fof(f46,plain,
( ~ spl0_3
| spl0_4
| spl0_2 ),
inference(avatar_split_clause,[],[f38,f33,f44,f40]) ).
fof(f47,plain,
( f(exists)
| spl0_3 ),
inference(resolution,[],[f42,f24]) ).
fof(f48,plain,
( spl0_1
| spl0_3 ),
inference(avatar_split_clause,[],[f47,f40,f29]) ).
fof(f49,plain,
( c(exists)
| f(exists)
| ~ spl0_4 ),
inference(resolution,[],[f45,f25]) ).
fof(f51,definition,
( spl0_5
<=> c(exists) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f53,plain,
( c(exists)
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f51]) ).
fof(f54,plain,
( spl0_1
| spl0_5
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f49,f44,f51,f29]) ).
fof(f55,plain,
( $false
| ~ spl0_1 ),
inference(resolution,[],[f31,f2]) ).
fof(f56,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f55]) ).
fof(f57,plain,
( $false
| ~ spl0_5 ),
inference(resolution,[],[f53,f14]) ).
fof(f58,plain,
~ spl0_5,
inference(avatar_contradiction_clause,[],[f57]) ).
cnf(s1,plain,
( spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f36]) ).
cnf(s2,plain,
( spl0_2
| ~ spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f46]) ).
cnf(s3,plain,
( spl0_1
| spl0_3 ),
inference(sat_conversion,[],[f48]) ).
cnf(s4,plain,
( spl0_1
| ~ spl0_4
| spl0_5 ),
inference(sat_conversion,[],[f54]) ).
cnf(s5,plain,
~ spl0_1,
inference(sat_conversion,[],[f56]) ).
cnf(s6,plain,
~ spl0_5,
inference(sat_conversion,[],[f58]) ).
cnf(s7,plain,
~ spl0_4,
inference(rat,[],[s4,s6,s5]) ).
cnf(s8,plain,
spl0_3,
inference(rat,[],[s3,s5]) ).
cnf(s9,plain,
spl0_2,
inference(rat,[],[s2,s7,s8]) ).
cnf(s10,plain,
$false,
inference(rat,[],[s1,s9,s5]) ).
fof(f59,plain,
$false,
inference(avatar_sat_refutation,[],[s10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KRS012-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.36 % Computer : n014.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 27 13:16:01 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.39 Running first-order model finding
% 0.10/0.39 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.43 % (811108)Will run a generic schedule for satisfiability detection.
% 0.10/0.43 % (811119)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=86198472:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.43 % (811119) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-811108-811119"...
% 0.10/0.43 % (811119)...printing done.
% 0.10/0.43 % (811119)Refutation found. Thanks to Tanya!
% 0.10/0.43 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.43 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.43 % (811119)------------------------------
% 0.10/0.43 % (811119)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.43 % (811119)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.43 % (811119)CaDiCaL version: 2.1.3
% 0.10/0.43 % (811119)Termination reason: Refutation
% 0.10/0.43 % (811119)Time elapsed: 0.001 s
% 0.10/0.43 % (811119)Peak memory usage: 12 MB
% 0.10/0.43 % (811119)Instructions burned: 1 (million)
% 0.10/0.43 % (811108)Success in time 0.024 s
% 0.10/0.43 % Vampire exiting
%------------------------------------------------------------------------------