%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN922+1 : TPTP v9.3.1. Released v3.1.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:22:52 PM UTC 2026
% Result : Theorem 0.09s 0.26s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 1 unt; 0 def)
% Number of atoms : 73 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 84 ( 30 ~; 30 |; 20 &)
% ( 3 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 6 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 49 ( 40 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ! [X0] :
( p(X0)
& q(X0) )
<=> ( ! [X0] : p(X0)
& ! [X0] : q(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ( ! [X0] :
( p(X0)
& q(X0) )
<=> ( ! [X0] : p(X0)
& ! [X0] : q(X0) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
~ ( ! [X0] :
( p(X0)
& q(X0) )
<=> ( ! [X1] : p(X1)
& ! [X2] : q(X2) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ! [X0] :
( p(X0)
& q(X0) )
<~> ( ! [X1] : p(X1)
& ! [X2] : q(X2) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ( ? [X1] : ~ p(X1)
| ? [X2] : ~ q(X2)
| ? [X0] :
( ~ p(X0)
| ~ q(X0) ) )
& ( ( ! [X1] : p(X1)
& ! [X2] : q(X2) )
| ! [X0] :
( p(X0)
& q(X0) ) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f6,plain,
( ( ? [X1] : ~ p(X1)
| ? [X2] : ~ q(X2)
| ? [X0] :
( ~ p(X0)
| ~ q(X0) ) )
& ( ( ! [X1] : p(X1)
& ! [X2] : q(X2) )
| ! [X0] :
( p(X0)
& q(X0) ) ) ),
inference(flattening,[],[f5]) ).
fof(f7,plain,
( ( ? [X0] : ~ p(X0)
| ? [X1] : ~ q(X1)
| ? [X2] :
( ~ p(X2)
| ~ q(X2) ) )
& ( ( ! [X3] : p(X3)
& ! [X4] : q(X4) )
| ! [X5] :
( p(X5)
& q(X5) ) ) ),
inference(rectify,[],[f6]) ).
fof(f8,plain,
( ( ~ p(sK0)
| ~ q(sK1)
| ~ p(sK2)
| ~ q(sK2) )
& ( ( ! [X3] : p(X3)
& ! [X4] : q(X4) )
| ! [X5] :
( p(X5)
& q(X5) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f7]) ).
fof(f9,plain,
! [X4,X5] :
( q(X4)
| q(X5) ),
inference(cnf_transformation,[],[f8]) ).
fof(f10,plain,
! [X4,X5] :
( q(X4)
| p(X5) ),
inference(cnf_transformation,[],[f8]) ).
fof(f11,plain,
! [X3,X5] :
( p(X3)
| q(X5) ),
inference(cnf_transformation,[],[f8]) ).
fof(f12,plain,
! [X3,X5] :
( p(X3)
| p(X5) ),
inference(cnf_transformation,[],[f8]) ).
fof(f13,plain,
( ~ p(sK0)
| ~ q(sK1)
| ~ p(sK2)
| ~ q(sK2) ),
inference(cnf_transformation,[],[f8]) ).
fof(f14,plain,
( p(sK0)
| q(sK1)
| p(sK2)
| q(sK2) ),
inference(consistent_polarity_flipping,[],[f13]) ).
fof(f15,plain,
! [X3,X5] :
( ~ p(X3)
| ~ p(X5) ),
inference(consistent_polarity_flipping,[],[f12]) ).
fof(f16,plain,
! [X3,X5] :
( ~ p(X3)
| ~ q(X5) ),
inference(consistent_polarity_flipping,[],[f11]) ).
fof(f17,plain,
! [X4,X5] :
( ~ q(X4)
| ~ p(X5) ),
inference(consistent_polarity_flipping,[],[f10]) ).
fof(f18,plain,
! [X4,X5] :
( ~ q(X4)
| ~ q(X5) ),
inference(consistent_polarity_flipping,[],[f9]) ).
fof(f34,plain,
$false,
inference(finite_model_not_found_(exhaustively_excluded_all_possible_domain_size_assignments),[],[f14,f15,f16,f17,f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN922+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n014.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 17:12:31 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.09/0.26 % (1925225)Will run a generic schedule for satisfiability detection.
% 0.09/0.26 % (1925230)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1660324285_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.26 % Detected minimum model sizes of [1]
% 0.09/0.26 % Detected maximum model sizes of [3]
% 0.09/0.26 % TRYING [1]
% 0.09/0.26 % TRYING [2]
% 0.09/0.26 % TRYING [3]
% 0.09/0.26 % (1925230) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1925225-1925230"...
% 0.09/0.26 % (1925230)...printing done.
% 0.09/0.26 % (1925230)Refutation found. Thanks to Tanya!
% 0.09/0.26 % SZS status Theorem for theBenchmark
% 0.09/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.26 % (1925230)------------------------------
% 0.09/0.26 % (1925230)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.26 % (1925230)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.26 % (1925230)CaDiCaL version: 2.1.3
% 0.09/0.26 % (1925230)Termination reason: Refutation
% 0.09/0.26 % (1925230)Time elapsed: 0.001 s
% 0.09/0.26 % (1925230)Peak memory usage: 11 MB
% 0.09/0.26 % (1925230)Instructions burned: 1 (million)
% 0.09/0.26 % (1925225)Success in time 0.03 s
% 0.09/0.26 % Vampire exiting
%------------------------------------------------------------------------------