%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN931+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 : n026.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:53 PM UTC 2026
% Result : Theorem 0.19s 0.26s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 5
% Syntax : Number of formulae : 42 ( 8 unt; 4 def)
% Number of atoms : 117 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 119 ( 44 ~; 47 |; 20 &)
% ( 7 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 6 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 30 ( 0 sgn 16 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ? [X0] :
( p(X0)
& c )
<=> ( ? [X0] : p(X0)
& c ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ( ? [X0] :
( p(X0)
& c )
<=> ( ? [X0] : p(X0)
& c ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
~ ( ? [X0] :
( p(X0)
& c )
<=> ( ? [X1] : p(X1)
& c ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ? [X0] :
( p(X0)
& c )
<~> ( ? [X1] : p(X1)
& c ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ( ! [X1] : ~ p(X1)
| ~ c
| ! [X0] :
( ~ p(X0)
| ~ c ) )
& ( ( ? [X1] : p(X1)
& c )
| ? [X0] :
( p(X0)
& c ) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f6,plain,
( ( ! [X1] : ~ p(X1)
| ~ c
| ! [X0] :
( ~ p(X0)
| ~ c ) )
& ( ( ? [X1] : p(X1)
& c )
| ? [X0] :
( p(X0)
& c ) ) ),
inference(flattening,[],[f5]) ).
fof(f7,plain,
( ( ! [X0] : ~ p(X0)
| ~ c
| ! [X1] :
( ~ p(X1)
| ~ c ) )
& ( ( ? [X2] : p(X2)
& c )
| ? [X3] :
( p(X3)
& c ) ) ),
inference(rectify,[],[f6]) ).
fof(f8,plain,
( ( ! [X0] : ~ p(X0)
| ~ c
| ! [X1] :
( ~ p(X1)
| ~ c ) )
& ( ( p(sK0)
& c )
| ( p(sK1)
& c ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X2,sK0),skolemize(X3,sK1)],[f7]) ).
fof(f9,plain,
( c
| c ),
inference(cnf_transformation,[],[f8]) ).
fof(f12,plain,
( p(sK0)
| p(sK1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f13,plain,
! [X0,X1] :
( ~ p(X0)
| ~ c
| ~ p(X1)
| ~ c ),
inference(cnf_transformation,[],[f8]) ).
fof(f14,plain,
! [X0,X1] :
( p(X0)
| ~ c
| p(X1)
| ~ c ),
inference(consistent_polarity_flipping,[],[f13]) ).
fof(f15,plain,
( ~ p(sK0)
| ~ p(sK1) ),
inference(consistent_polarity_flipping,[],[f12]) ).
fof(f18,plain,
c,
inference(duplicate_literal_removal,[],[f9]) ).
fof(f19,plain,
! [X0,X1] :
( p(X0)
| ~ c
| p(X1) ),
inference(duplicate_literal_removal,[],[f14]) ).
fof(f21,definition,
( spl2_1
<=> p(sK1) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
fof(f23,plain,
( ~ p(sK1)
| spl2_1 ),
inference(avatar_component_clause,[],[f21]) ).
fof(f25,definition,
( spl2_2
<=> p(sK0) ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
fof(f27,plain,
( ~ p(sK0)
| spl2_2 ),
inference(avatar_component_clause,[],[f25]) ).
fof(f28,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f15,f25,f21]) ).
fof(f30,definition,
( spl2_3
<=> ! [X1] : p(X1) ),
introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition]) ).
fof(f31,plain,
( ! [X1] : p(X1)
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f30]) ).
fof(f33,definition,
( spl2_4
<=> c ),
introduced(definition,[new_symbols(definition,[spl2_4])],[avatar_definition]) ).
fof(f35,plain,
( ~ c
| spl2_4 ),
inference(avatar_component_clause,[],[f33]) ).
fof(f36,plain,
( spl2_3
| ~ spl2_4
| spl2_3 ),
inference(avatar_split_clause,[],[f19,f30,f33,f30]) ).
fof(f37,plain,
( $false
| spl2_4 ),
inference(resolution,[],[f35,f18]) ).
fof(f38,plain,
spl2_4,
inference(avatar_contradiction_clause,[],[f37]) ).
fof(f39,plain,
( $false
| spl2_1
| ~ spl2_3 ),
inference(resolution,[],[f31,f23]) ).
fof(f40,plain,
( $false
| spl2_2
| ~ spl2_3 ),
inference(resolution,[],[f31,f27]) ).
fof(f41,plain,
( spl2_2
| ~ spl2_3 ),
inference(avatar_contradiction_clause,[],[f40]) ).
fof(f42,plain,
( spl2_1
| ~ spl2_3 ),
inference(avatar_contradiction_clause,[],[f39]) ).
cnf(s1,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(sat_conversion,[],[f28]) ).
cnf(s2,plain,
( spl2_3
| spl2_3
| ~ spl2_4 ),
inference(sat_conversion,[],[f36]) ).
cnf(s3,plain,
( spl2_3
| ~ spl2_4 ),
inference(rat,[],[s2]) ).
cnf(s4,plain,
spl2_4,
inference(sat_conversion,[],[f38]) ).
cnf(s5,plain,
( spl2_2
| ~ spl2_3 ),
inference(sat_conversion,[],[f41]) ).
cnf(s6,plain,
( spl2_1
| ~ spl2_3 ),
inference(sat_conversion,[],[f42]) ).
cnf(s7,plain,
spl2_3,
inference(rat,[],[s3,s4]) ).
cnf(s8,plain,
spl2_1,
inference(rat,[],[s6,s7]) ).
cnf(s9,plain,
spl2_2,
inference(rat,[],[s5,s7]) ).
cnf(s10,plain,
$false,
inference(rat,[],[s1,s9,s8]) ).
fof(f43,plain,
$false,
inference(avatar_sat_refutation,[],[s10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN931+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.08/0.19 % Computer : n026.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Mon Sep 28 17:16:42 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 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.19/0.26 % (4026492)Will run a generic schedule for satisfiability detection.
% 0.19/0.26 % (4026503)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=352449888:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.26 % (4026503) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4026492-4026503"...
% 0.19/0.26 % (4026503)...printing done.
% 0.19/0.26 % (4026498)% WARNING: option uhcvi not known.
% 0.19/0.26 % (4026503)Refutation found. Thanks to Tanya!
% 0.19/0.26 % SZS status Theorem for theBenchmark
% 0.19/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.26 % (4026503)------------------------------
% 0.19/0.26 % (4026503)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.26 % (4026503)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.26 % (4026503)CaDiCaL version: 2.1.3
% 0.19/0.26 % (4026503)Termination reason: Refutation
% 0.19/0.26 % (4026503)Time elapsed: 0.001 s
% 0.19/0.26 % (4026503)Peak memory usage: 12 MB
% 0.19/0.26 % (4026503)Instructions burned: 1 (million)
% 0.19/0.26 % (4026492)Success in time 0.033 s
% 0.19/0.26 % Vampire exiting
%------------------------------------------------------------------------------