%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN358+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 : n014.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:07:28 PM UTC 2026
% Result : Theorem 0.08s 0.24s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 15 ( 1 unt; 0 def)
% Number of atoms : 65 ( 0 equ)
% Maximal formula atoms : 8 ( 4 avg)
% Number of connectives : 76 ( 26 ~; 26 |; 20 &)
% ( 3 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 26 ( 12 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ? [X0] :
( p
& big_q(X0) )
<=> ( p
& ? [X0] : big_q(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2109) ).
fof(f2,negated_conjecture,
~ ( ? [X0] :
( p
& big_q(X0) )
<=> ( p
& ? [X0] : big_q(X0) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
~ ( ? [X0] :
( p
& big_q(X0) )
<=> ( p
& ? [X1] : big_q(X1) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ? [X0] :
( p
& big_q(X0) )
<~> ( p
& ? [X1] : big_q(X1) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ( ~ p
| ! [X1] : ~ big_q(X1)
| ! [X0] :
( ~ p
| ~ big_q(X0) ) )
& ( ( p
& ? [X1] : big_q(X1) )
| ? [X0] :
( p
& big_q(X0) ) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f6,plain,
( ( ~ p
| ! [X1] : ~ big_q(X1)
| ! [X0] :
( ~ p
| ~ big_q(X0) ) )
& ( ( p
& ? [X1] : big_q(X1) )
| ? [X0] :
( p
& big_q(X0) ) ) ),
inference(flattening,[],[f5]) ).
fof(f7,plain,
( ( ~ p
| ! [X0] : ~ big_q(X0)
| ! [X1] :
( ~ p
| ~ big_q(X1) ) )
& ( ( p
& ? [X2] : big_q(X2) )
| ? [X3] :
( p
& big_q(X3) ) ) ),
inference(rectify,[],[f6]) ).
fof(f8,plain,
( ( ~ p
| ! [X0] : ~ big_q(X0)
| ! [X1] :
( ~ p
| ~ big_q(X1) ) )
& ( ( p
& big_q(sK0) )
| ( p
& big_q(sK1) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X2,sK0),skolemize(X3,sK1)],[f7]) ).
fof(f9,plain,
( big_q(sK0)
| big_q(sK1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f12,plain,
( p
| p ),
inference(cnf_transformation,[],[f8]) ).
fof(f13,plain,
! [X0,X1] :
( ~ p
| ~ big_q(X0)
| ~ p
| ~ big_q(X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f14,plain,
! [X0,X1] :
( p
| big_q(X0)
| p
| big_q(X1) ),
inference(consistent_polarity_flipping,[],[f13]) ).
fof(f15,plain,
( ~ p
| ~ p ),
inference(consistent_polarity_flipping,[],[f12]) ).
fof(f16,plain,
( ~ big_q(sK0)
| ~ big_q(sK1) ),
inference(consistent_polarity_flipping,[],[f9]) ).
fof(f22,plain,
$false,
inference(finite_model_not_found_(exhaustively_excluded_all_possible_domain_size_assignments),[],[f14,f15,f16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN358+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.08/0.17 % Computer : n014.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Mon Sep 28 15:48:01 UTC 2026
% 0.08/0.17 % CPUTime :
% 0.08/0.17 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20 Running first-order model finding
% 0.08/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.08/0.24 % (1884752)Will run a generic schedule for satisfiability detection.
% 0.08/0.24 % (1884757)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3162361937_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.24 % Detected minimum model sizes of [1]
% 0.08/0.24 % Detected maximum model sizes of [2]
% 0.08/0.24 % TRYING [1]
% 0.08/0.24 % TRYING [2]
% 0.08/0.24 % (1884757) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1884752-1884757"...
% 0.08/0.24 % (1884757)...printing done.
% 0.08/0.24 % (1884757)Refutation found. Thanks to Tanya!
% 0.08/0.24 % SZS status Theorem for theBenchmark
% 0.08/0.24 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.24 % (1884757)------------------------------
% 0.08/0.24 % (1884757)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.24 % (1884757)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.24 % (1884757)CaDiCaL version: 2.1.3
% 0.08/0.24 % (1884757)Termination reason: Refutation
% 0.08/0.24 % (1884757)Time elapsed: 0.001 s
% 0.08/0.24 % (1884757)Peak memory usage: 11 MB
% 0.08/0.24 % (1884752)Success in time 0.025 s
% 0.08/0.24 % Vampire exiting
%------------------------------------------------------------------------------