%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN954+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 : n019.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 02:22:56 PM UTC 2026
% Result : Theorem 0.09s 0.25s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 7 unt; 3 def)
% Number of atoms : 67 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 67 ( 30 ~; 21 |; 5 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 4 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 19 ( 0 sgn 15 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0,X1] :
( ! [X2] :
( q(X2)
=> p(X2) )
=> ? [X3] :
( ( p(X3)
=> p(X0) )
& ( q(X3)
=> p(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ! [X0,X1] :
( ! [X2] :
( q(X2)
=> p(X2) )
=> ? [X3] :
( ( p(X3)
=> p(X0) )
& ( q(X3)
=> p(X1) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
? [X0,X1] :
( ! [X3] :
( ( ~ p(X0)
& p(X3) )
| ( ~ p(X1)
& q(X3) ) )
& ! [X2] :
( p(X2)
| ~ q(X2) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f5,plain,
( ~ p(sK1)
| ~ p(sK0) ),
inference(cnf_transformation,[],[f3]) ).
fof(f6,plain,
! [X3] :
( q(X3)
| p(X3) ),
inference(cnf_transformation,[],[f3]) ).
fof(f8,plain,
! [X2] :
( ~ q(X2)
| p(X2) ),
inference(cnf_transformation,[],[f3]) ).
fof(f9,plain,
! [X2] :
( ~ p(X2)
| ~ q(X2) ),
inference(consistent_polarity_flipping,[],[f8]) ).
fof(f11,plain,
! [X3] :
( q(X3)
| ~ p(X3) ),
inference(consistent_polarity_flipping,[],[f6]) ).
fof(f12,plain,
( p(sK1)
| p(sK0) ),
inference(consistent_polarity_flipping,[],[f5]) ).
fof(f15,definition,
( spl2_1
<=> ! [X3] : ~ p(X3) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
fof(f16,plain,
( ! [X3] : ~ p(X3)
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f15]) ).
fof(f18,definition,
( spl2_2
<=> p(sK1) ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
fof(f20,plain,
( p(sK1)
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f18]) ).
fof(f23,definition,
( spl2_3
<=> p(sK0) ),
introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition]) ).
fof(f25,plain,
( p(sK0)
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f23]) ).
fof(f26,plain,
( spl2_3
| spl2_2 ),
inference(avatar_split_clause,[],[f12,f18,f23]) ).
fof(f33,plain,
! [X3] : ~ p(X3),
inference(forward_subsumption_resolution,[],[f11,f9]) ).
fof(f34,plain,
spl2_1,
inference(avatar_split_clause,[],[f33,f15]) ).
fof(f35,plain,
( $false
| ~ spl2_1
| ~ spl2_2 ),
inference(backward_subsumption_resolution,[],[f20,f16]) ).
fof(f36,plain,
( $false
| ~ spl2_1
| ~ spl2_3 ),
inference(backward_subsumption_resolution,[],[f25,f16]) ).
fof(f37,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(avatar_contradiction_clause,[],[f35]) ).
fof(f38,plain,
( ~ spl2_1
| ~ spl2_3 ),
inference(avatar_contradiction_clause,[],[f36]) ).
cnf(s2,plain,
( spl2_2
| spl2_3 ),
inference(sat_conversion,[],[f26]) ).
cnf(s4,plain,
spl2_1,
inference(sat_conversion,[],[f34]) ).
cnf(s5,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(sat_conversion,[],[f37]) ).
cnf(s6,plain,
( ~ spl2_1
| ~ spl2_3 ),
inference(sat_conversion,[],[f38]) ).
cnf(s7,plain,
~ spl2_3,
inference(rat,[],[s6,s4]) ).
cnf(s8,plain,
~ spl2_2,
inference(rat,[],[s5,s4]) ).
cnf(s10,plain,
$false,
inference(rat,[],[s2,s7,s8]) ).
fof(f39,plain,
$false,
inference(avatar_sat_refutation,[],[s10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN954+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.09/0.19 % Computer : n019.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 17:16:33 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.22 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.09/0.25 % (4166383)Will run a generic schedule for satisfiability detection.
% 0.09/0.25 % (4166396)% WARNING: option uhcvi not known.
% 0.09/0.25 % (4166396)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1250600298:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.25 % (4166396) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4166383-4166396"...
% 0.09/0.25 % (4166396)...printing done.
% 0.09/0.25 % (4166396)Refutation found. Thanks to Tanya!
% 0.09/0.25 % SZS status Theorem for theBenchmark
% 0.09/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.25 % (4166396)------------------------------
% 0.09/0.25 % (4166396)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.25 % (4166396)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.25 % (4166396)CaDiCaL version: 2.1.3
% 0.09/0.25 % (4166396)Termination reason: Refutation
% 0.09/0.25 % (4166396)Time elapsed: 0.001 s
% 0.09/0.25 % (4166396)Peak memory usage: 12 MB
% 0.09/0.25 % (4166396)Instructions burned: 1 (million)
% 0.09/0.25 % (4166383)Success in time 0.027 s
% 0.09/0.25 % Vampire exiting
%------------------------------------------------------------------------------