%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN979+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 : n002.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:23:00 PM UTC 2026
% Result : Theorem 0.07s 0.24s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 8 unt; 2 def)
% Number of atoms : 70 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 68 ( 17 ~; 11 |; 30 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 3 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 22 ( 0 sgn 14 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0,X1] :
? [X2,X3] :
( ( ( q(X2)
=> p(X2,X0) )
& q(X0)
& q(X1)
& ( r(X3)
=> p(X1,X3) )
& r(X0)
& r(X1)
& ( s(X0)
=> p(X2,X3) )
& s(X0) )
=> p(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ! [X0,X1] :
? [X2,X3] :
( ( ( q(X2)
=> p(X2,X0) )
& q(X0)
& q(X1)
& ( r(X3)
=> p(X1,X3) )
& r(X0)
& r(X1)
& ( s(X0)
=> p(X2,X3) )
& s(X0) )
=> p(X0,X1) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
? [X0,X1] :
! [X2,X3] :
( ~ p(X0,X1)
& ( p(X2,X0)
| ~ q(X2) )
& q(X0)
& q(X1)
& ( p(X1,X3)
| ~ r(X3) )
& r(X0)
& r(X1)
& ( p(X2,X3)
| ~ s(X0) )
& s(X0) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
? [X0,X1] :
! [X2,X3] :
( ~ p(X0,X1)
& ( p(X2,X0)
| ~ q(X2) )
& q(X0)
& q(X1)
& ( p(X1,X3)
| ~ r(X3) )
& r(X0)
& r(X1)
& ( p(X2,X3)
| ~ s(X0) )
& s(X0) ),
inference(flattening,[],[f3]) ).
fof(f7,plain,
! [X2,X3] :
( ~ s(sK0)
| p(X2,X3) ),
inference(cnf_transformation,[],[f4]) ).
fof(f8,plain,
s(sK0),
inference(cnf_transformation,[],[f4]) ).
fof(f13,plain,
~ p(sK0,sK1),
inference(cnf_transformation,[],[f4]) ).
fof(f15,definition,
( spl2_1
<=> ! [X2,X3] : p(X2,X3) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
fof(f16,plain,
( ! [X2,X3] : p(X2,X3)
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f15]) ).
fof(f18,definition,
( spl2_2
<=> s(sK0) ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
fof(f21,plain,
( spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f7,f18,f15]) ).
fof(f22,plain,
spl2_2,
inference(avatar_split_clause,[],[f8,f18]) ).
fof(f23,plain,
( $false
| ~ spl2_1 ),
inference(resolution,[],[f16,f13]) ).
fof(f24,plain,
~ spl2_1,
inference(avatar_contradiction_clause,[],[f23]) ).
cnf(s1,plain,
( spl2_1
| ~ spl2_2 ),
inference(sat_conversion,[],[f21]) ).
cnf(s2,plain,
spl2_2,
inference(sat_conversion,[],[f22]) ).
cnf(s3,plain,
~ spl2_1,
inference(sat_conversion,[],[f24]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s2,s3]) ).
fof(f25,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN979+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.07/0.18 % Computer : n002.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Mon Sep 28 17:20:52 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21 Running first-order model finding
% 0.07/0.21 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.07/0.24 % (526313)Will run a generic schedule for satisfiability detection.
% 0.07/0.24 % (526322)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4261447165:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.07/0.24 % (526322) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-526313-526322"...
% 0.07/0.24 % (526322)...printing done.
% 0.07/0.24 % (526322)Refutation found. Thanks to Tanya!
% 0.07/0.24 % SZS status Theorem for theBenchmark
% 0.07/0.24 % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.24 % (526322)------------------------------
% 0.07/0.24 % (526322)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.24 % (526322)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.24 % (526322)CaDiCaL version: 2.1.3
% 0.07/0.24 % (526322)Termination reason: Refutation
% 0.07/0.24 % (526322)Time elapsed: 0.001 s
% 0.07/0.24 % (526322)Peak memory usage: 12 MB
% 0.07/0.24 % (526313)Success in time 0.024 s
% 0.07/0.24 % Vampire exiting
%------------------------------------------------------------------------------