%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN941+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 : 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:22:55 PM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 12 ( 2 unt; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 7 ( 4 avg)
% Number of connectives : 58 ( 22 ~; 18 |; 12 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 24 ( 18 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0,X1] :
( q(f(X0))
=> ? [X2,X3] :
( ( p(f(X3))
=> ( p(X2)
& ( r(X3)
=> ( r(X0)
& r(X1) ) ) ) )
& q(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ! [X0,X1] :
( q(f(X0))
=> ? [X2,X3] :
( ( p(f(X3))
=> ( p(X2)
& ( r(X3)
=> ( r(X0)
& r(X1) ) ) ) )
& q(X2) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
? [X0,X1] :
( ! [X2,X3] :
( ( ( ~ p(X2)
| ( ( ~ r(X0)
| ~ r(X1) )
& r(X3) ) )
& p(f(X3)) )
| ~ q(X2) )
& q(f(X0)) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
( ! [X2,X3] :
( ( ( ~ p(X2)
| ( ( ~ r(sK0)
| ~ r(sK1) )
& r(X3) ) )
& p(f(X3)) )
| ~ q(X2) )
& q(f(sK0)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f3]) ).
fof(f5,plain,
q(f(sK0)),
inference(cnf_transformation,[],[f4]) ).
fof(f6,plain,
! [X2,X3] :
( p(f(X3))
| ~ q(X2) ),
inference(cnf_transformation,[],[f4]) ).
fof(f7,plain,
! [X2,X3] :
( ~ p(X2)
| r(X3)
| ~ q(X2) ),
inference(cnf_transformation,[],[f4]) ).
fof(f8,plain,
! [X2] :
( ~ p(X2)
| ~ r(sK0)
| ~ r(sK1)
| ~ q(X2) ),
inference(cnf_transformation,[],[f4]) ).
fof(f9,plain,
! [X2] :
( p(X2)
| ~ r(sK0)
| ~ r(sK1)
| ~ q(X2) ),
inference(consistent_polarity_flipping,[],[f8]) ).
fof(f10,plain,
! [X2,X3] :
( p(X2)
| r(X3)
| ~ q(X2) ),
inference(consistent_polarity_flipping,[],[f7]) ).
fof(f11,plain,
! [X2,X3] :
( ~ p(f(X3))
| ~ q(X2) ),
inference(consistent_polarity_flipping,[],[f6]) ).
fof(f28,plain,
$false,
inference(finite_model_not_found_(exhaustively_excluded_all_possible_domain_size_assignments),[],[f9,f10,f11,f5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN941+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.09/0.20 % Computer : n006.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Mon Sep 28 17:15:16 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/0.23 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.20/0.27 % (4120902)Will run a generic schedule for satisfiability detection.
% 0.20/0.27 % (4120907)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2430405135_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.27 % TRYING [1]
% 0.20/0.27 % TRYING [2]
% 0.20/0.27 % (4120907) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4120902-4120907"...
% 0.20/0.27 % (4120907)...printing done.
% 0.20/0.27 % (4120907)Refutation found. Thanks to Tanya!
% 0.20/0.27 % SZS status Theorem for theBenchmark
% 0.20/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.27 % (4120907)------------------------------
% 0.20/0.27 % (4120907)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (4120907)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (4120907)CaDiCaL version: 2.1.3
% 0.20/0.27 % (4120907)Termination reason: Refutation
% 0.20/0.27 % (4120907)Time elapsed: 0.001 s
% 0.20/0.27 % (4120907)Peak memory usage: 11 MB
% 0.20/0.27 % (4120907)Instructions burned: 1 (million)
% 0.20/0.27 % (4120902)Success in time 0.031 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------