%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN044+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 : n018.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:30 PM UTC 2026
% Result : Theorem 0.12s 0.25s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 5 unt; 3 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 64 ( 25 ~; 28 |; 2 &)
% ( 5 <=>; 3 =>; 0 <=; 1 <~>)
% Maximal formula depth : 4 ( 3 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,axiom,
( q
=> r ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel10_1) ).
fof(f2,axiom,
( r
=> ( p
& q ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel10_2) ).
fof(f3,axiom,
( p
=> ( q
| r ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel10_3) ).
fof(f4,conjecture,
( p
<=> q ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel10) ).
fof(f5,negated_conjecture,
~ ( p
<=> q ),
inference(negated_conjecture,[status(cth)],[f4]) ).
fof(f6,plain,
( r
| ~ q ),
inference(ennf_transformation,[],[f1]) ).
fof(f7,plain,
( ( p
& q )
| ~ r ),
inference(ennf_transformation,[],[f2]) ).
fof(f8,plain,
( q
| r
| ~ p ),
inference(ennf_transformation,[],[f3]) ).
fof(f9,plain,
( q
| r
| ~ p ),
inference(flattening,[],[f8]) ).
fof(f10,plain,
( p
<~> q ),
inference(ennf_transformation,[],[f5]) ).
fof(f11,plain,
( ~ q
| r ),
inference(cnf_transformation,[],[f6]) ).
fof(f12,plain,
( ~ r
| q ),
inference(cnf_transformation,[],[f7]) ).
fof(f13,plain,
( ~ r
| p ),
inference(cnf_transformation,[],[f7]) ).
fof(f14,plain,
( ~ p
| r
| q ),
inference(cnf_transformation,[],[f9]) ).
fof(f15,plain,
( q
| p ),
inference(cnf_transformation,[],[f10]) ).
fof(f16,plain,
( ~ q
| ~ p ),
inference(cnf_transformation,[],[f10]) ).
fof(f18,definition,
( spl0_1
<=> p ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f22,definition,
( spl0_2
<=> q ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f25,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f15,f22,f18]) ).
fof(f26,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f16,f22,f18]) ).
fof(f28,definition,
( spl0_3
<=> r ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f31,plain,
( spl0_2
| spl0_3
| ~ spl0_1 ),
inference(avatar_split_clause,[],[f14,f18,f28,f22]) ).
fof(f32,plain,
( spl0_2
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f12,f28,f22]) ).
fof(f33,plain,
( spl0_1
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f13,f28,f18]) ).
fof(f34,plain,
( spl0_3
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f11,f22,f28]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f25]) ).
cnf(s2,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f26]) ).
cnf(s3,plain,
( ~ spl0_1
| spl0_2
| spl0_3 ),
inference(sat_conversion,[],[f31]) ).
cnf(s4,plain,
( spl0_2
| ~ spl0_3 ),
inference(sat_conversion,[],[f32]) ).
cnf(s5,plain,
( spl0_1
| ~ spl0_3 ),
inference(sat_conversion,[],[f33]) ).
cnf(s6,plain,
( ~ spl0_2
| spl0_3 ),
inference(sat_conversion,[],[f34]) ).
cnf(s7,plain,
spl0_1,
inference(rat,[],[s6,s1,s5]) ).
cnf(s8,plain,
~ spl0_2,
inference(rat,[],[s2,s7]) ).
cnf(s9,plain,
~ spl0_3,
inference(rat,[],[s4,s8]) ).
cnf(s10,plain,
$false,
inference(rat,[],[s3,s7,s9,s8]) ).
fof(f35,plain,
$false,
inference(avatar_sat_refutation,[],[s10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN044+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.12/0.19 % Computer : n018.cluster.edu
% 0.12/0.19 % Model : x86_64 x86_64
% 0.12/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.19 % Memory : 8046.5625MB
% 0.12/0.19 % OS : Linux 6.8.0-71-generic
% 0.12/0.19 % CPULimit : 300
% 0.12/0.19 % WCLimit : 300
% 0.12/0.19 % DateTime : Mon Sep 28 15:26:10 UTC 2026
% 0.12/0.19 % CPUTime :
% 0.12/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.23 Running first-order model finding
% 0.12/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.12/0.25 % (3482464)Will run a generic schedule for satisfiability detection.
% 0.12/0.25 % (3482479)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2136216189:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.12/0.25 % (3482479) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3482464-3482479"...
% 0.12/0.25 % (3482479)...printing done.
% 0.12/0.25 % (3482479)Refutation found. Thanks to Tanya!
% 0.12/0.25 % SZS status Theorem for theBenchmark
% 0.12/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.25 % (3482479)------------------------------
% 0.12/0.25 % (3482479)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.25 % (3482479)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.25 % (3482479)CaDiCaL version: 2.1.3
% 0.12/0.25 % (3482479)Termination reason: Refutation
% 0.12/0.25 % (3482479)Time elapsed: 0.001 s
% 0.12/0.25 % (3482479)Peak memory usage: 12 MB
% 0.12/0.25 % (3482464)Success in time 0.016 s
% 0.12/0.25 % Vampire exiting
%------------------------------------------------------------------------------