%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN058+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 : 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:06:36 PM UTC 2026
% Result : Theorem 0.09s 0.25s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 48 ( 11 unt; 4 def)
% Number of atoms : 103 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 97 ( 42 ~; 31 |; 13 &)
% ( 4 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 5 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 34 ( 0 sgn 25 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( big_p(X0)
=> ! [X1] : big_q(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel28_1) ).
fof(f2,axiom,
( ! [X0] :
( big_q(X0)
| big_r(X0) )
=> ? [X1] :
( big_q(X1)
& big_s(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel28_2) ).
fof(f3,axiom,
( ? [X0] : big_s(X0)
=> ! [X1] :
( big_f(X1)
=> big_g(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel28_3) ).
fof(f4,conjecture,
! [X0] :
( ( big_p(X0)
& big_f(X0) )
=> big_g(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel28) ).
fof(f5,negated_conjecture,
~ ! [X0] :
( ( big_p(X0)
& big_f(X0) )
=> big_g(X0) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
fof(f6,plain,
( ! [X0] : big_q(X0)
=> ? [X1] :
( big_q(X1)
& big_s(X1) ) ),
inference(pure_predicate_removal,[],[f2]) ).
fof(f7,plain,
! [X0] :
( ! [X1] : big_q(X1)
| ~ big_p(X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f8,plain,
( ? [X1] :
( big_q(X1)
& big_s(X1) )
| ? [X0] : ~ big_q(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f9,plain,
( ! [X1] :
( big_g(X1)
| ~ big_f(X1) )
| ! [X0] : ~ big_s(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f10,plain,
? [X0] :
( ~ big_g(X0)
& big_p(X0)
& big_f(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f11,plain,
? [X0] :
( ~ big_g(X0)
& big_p(X0)
& big_f(X0) ),
inference(flattening,[],[f10]) ).
fof(f12,plain,
( ? [X0] :
( big_q(X0)
& big_s(X0) )
| ? [X1] : ~ big_q(X1) ),
inference(rectify,[],[f8]) ).
fof(f13,plain,
( ( big_q(sK0)
& big_s(sK0) )
| ~ big_q(sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f12]) ).
fof(f14,plain,
( ! [X0] :
( big_g(X0)
| ~ big_f(X0) )
| ! [X1] : ~ big_s(X1) ),
inference(rectify,[],[f9]) ).
fof(f15,plain,
( ~ big_g(sK2)
& big_p(sK2)
& big_f(sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X0,sK2)],[f11]) ).
fof(f16,plain,
! [X0,X1] :
( big_q(X1)
| ~ big_p(X0) ),
inference(cnf_transformation,[],[f7]) ).
fof(f17,plain,
( big_s(sK0)
| ~ big_q(sK1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f19,plain,
! [X0,X1] :
( big_g(X0)
| ~ big_f(X0)
| ~ big_s(X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f20,plain,
big_f(sK2),
inference(cnf_transformation,[],[f15]) ).
fof(f21,plain,
big_p(sK2),
inference(cnf_transformation,[],[f15]) ).
fof(f22,plain,
~ big_g(sK2),
inference(cnf_transformation,[],[f15]) ).
fof(f24,definition,
( spl3_1
<=> ! [X0] : ~ big_p(X0) ),
introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).
fof(f25,plain,
( ! [X0] : ~ big_p(X0)
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f24]) ).
fof(f27,definition,
( spl3_2
<=> ! [X1] : big_q(X1) ),
introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).
fof(f28,plain,
( ! [X1] : big_q(X1)
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f27]) ).
fof(f29,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f16,f27,f24]) ).
fof(f30,plain,
( $false
| ~ spl3_1 ),
inference(resolution,[],[f25,f21]) ).
fof(f31,plain,
~ spl3_1,
inference(avatar_contradiction_clause,[],[f30]) ).
fof(f32,plain,
( big_s(sK0)
| ~ spl3_2 ),
inference(forward_subsumption_resolution,[],[f17,f28]) ).
fof(f34,definition,
( spl3_3
<=> ! [X1] : ~ big_s(X1) ),
introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition]) ).
fof(f35,plain,
( ! [X1] : ~ big_s(X1)
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f34]) ).
fof(f43,definition,
( spl3_6
<=> ! [X0] :
( big_g(X0)
| ~ big_f(X0) ) ),
introduced(definition,[new_symbols(definition,[spl3_6])],[avatar_definition]) ).
fof(f44,plain,
( ! [X0] :
( ~ big_f(X0)
| big_g(X0) )
| ~ spl3_6 ),
inference(avatar_component_clause,[],[f43]) ).
fof(f45,plain,
( spl3_3
| spl3_6 ),
inference(avatar_split_clause,[],[f19,f43,f34]) ).
fof(f46,plain,
( $false
| ~ spl3_2
| ~ spl3_3 ),
inference(resolution,[],[f35,f32]) ).
fof(f47,plain,
( ~ spl3_2
| ~ spl3_3 ),
inference(avatar_contradiction_clause,[],[f46]) ).
fof(f52,plain,
( big_g(sK2)
| ~ spl3_6 ),
inference(resolution,[],[f44,f20]) ).
fof(f53,plain,
( $false
| ~ spl3_6 ),
inference(forward_subsumption_resolution,[],[f52,f22]) ).
fof(f54,plain,
~ spl3_6,
inference(avatar_contradiction_clause,[],[f53]) ).
cnf(s12,plain,
( spl3_1
| spl3_2 ),
inference(sat_conversion,[],[f29]) ).
cnf(s15,plain,
~ spl3_1,
inference(sat_conversion,[],[f31]) ).
cnf(s21,plain,
( spl3_3
| spl3_6 ),
inference(sat_conversion,[],[f45]) ).
cnf(s26,plain,
( ~ spl3_2
| ~ spl3_3 ),
inference(sat_conversion,[],[f47]) ).
cnf(s33,plain,
~ spl3_6,
inference(sat_conversion,[],[f54]) ).
cnf(s34,plain,
spl3_3,
inference(rat,[],[s21,s33]) ).
cnf(s35,plain,
~ spl3_2,
inference(rat,[],[s26,s34]) ).
cnf(s36,plain,
$false,
inference(rat,[],[s12,s35,s15]) ).
fof(f55,plain,
$false,
inference(avatar_sat_refutation,[],[s36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN058+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.09/0.19 % Computer : n008.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 15:27:40 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 Running first-order model finding
% 0.09/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.09/0.25 % (2336950)Will run a generic schedule for satisfiability detection.
% 0.09/0.25 % (2336957)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2008201330:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.25 % (2336957) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2336950-2336957"...
% 0.09/0.25 % (2336957)...printing done.
% 0.09/0.25 % (2336956)% WARNING: option uhcvi not known.
% 0.09/0.25 % (2336957)Refutation found. Thanks to Tanya!
% 0.09/0.25 % SZS status Theorem for theBenchmark
% 0.09/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.26 % (2336957)------------------------------
% 0.09/0.26 % (2336957)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.26 % (2336957)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.26 % (2336957)CaDiCaL version: 2.1.3
% 0.09/0.26 % (2336957)Termination reason: Refutation
% 0.09/0.26 % (2336957)Time elapsed: 0.001 s
% 0.09/0.26 % (2336957)Peak memory usage: 12 MB
% 0.09/0.26 % (2336957)Instructions burned: 1 (million)
% 0.09/0.26 % (2336950)Success in time 0.032 s
% 0.09/0.26 % Vampire exiting
%------------------------------------------------------------------------------