%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN936+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 : n006.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:54 PM UTC 2026
% Result : Theorem 0.21s 0.27s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 32 ( 8 unt; 4 def)
% Number of atoms : 69 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 60 ( 23 ~; 23 |; 0 &)
% ( 7 <=>; 6 =>; 0 <=; 1 <~>)
% Maximal formula depth : 6 ( 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 : 12 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ! [X0] :
( c
=> p(X0) )
<=> ( c
=> ! [X0] : p(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ( ! [X0] :
( c
=> p(X0) )
<=> ( c
=> ! [X0] : p(X0) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
~ ( ! [X0] :
( c
=> p(X0) )
<=> ( c
=> ! [X1] : p(X1) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ! [X0] :
( p(X0)
| ~ c )
<~> ( ! [X1] : p(X1)
| ~ c ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
! [X0,X1] :
( p(X1)
| ~ c
| p(X0) ),
inference(cnf_transformation,[],[f4]) ).
fof(f7,plain,
( ~ p(sK1)
| ~ p(sK0) ),
inference(cnf_transformation,[],[f4]) ).
fof(f8,plain,
c,
inference(cnf_transformation,[],[f4]) ).
fof(f11,definition,
( spl2_1
<=> ! [X0] : p(X0) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
fof(f12,plain,
( ! [X0] : p(X0)
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f11]) ).
fof(f14,definition,
( spl2_2
<=> c ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
fof(f17,plain,
( spl2_1
| ~ spl2_2
| spl2_1 ),
inference(avatar_split_clause,[],[f5,f11,f14,f11]) ).
fof(f19,definition,
( spl2_3
<=> p(sK0) ),
introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition]) ).
fof(f21,plain,
( ~ p(sK0)
| spl2_3 ),
inference(avatar_component_clause,[],[f19]) ).
fof(f23,definition,
( spl2_4
<=> p(sK1) ),
introduced(definition,[new_symbols(definition,[spl2_4])],[avatar_definition]) ).
fof(f25,plain,
( ~ p(sK1)
| spl2_4 ),
inference(avatar_component_clause,[],[f23]) ).
fof(f26,plain,
( ~ spl2_3
| ~ spl2_4 ),
inference(avatar_split_clause,[],[f7,f23,f19]) ).
fof(f27,plain,
spl2_2,
inference(avatar_split_clause,[],[f8,f14]) ).
fof(f28,plain,
( $false
| ~ spl2_1
| spl2_3 ),
inference(forward_subsumption_resolution,[],[f21,f12]) ).
fof(f29,plain,
( ~ spl2_1
| spl2_3 ),
inference(avatar_contradiction_clause,[],[f28]) ).
fof(f30,plain,
( $false
| ~ spl2_1
| spl2_4 ),
inference(forward_subsumption_resolution,[],[f25,f12]) ).
fof(f31,plain,
( ~ spl2_1
| spl2_4 ),
inference(avatar_contradiction_clause,[],[f30]) ).
cnf(s1,plain,
( spl2_1
| spl2_1
| ~ spl2_2 ),
inference(sat_conversion,[],[f17]) ).
cnf(s2,plain,
( spl2_1
| ~ spl2_2 ),
inference(rat,[],[s1]) ).
cnf(s3,plain,
( ~ spl2_3
| ~ spl2_4 ),
inference(sat_conversion,[],[f26]) ).
cnf(s4,plain,
spl2_2,
inference(sat_conversion,[],[f27]) ).
cnf(s5,plain,
( ~ spl2_1
| spl2_3 ),
inference(sat_conversion,[],[f29]) ).
cnf(s6,plain,
( ~ spl2_1
| spl2_4 ),
inference(sat_conversion,[],[f31]) ).
cnf(s7,plain,
spl2_1,
inference(rat,[],[s2,s4]) ).
cnf(s8,plain,
spl2_4,
inference(rat,[],[s6,s7]) ).
cnf(s9,plain,
spl2_3,
inference(rat,[],[s5,s7]) ).
cnf(s10,plain,
$false,
inference(rat,[],[s3,s8,s9]) ).
fof(f32,plain,
$false,
inference(avatar_sat_refutation,[],[s10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN936+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n006.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:13:25 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/0.23 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.21/0.27 % (4119253)Will run a generic schedule for satisfiability detection.
% 0.21/0.27 % (4119262)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=874771059:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.27 % (4119262) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4119253-4119262"...
% 0.21/0.27 % (4119262)...printing done.
% 0.21/0.27 % (4119262)Refutation found. Thanks to Tanya!
% 0.21/0.27 % SZS status Theorem for theBenchmark
% 0.21/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.27 % (4119262)------------------------------
% 0.21/0.27 % (4119262)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.27 % (4119262)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.27 % (4119262)CaDiCaL version: 2.1.3
% 0.21/0.27 % (4119262)Termination reason: Refutation
% 0.21/0.27 % (4119262)Time elapsed: 0.001 s
% 0.21/0.27 % (4119262)Peak memory usage: 12 MB
% 0.21/0.27 % (4119253)Success in time 0.036 s
% 0.21/0.27 % Vampire exiting
%------------------------------------------------------------------------------