%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN046+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 : n003.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.10s 0.23s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 8 unt; 2 def)
% Number of atoms : 60 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 62 ( 25 ~; 24 |; 6 &)
% ( 4 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 5 ( 4 usr; 5 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 )
<=> ( ~ p
| q ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel15) ).
fof(f2,negated_conjecture,
~ ( ( p
=> q )
<=> ( ~ p
| q ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
( ( q
| ~ p )
<~> ( ~ p
| q ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
( ( ( p
& ~ q )
| ( ~ q
& p ) )
& ( ~ p
| q
| q
| ~ p ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f5,plain,
( ( ( p
& ~ q )
| ( ~ q
& p ) )
& ( ~ p
| q
| q
| ~ p ) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
( ~ p
| q
| q
| ~ p ),
inference(cnf_transformation,[],[f5]) ).
fof(f8,plain,
( ~ q
| ~ q ),
inference(cnf_transformation,[],[f5]) ).
fof(f9,plain,
( p
| p ),
inference(cnf_transformation,[],[f5]) ).
fof(f12,plain,
( ~ p
| ~ p ),
inference(consistent_polarity_flipping,[],[f9]) ).
fof(f14,plain,
( p
| q
| q
| p ),
inference(consistent_polarity_flipping,[],[f6]) ).
fof(f15,plain,
( p
| q ),
inference(duplicate_literal_removal,[],[f14]) ).
fof(f16,plain,
~ q,
inference(duplicate_literal_removal,[],[f8]) ).
fof(f17,plain,
~ p,
inference(duplicate_literal_removal,[],[f12]) ).
fof(f19,definition,
( spl0_1
<=> q ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f23,definition,
( spl0_2
<=> p ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f26,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f15,f23,f19]) ).
fof(f28,plain,
~ spl0_1,
inference(avatar_split_clause,[],[f16,f19]) ).
fof(f29,plain,
~ spl0_2,
inference(avatar_split_clause,[],[f17,f23]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f26]) ).
cnf(s3,plain,
~ spl0_1,
inference(sat_conversion,[],[f28]) ).
cnf(s4,plain,
~ spl0_2,
inference(sat_conversion,[],[f29]) ).
cnf(s6,plain,
$false,
inference(rat,[],[s1,s4,s3]) ).
fof(f31,plain,
$false,
inference(avatar_sat_refutation,[],[s6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN046+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.17 % Computer : n003.cluster.edu
% 0.10/0.17 % Model : x86_64 x86_64
% 0.10/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17 % Memory : 8046.5625MB
% 0.10/0.17 % OS : Linux 6.8.0-71-generic
% 0.10/0.17 % CPULimit : 300
% 0.10/0.17 % WCLimit : 300
% 0.10/0.17 % DateTime : Mon Sep 28 15:24:58 UTC 2026
% 0.10/0.17 % CPUTime :
% 0.10/0.17 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.20 Running first-order model finding
% 0.10/0.20 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.10/0.23 % (1697759)Will run a generic schedule for satisfiability detection.
% 0.10/0.23 % (1697770)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=129640524:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.23 % (1697770) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1697759-1697770"...
% 0.10/0.23 % (1697770)...printing done.
% 0.10/0.23 % (1697770)Refutation found. Thanks to Tanya!
% 0.10/0.23 % SZS status Theorem for theBenchmark
% 0.10/0.23 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.23 % (1697770)------------------------------
% 0.10/0.23 % (1697770)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.23 % (1697770)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.23 % (1697770)CaDiCaL version: 2.1.3
% 0.10/0.23 % (1697770)Termination reason: Refutation
% 0.10/0.23 % (1697770)Time elapsed: 0.001 s
% 0.10/0.23 % (1697770)Peak memory usage: 12 MB
% 0.10/0.23 % (1697759)Success in time 0.025 s
% 0.10/0.23 % Vampire exiting
%------------------------------------------------------------------------------