%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN930+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:53 PM UTC 2026
% Result : Theorem 0.08s 0.25s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 5
% Syntax : Number of formulae : 38 ( 8 unt; 4 def)
% Number of atoms : 107 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 107 ( 38 ~; 49 |; 12 &)
% ( 7 <=>; 0 =>; 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 : 28 ( 0 sgn 22 !; 6 ?)
% 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,
( ( ( ~ p(sK0)
& ~ c )
| ( ~ p(sK1)
& ~ c ) )
& ( ! [X2] : p(X2)
| c
| ! [X3] :
( p(X3)
| c ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f7]) ).
fof(f9,plain,
! [X2,X3] :
( p(X2)
| c
| p(X3)
| c ),
inference(cnf_transformation,[],[f8]) ).
fof(f10,plain,
( ~ c
| ~ c ),
inference(cnf_transformation,[],[f8]) ).
fof(f13,plain,
( ~ p(sK0)
| ~ p(sK1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f14,plain,
! [X2,X3] :
( p(X2)
| c
| p(X3) ),
inference(duplicate_literal_removal,[],[f9]) ).
fof(f15,plain,
~ c,
inference(duplicate_literal_removal,[],[f10]) ).
fof(f17,definition,
( spl2_1
<=> ! [X3] : p(X3) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
fof(f18,plain,
( ! [X3] : p(X3)
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f17]) ).
fof(f20,definition,
( spl2_2
<=> c ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
fof(f23,plain,
( spl2_1
| spl2_2
| spl2_1 ),
inference(avatar_split_clause,[],[f14,f17,f20,f17]) ).
fof(f24,plain,
~ spl2_2,
inference(avatar_split_clause,[],[f15,f20]) ).
fof(f26,definition,
( spl2_3
<=> p(sK1) ),
introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition]) ).
fof(f28,plain,
( ~ p(sK1)
| spl2_3 ),
inference(avatar_component_clause,[],[f26]) ).
fof(f31,definition,
( spl2_4
<=> p(sK0) ),
introduced(definition,[new_symbols(definition,[spl2_4])],[avatar_definition]) ).
fof(f33,plain,
( ~ p(sK0)
| spl2_4 ),
inference(avatar_component_clause,[],[f31]) ).
fof(f35,plain,
( ~ spl2_3
| ~ spl2_4 ),
inference(avatar_split_clause,[],[f13,f31,f26]) ).
fof(f36,plain,
( $false
| ~ spl2_1
| spl2_3 ),
inference(forward_subsumption_resolution,[],[f28,f18]) ).
fof(f37,plain,
( ~ spl2_1
| spl2_3 ),
inference(avatar_contradiction_clause,[],[f36]) ).
fof(f38,plain,
( $false
| ~ spl2_1
| spl2_4 ),
inference(forward_subsumption_resolution,[],[f33,f18]) ).
fof(f39,plain,
( ~ spl2_1
| spl2_4 ),
inference(avatar_contradiction_clause,[],[f38]) ).
cnf(s1,plain,
( spl2_1
| spl2_1
| spl2_2 ),
inference(sat_conversion,[],[f23]) ).
cnf(s2,plain,
( spl2_1
| spl2_2 ),
inference(rat,[],[s1]) ).
cnf(s3,plain,
~ spl2_2,
inference(sat_conversion,[],[f24]) ).
cnf(s6,plain,
( ~ spl2_3
| ~ spl2_4 ),
inference(sat_conversion,[],[f35]) ).
cnf(s7,plain,
( ~ spl2_1
| spl2_3 ),
inference(sat_conversion,[],[f37]) ).
cnf(s8,plain,
( ~ spl2_1
| spl2_4 ),
inference(sat_conversion,[],[f39]) ).
cnf(s9,plain,
spl2_1,
inference(rat,[],[s2,s3]) ).
cnf(s10,plain,
spl2_4,
inference(rat,[],[s8,s9]) ).
cnf(s11,plain,
spl2_3,
inference(rat,[],[s7,s9]) ).
cnf(s12,plain,
$false,
inference(rat,[],[s6,s10,s11]) ).
fof(f40,plain,
$false,
inference(avatar_sat_refutation,[],[s12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN930+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.08/0.17 % Computer : n006.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Mon Sep 28 17:13:55 UTC 2026
% 0.08/0.17 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20 Running first-order model finding
% 0.08/0.20 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.08/0.25 % (4120077)Will run a generic schedule for satisfiability detection.
% 0.08/0.25 % (4120085)dis+10_1_sil=32000:sp=arity:random_seed=772986031:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.25 % (4120085) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4120077-4120085"...
% 0.08/0.25 % (4120085)...printing done.
% 0.08/0.25 % (4120085)Refutation found. Thanks to Tanya!
% 0.08/0.25 % SZS status Theorem for theBenchmark
% 0.08/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.25 % (4120085)------------------------------
% 0.08/0.25 % (4120085)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.25 % (4120085)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.25 % (4120085)CaDiCaL version: 2.1.3
% 0.08/0.25 % (4120085)Termination reason: Refutation
% 0.08/0.25 % (4120085)Time elapsed: 0.001 s
% 0.08/0.25 % (4120085)Peak memory usage: 12 MB
% 0.08/0.25 % (4120085)Instructions burned: 1 (million)
% 0.08/0.25 % (4120077)Success in time 0.038 s
% 0.08/0.25 % Vampire exiting
%------------------------------------------------------------------------------