%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN047+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n011.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:06:32 PM UTC 2026
% Result : Theorem 0.29s 0.26s
% Output : Refutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 84 ( 8 unt; 8 def)
% Number of atoms : 292 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 340 ( 132 ~; 159 |; 32 &)
% ( 10 <=>; 4 =>; 0 <=; 3 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 13 ( 12 usr; 13 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,
( ( ( p
& ( q
=> r ) )
=> s )
<=> ( ( ~ p
| q
| s )
& ( ~ p
| ~ r
| s ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel17) ).
fof(f2,negated_conjecture,
~ ( ( ( p
& ( q
=> r ) )
=> s )
<=> ( ( ~ p
| q
| s )
& ( ~ p
| ~ r
| s ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
( ( s
| ~ p
| ( ~ r
& q ) )
<~> ( ( ~ p
| q
| s )
& ( ~ p
| ~ r
| s ) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
( ( s
| ~ p
| ( ~ r
& q ) )
<~> ( ( ~ p
| q
| s )
& ( ~ p
| ~ r
| s ) ) ),
inference(flattening,[],[f3]) ).
fof(f5,definition,
( sP0
<=> ( ~ p
| ~ r
| s ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f6,definition,
( sP1
<=> ( s
| ~ p
| ( ~ r
& q ) ) ),
introduced(definition,[new_symbols(definition,[sP1])],[predicate_definition_introduction]) ).
fof(f7,plain,
( sP1
<~> ( ( ~ p
| q
| s )
& sP0 ) ),
inference(definition_folding,[],[f4,f6,f5]) ).
fof(f8,plain,
( ( sP1
| ( ~ s
& p
& ( r
| ~ q ) ) )
& ( s
| ~ p
| ( ~ r
& q )
| ~ sP1 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f9,plain,
( ( sP1
| ( ~ s
& p
& ( r
| ~ q ) ) )
& ( s
| ~ p
| ( ~ r
& q )
| ~ sP1 ) ),
inference(flattening,[],[f8]) ).
fof(f10,plain,
( ( sP0
| ( p
& r
& ~ s ) )
& ( ~ p
| ~ r
| s
| ~ sP0 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f11,plain,
( ( sP0
| ( p
& r
& ~ s ) )
& ( ~ p
| ~ r
| s
| ~ sP0 ) ),
inference(flattening,[],[f10]) ).
fof(f12,plain,
( ( ( p
& ~ q
& ~ s )
| ~ sP0
| ~ sP1 )
& ( ( ( ~ p
| q
| s )
& sP0 )
| sP1 ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f13,plain,
( ( ( p
& ~ q
& ~ s )
| ~ sP0
| ~ sP1 )
& ( ( ( ~ p
| q
| s )
& sP0 )
| sP1 ) ),
inference(flattening,[],[f12]) ).
fof(f14,plain,
( s
| ~ p
| q
| ~ sP1 ),
inference(cnf_transformation,[],[f9]) ).
fof(f15,plain,
( s
| ~ p
| ~ r
| ~ sP1 ),
inference(cnf_transformation,[],[f9]) ).
fof(f16,plain,
( sP1
| r
| ~ q ),
inference(cnf_transformation,[],[f9]) ).
fof(f17,plain,
( sP1
| p ),
inference(cnf_transformation,[],[f9]) ).
fof(f18,plain,
( sP1
| ~ s ),
inference(cnf_transformation,[],[f9]) ).
fof(f19,plain,
( ~ p
| ~ r
| s
| ~ sP0 ),
inference(cnf_transformation,[],[f11]) ).
fof(f20,plain,
( sP0
| ~ s ),
inference(cnf_transformation,[],[f11]) ).
fof(f21,plain,
( sP0
| r ),
inference(cnf_transformation,[],[f11]) ).
fof(f22,plain,
( sP0
| p ),
inference(cnf_transformation,[],[f11]) ).
fof(f23,plain,
( sP0
| sP1 ),
inference(cnf_transformation,[],[f13]) ).
fof(f24,plain,
( ~ p
| q
| s
| sP1 ),
inference(cnf_transformation,[],[f13]) ).
fof(f25,plain,
( ~ s
| ~ sP0
| ~ sP1 ),
inference(cnf_transformation,[],[f13]) ).
fof(f26,plain,
( ~ q
| ~ sP0
| ~ sP1 ),
inference(cnf_transformation,[],[f13]) ).
fof(f27,plain,
( p
| ~ sP0
| ~ sP1 ),
inference(cnf_transformation,[],[f13]) ).
fof(f28,plain,
( ~ sP1
| s ),
inference(consistent_polarity_flipping,[],[f18]) ).
fof(f29,plain,
( ~ sP1
| ~ p ),
inference(consistent_polarity_flipping,[],[f17]) ).
fof(f30,plain,
( ~ sP1
| ~ r
| ~ q ),
inference(consistent_polarity_flipping,[],[f16]) ).
fof(f31,plain,
( ~ s
| p
| r
| sP1 ),
inference(consistent_polarity_flipping,[],[f15]) ).
fof(f32,plain,
( ~ s
| p
| q
| sP1 ),
inference(consistent_polarity_flipping,[],[f14]) ).
fof(f33,plain,
( ~ sP0
| ~ p ),
inference(consistent_polarity_flipping,[],[f22]) ).
fof(f34,plain,
( ~ sP0
| ~ r ),
inference(consistent_polarity_flipping,[],[f21]) ).
fof(f35,plain,
( ~ sP0
| s ),
inference(consistent_polarity_flipping,[],[f20]) ).
fof(f36,plain,
( p
| r
| ~ s
| sP0 ),
inference(consistent_polarity_flipping,[],[f19]) ).
fof(f37,plain,
( ~ p
| sP0
| sP1 ),
inference(consistent_polarity_flipping,[],[f27]) ).
fof(f38,plain,
( ~ q
| sP0
| sP1 ),
inference(consistent_polarity_flipping,[],[f26]) ).
fof(f39,plain,
( s
| sP0
| sP1 ),
inference(consistent_polarity_flipping,[],[f25]) ).
fof(f40,plain,
( p
| q
| ~ s
| ~ sP1 ),
inference(consistent_polarity_flipping,[],[f24]) ).
fof(f41,plain,
( ~ sP0
| ~ sP1 ),
inference(consistent_polarity_flipping,[],[f23]) ).
fof(f43,definition,
( spl2_1
<=> sP1 ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
fof(f47,definition,
( spl2_2
<=> sP0 ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
fof(f50,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f41,f47,f43]) ).
fof(f52,definition,
( spl2_3
<=> s ),
introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition]) ).
fof(f56,definition,
( spl2_4
<=> q ),
introduced(definition,[new_symbols(definition,[spl2_4])],[avatar_definition]) ).
fof(f60,definition,
( spl2_5
<=> p ),
introduced(definition,[new_symbols(definition,[spl2_5])],[avatar_definition]) ).
fof(f63,plain,
( ~ spl2_1
| ~ spl2_3
| spl2_4
| spl2_5 ),
inference(avatar_split_clause,[],[f40,f60,f56,f52,f43]) ).
fof(f64,plain,
( spl2_1
| spl2_2
| spl2_3 ),
inference(avatar_split_clause,[],[f39,f52,f47,f43]) ).
fof(f65,plain,
( spl2_1
| spl2_2
| ~ spl2_4 ),
inference(avatar_split_clause,[],[f38,f56,f47,f43]) ).
fof(f66,plain,
( spl2_1
| spl2_2
| ~ spl2_5 ),
inference(avatar_split_clause,[],[f37,f60,f47,f43]) ).
fof(f68,definition,
( spl2_6
<=> r ),
introduced(definition,[new_symbols(definition,[spl2_6])],[avatar_definition]) ).
fof(f71,plain,
( spl2_2
| ~ spl2_3
| spl2_6
| spl2_5 ),
inference(avatar_split_clause,[],[f36,f60,f68,f52,f47]) ).
fof(f72,plain,
( spl2_3
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f35,f47,f52]) ).
fof(f73,plain,
( ~ spl2_6
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f34,f47,f68]) ).
fof(f74,plain,
( ~ spl2_5
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f33,f47,f60]) ).
fof(f75,plain,
( spl2_1
| spl2_4
| spl2_5
| ~ spl2_3 ),
inference(avatar_split_clause,[],[f32,f52,f60,f56,f43]) ).
fof(f76,plain,
( spl2_1
| spl2_6
| spl2_5
| ~ spl2_3 ),
inference(avatar_split_clause,[],[f31,f52,f60,f68,f43]) ).
fof(f77,plain,
( ~ spl2_4
| ~ spl2_6
| ~ spl2_1 ),
inference(avatar_split_clause,[],[f30,f43,f68,f56]) ).
fof(f78,plain,
( ~ spl2_5
| ~ spl2_1 ),
inference(avatar_split_clause,[],[f29,f43,f60]) ).
fof(f79,plain,
( spl2_3
| ~ spl2_1 ),
inference(avatar_split_clause,[],[f28,f43,f52]) ).
cnf(s1,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(sat_conversion,[],[f50]) ).
cnf(s2,plain,
( ~ spl2_1
| ~ spl2_3
| spl2_4
| spl2_5 ),
inference(sat_conversion,[],[f63]) ).
cnf(s3,plain,
( spl2_1
| spl2_2
| spl2_3 ),
inference(sat_conversion,[],[f64]) ).
cnf(s4,plain,
( spl2_1
| spl2_2
| ~ spl2_4 ),
inference(sat_conversion,[],[f65]) ).
cnf(s5,plain,
( spl2_1
| spl2_2
| ~ spl2_5 ),
inference(sat_conversion,[],[f66]) ).
cnf(s6,plain,
( spl2_2
| ~ spl2_3
| spl2_5
| spl2_6 ),
inference(sat_conversion,[],[f71]) ).
cnf(s7,plain,
( ~ spl2_2
| spl2_3 ),
inference(sat_conversion,[],[f72]) ).
cnf(s8,plain,
( ~ spl2_2
| ~ spl2_6 ),
inference(sat_conversion,[],[f73]) ).
cnf(s9,plain,
( ~ spl2_2
| ~ spl2_5 ),
inference(sat_conversion,[],[f74]) ).
cnf(s10,plain,
( spl2_1
| ~ spl2_3
| spl2_4
| spl2_5 ),
inference(sat_conversion,[],[f75]) ).
cnf(s11,plain,
( spl2_1
| ~ spl2_3
| spl2_5
| spl2_6 ),
inference(sat_conversion,[],[f76]) ).
cnf(s12,plain,
( ~ spl2_1
| ~ spl2_4
| ~ spl2_6 ),
inference(sat_conversion,[],[f77]) ).
cnf(s13,plain,
( ~ spl2_1
| ~ spl2_5 ),
inference(sat_conversion,[],[f78]) ).
cnf(s14,plain,
( ~ spl2_1
| spl2_3 ),
inference(sat_conversion,[],[f79]) ).
cnf(s15,plain,
( spl2_2
| spl2_1 ),
inference(rat,[],[s10,s3,s4,s5]) ).
cnf(s16,plain,
spl2_1,
inference(rat,[],[s11,s7,s8,s9,s15]) ).
cnf(s17,plain,
spl2_3,
inference(rat,[],[s14,s16]) ).
cnf(s18,plain,
~ spl2_5,
inference(rat,[],[s13,s16]) ).
cnf(s19,plain,
~ spl2_2,
inference(rat,[],[s1,s16]) ).
cnf(s20,plain,
spl2_4,
inference(rat,[],[s2,s18,s17,s16]) ).
cnf(s21,plain,
spl2_6,
inference(rat,[],[s6,s19,s18,s17]) ).
cnf(s22,plain,
$false,
inference(rat,[],[s12,s16,s21,s20]) ).
fof(f80,plain,
$false,
inference(avatar_sat_refutation,[],[s22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN047+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n011.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 15:22:31 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.29/0.26 % (3462841)Will run a generic schedule for satisfiability detection.
% 0.29/0.26 % (3462852)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2801361316:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.29/0.26 % (3462852) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3462841-3462852"...
% 0.29/0.26 % (3462852)...printing done.
% 0.29/0.26 % (3462852)Refutation found. Thanks to Tanya!
% 0.29/0.26 % SZS status Theorem for theBenchmark
% 0.29/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.29/0.26 % (3462852)------------------------------
% 0.29/0.26 % (3462852)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.26 % (3462852)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.26 % (3462852)CaDiCaL version: 2.1.3
% 0.29/0.26 % (3462852)Termination reason: Refutation
% 0.29/0.26 % (3462852)Time elapsed: 0.001 s
% 0.29/0.26 % (3462852)Peak memory usage: 12 MB
% 0.29/0.26 % (3462852)Instructions burned: 1 (million)
% 0.29/0.26 % (3462841)Success in time 0.033 s
% 0.29/0.26 % Vampire exiting
%------------------------------------------------------------------------------