%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN392+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 : n008.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:07:34 PM UTC 2026
% Result : Theorem 0.24s 0.36s
% Output : Refutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 42 ( 5 unt; 4 def)
% Number of atoms : 143 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 162 ( 61 ~; 74 |; 15 &)
% ( 10 <=>; 0 =>; 0 <=; 2 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 7 ( 6 usr; 7 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( p1
<=> p2 )
<=> ( ( p2
| ~ p1 )
& ( ~ p2
| p1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel14) ).
fof(f2,negated_conjecture,
~ ( ( p1
<=> p2 )
<=> ( ( p2
| ~ p1 )
& ( ~ p2
| p1 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
( ( p1
<=> p2 )
<~> ( ( p2
| ~ p1 )
& ( ~ p2
| p1 ) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,definition,
( sP0
<=> ( ( p2
| ~ p1 )
& ( ~ p2
| p1 ) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f5,plain,
( ( p1
<=> p2 )
<~> sP0 ),
inference(definition_folding,[],[f3,f4]) ).
fof(f6,plain,
( ( sP0
| ( ~ p2
& p1 )
| ( p2
& ~ p1 ) )
& ( ( ( p2
| ~ p1 )
& ( ~ p2
| p1 ) )
| ~ sP0 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f7,plain,
( ( sP0
| ( ~ p2
& p1 )
| ( p2
& ~ p1 ) )
& ( ( ( p2
| ~ p1 )
& ( ~ p2
| p1 ) )
| ~ sP0 ) ),
inference(flattening,[],[f6]) ).
fof(f8,plain,
( ( ~ sP0
| ( ( ~ p2
| ~ p1 )
& ( p2
| p1 ) ) )
& ( sP0
| ( ( p1
| ~ p2 )
& ( p2
| ~ p1 ) ) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f9,plain,
( ~ p2
| p1
| ~ sP0 ),
inference(cnf_transformation,[],[f7]) ).
fof(f10,plain,
( p2
| ~ p1
| ~ sP0 ),
inference(cnf_transformation,[],[f7]) ).
fof(f12,plain,
( sP0
| p1
| p2 ),
inference(cnf_transformation,[],[f7]) ).
fof(f13,plain,
( sP0
| ~ p2
| ~ p1 ),
inference(cnf_transformation,[],[f7]) ).
fof(f15,plain,
( sP0
| p2
| ~ p1 ),
inference(cnf_transformation,[],[f8]) ).
fof(f16,plain,
( sP0
| p1
| ~ p2 ),
inference(cnf_transformation,[],[f8]) ).
fof(f17,plain,
( ~ sP0
| p2
| p1 ),
inference(cnf_transformation,[],[f8]) ).
fof(f18,plain,
( ~ sP0
| ~ p2
| ~ p1 ),
inference(cnf_transformation,[],[f8]) ).
fof(f20,definition,
( spl1_1
<=> p1 ),
introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition]) ).
fof(f24,definition,
( spl1_2
<=> p2 ),
introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition]) ).
fof(f28,definition,
( spl1_3
<=> sP0 ),
introduced(definition,[new_symbols(definition,[spl1_3])],[avatar_definition]) ).
fof(f31,plain,
( ~ spl1_1
| spl1_2
| spl1_3 ),
inference(avatar_split_clause,[],[f15,f28,f24,f20]) ).
fof(f32,plain,
( ~ spl1_2
| spl1_1
| spl1_3 ),
inference(avatar_split_clause,[],[f16,f28,f20,f24]) ).
fof(f33,plain,
( spl1_1
| spl1_2
| ~ spl1_3 ),
inference(avatar_split_clause,[],[f17,f28,f24,f20]) ).
fof(f34,plain,
( ~ spl1_1
| ~ spl1_2
| ~ spl1_3 ),
inference(avatar_split_clause,[],[f18,f28,f24,f20]) ).
fof(f35,plain,
( ~ spl1_3
| spl1_1
| ~ spl1_2 ),
inference(avatar_split_clause,[],[f9,f24,f20,f28]) ).
fof(f36,plain,
( ~ spl1_3
| ~ spl1_1
| spl1_2 ),
inference(avatar_split_clause,[],[f10,f24,f20,f28]) ).
fof(f37,plain,
( spl1_2
| spl1_1
| spl1_3 ),
inference(avatar_split_clause,[],[f12,f28,f20,f24]) ).
fof(f38,plain,
( ~ spl1_1
| ~ spl1_2
| spl1_3 ),
inference(avatar_split_clause,[],[f13,f28,f24,f20]) ).
cnf(s1,plain,
( ~ spl1_1
| spl1_2
| spl1_3 ),
inference(sat_conversion,[],[f31]) ).
cnf(s2,plain,
( spl1_1
| ~ spl1_2
| spl1_3 ),
inference(sat_conversion,[],[f32]) ).
cnf(s3,plain,
( spl1_1
| spl1_2
| ~ spl1_3 ),
inference(sat_conversion,[],[f33]) ).
cnf(s4,plain,
( ~ spl1_1
| ~ spl1_2
| ~ spl1_3 ),
inference(sat_conversion,[],[f34]) ).
cnf(s5,plain,
( spl1_1
| ~ spl1_2
| ~ spl1_3 ),
inference(sat_conversion,[],[f35]) ).
cnf(s6,plain,
( ~ spl1_1
| spl1_2
| ~ spl1_3 ),
inference(sat_conversion,[],[f36]) ).
cnf(s7,plain,
( spl1_1
| spl1_2
| spl1_3 ),
inference(sat_conversion,[],[f37]) ).
cnf(s8,plain,
( ~ spl1_1
| ~ spl1_2
| spl1_3 ),
inference(sat_conversion,[],[f38]) ).
cnf(s9,plain,
( spl1_2
| spl1_1 ),
inference(rat,[],[s3,s7]) ).
cnf(s10,plain,
( ~ spl1_2
| spl1_1 ),
inference(rat,[],[s2,s5]) ).
cnf(s11,plain,
spl1_1,
inference(rat,[],[s10,s9]) ).
cnf(s12,plain,
spl1_2,
inference(rat,[],[s6,s1,s11]) ).
cnf(s13,plain,
spl1_3,
inference(rat,[],[s8,s11,s12]) ).
cnf(s14,plain,
$false,
inference(rat,[],[s4,s11,s13,s12]) ).
fof(f39,plain,
$false,
inference(avatar_sat_refutation,[],[s14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SYN392+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.09 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.24/0.28 % Computer : n008.cluster.edu
% 0.24/0.28 % Model : x86_64 x86_64
% 0.24/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.24/0.28 % Memory : 8046.5625MB
% 0.24/0.28 % OS : Linux 6.8.0-71-generic
% 0.24/0.28 % CPULimit : 300
% 0.24/0.28 % WCLimit : 300
% 0.24/0.28 % DateTime : Mon Sep 28 15:54:40 UTC 2026
% 0.24/0.28 % CPUTime :
% 0.24/0.28 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.24/0.33 Running first-order model finding
% 0.24/0.33 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.24/0.36 % (2365316)Will run a generic schedule for satisfiability detection.
% 0.24/0.36 % (2365326)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3050644313:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.24/0.36 % (2365326) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2365316-2365326"...
% 0.24/0.36 % (2365326)...printing done.
% 0.24/0.36 % (2365321)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1644674035_3000 on theBenchmark for (3000ds/0Mi)
% 0.24/0.36 % The problem is propositional so there are no sorts!
% 0.24/0.36 % TRYING []
% 0.24/0.36 % (2365321) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2365316-2365321"...
% 0.24/0.36 % (2365326)Refutation found. Thanks to Tanya!
% 0.24/0.36 % SZS status Theorem for theBenchmark
% 0.24/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.24/0.36 % (2365326)------------------------------
% 0.24/0.36 % (2365326)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.36 % (2365326)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.36 % (2365326)CaDiCaL version: 2.1.3
% 0.24/0.36 % (2365326)Termination reason: Refutation
% 0.24/0.36 % (2365326)Time elapsed: 0.001 s
% 0.24/0.36 % (2365326)Peak memory usage: 12 MB
% 0.24/0.36 % (2365326)Instructions burned: 1 (million)
% 0.24/0.36 % (2365316)Success in time 0.024 s
% 0.24/0.36 % Vampire exiting
%------------------------------------------------------------------------------