%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN058-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n006.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 : Unsatisfiable 0.21s 0.27s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 43 ( 13 unt; 6 def)
% Number of atoms : 78 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 72 ( 37 ~; 29 |; 0 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 7 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 12 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ big_p(X0)
| big_q(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
fof(f3,axiom,
( ~ big_q(b)
| big_s(c) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
fof(f6,axiom,
! [X0,X1] :
( ~ big_s(X0)
| ~ big_f(X1)
| big_g(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
fof(f7,negated_conjecture,
big_p(d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
fof(f8,negated_conjecture,
big_f(d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).
fof(f9,negated_conjecture,
~ big_g(d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).
fof(f11,definition,
( spl0_1
<=> ! [X1] :
( ~ big_f(X1)
| big_g(X1) ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f12,plain,
( ! [X1] :
( big_g(X1)
| ~ big_f(X1) )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f11]) ).
fof(f14,definition,
( spl0_2
<=> ! [X0] : ~ big_s(X0) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f15,plain,
( ! [X0] : ~ big_s(X0)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f14]) ).
fof(f16,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f6,f14,f11]) ).
fof(f18,definition,
( spl0_3
<=> big_s(c) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f20,plain,
( big_s(c)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f18]) ).
fof(f22,definition,
( spl0_4
<=> big_q(b) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f24,plain,
( ~ big_q(b)
| spl0_4 ),
inference(avatar_component_clause,[],[f22]) ).
fof(f25,plain,
( spl0_3
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f3,f22,f18]) ).
fof(f27,definition,
( spl0_5
<=> ! [X1] : big_q(X1) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f28,plain,
( ! [X1] : big_q(X1)
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f27]) ).
fof(f30,definition,
( spl0_6
<=> ! [X0] : ~ big_p(X0) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f31,plain,
( ! [X0] : ~ big_p(X0)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f30]) ).
fof(f32,plain,
( spl0_5
| spl0_6 ),
inference(avatar_split_clause,[],[f1,f30,f27]) ).
fof(f33,plain,
( $false
| spl0_4
| ~ spl0_5 ),
inference(resolution,[],[f28,f24]) ).
fof(f34,plain,
( spl0_4
| ~ spl0_5 ),
inference(avatar_contradiction_clause,[],[f33]) ).
fof(f35,plain,
( $false
| ~ spl0_6 ),
inference(resolution,[],[f31,f7]) ).
fof(f36,plain,
~ spl0_6,
inference(avatar_contradiction_clause,[],[f35]) ).
fof(f37,plain,
( $false
| ~ spl0_2
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f20,f15]) ).
fof(f38,plain,
( ~ spl0_2
| ~ spl0_3 ),
inference(avatar_contradiction_clause,[],[f37]) ).
fof(f39,plain,
( ~ big_f(d)
| ~ spl0_1 ),
inference(resolution,[],[f12,f9]) ).
fof(f40,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f39,f8]) ).
fof(f41,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f40]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f16]) ).
cnf(s2,plain,
( spl0_3
| ~ spl0_4 ),
inference(sat_conversion,[],[f25]) ).
cnf(s3,plain,
( spl0_5
| spl0_6 ),
inference(sat_conversion,[],[f32]) ).
cnf(s4,plain,
( spl0_4
| ~ spl0_5 ),
inference(sat_conversion,[],[f34]) ).
cnf(s5,plain,
~ spl0_6,
inference(sat_conversion,[],[f36]) ).
cnf(s6,plain,
( ~ spl0_2
| ~ spl0_3 ),
inference(sat_conversion,[],[f38]) ).
cnf(s7,plain,
~ spl0_1,
inference(sat_conversion,[],[f41]) ).
cnf(s8,plain,
spl0_5,
inference(rat,[],[s3,s5]) ).
cnf(s9,plain,
spl0_4,
inference(rat,[],[s4,s8]) ).
cnf(s10,plain,
spl0_3,
inference(rat,[],[s2,s9]) ).
cnf(s11,plain,
~ spl0_2,
inference(rat,[],[s6,s10]) ).
cnf(s12,plain,
$false,
inference(rat,[],[s1,s11,s7]) ).
fof(f42,plain,
$false,
inference(avatar_sat_refutation,[],[s12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN058-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n006.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:26:55 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.22 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.21/0.27 % (4051812)Will run a generic schedule for satisfiability detection.
% 0.21/0.27 % (4051828)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3025050122:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.27 % (4051828) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4051812-4051828"...
% 0.21/0.27 % (4051828)...printing done.
% 0.21/0.27 % (4051828)Refutation found. Thanks to Tanya!
% 0.21/0.27 % SZS status Unsatisfiable for theBenchmark
% 0.21/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.27 % (4051828)------------------------------
% 0.21/0.27 % (4051828)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.27 % (4051828)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.27 % (4051828)CaDiCaL version: 2.1.3
% 0.21/0.27 % (4051828)Termination reason: Refutation
% 0.21/0.27 % (4051828)Time elapsed: 0.001 s
% 0.21/0.27 % (4051828)Peak memory usage: 12 MB
% 0.21/0.27 % (4051828)Instructions burned: 1 (million)
% 0.21/0.27 % (4051812)Success in time 0.036 s
% 0.21/0.27 % Vampire exiting
%------------------------------------------------------------------------------