%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN943+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 : n004.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 : 7
% Number of leaves : 1
% Syntax : Number of formulae : 15 ( 3 unt; 0 def)
% Number of atoms : 90 ( 0 equ)
% Maximal formula atoms : 14 ( 6 avg)
% Number of connectives : 106 ( 31 ~; 37 |; 30 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 36 ( 24 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0] :
? [X1,X2,X3,X4,X5] :
( ( p(X0)
& e(X0)
& ( e(X1)
=> ( g(X1)
| s(X1,f(X1)) ) )
& ( e(X2)
=> ( g(X2)
| c(f(X2)) ) )
& ( s(X0,X5)
=> p(X5) ) )
=> ( ( p(X3)
& g(X3) )
| ( p(X4)
& c(X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ! [X0] :
? [X1,X2,X3,X4,X5] :
( ( p(X0)
& e(X0)
& ( e(X1)
=> ( g(X1)
| s(X1,f(X1)) ) )
& ( e(X2)
=> ( g(X2)
| c(f(X2)) ) )
& ( s(X0,X5)
=> p(X5) ) )
=> ( ( p(X3)
& g(X3) )
| ( p(X4)
& c(X4) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
? [X0] :
! [X1,X2,X3,X4,X5] :
( ( ~ p(X3)
| ~ g(X3) )
& ( ~ p(X4)
| ~ c(X4) )
& p(X0)
& e(X0)
& ( g(X1)
| s(X1,f(X1))
| ~ e(X1) )
& ( g(X2)
| c(f(X2))
| ~ e(X2) )
& ( p(X5)
| ~ s(X0,X5) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
? [X0] :
! [X1,X2,X3,X4,X5] :
( ( ~ p(X3)
| ~ g(X3) )
& ( ~ p(X4)
| ~ c(X4) )
& p(X0)
& e(X0)
& ( g(X1)
| s(X1,f(X1))
| ~ e(X1) )
& ( g(X2)
| c(f(X2))
| ~ e(X2) )
& ( p(X5)
| ~ s(X0,X5) ) ),
inference(flattening,[],[f3]) ).
fof(f5,plain,
! [X1,X2,X3,X4,X5] :
( ( ~ p(X3)
| ~ g(X3) )
& ( ~ p(X4)
| ~ c(X4) )
& p(sK0)
& e(sK0)
& ( g(X1)
| s(X1,f(X1))
| ~ e(X1) )
& ( g(X2)
| c(f(X2))
| ~ e(X2) )
& ( p(X5)
| ~ s(sK0,X5) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f4]) ).
fof(f6,plain,
! [X5] :
( p(X5)
| ~ s(sK0,X5) ),
inference(cnf_transformation,[],[f5]) ).
fof(f7,plain,
! [X2] :
( g(X2)
| c(f(X2))
| ~ e(X2) ),
inference(cnf_transformation,[],[f5]) ).
fof(f8,plain,
! [X1] :
( g(X1)
| s(X1,f(X1))
| ~ e(X1) ),
inference(cnf_transformation,[],[f5]) ).
fof(f9,plain,
e(sK0),
inference(cnf_transformation,[],[f5]) ).
fof(f10,plain,
p(sK0),
inference(cnf_transformation,[],[f5]) ).
fof(f11,plain,
! [X0] :
( ~ p(X0)
| ~ c(X0) ),
inference(cnf_transformation,[],[f5]) ).
fof(f12,plain,
! [X0] :
( ~ p(X0)
| ~ g(X0) ),
inference(cnf_transformation,[],[f5]) ).
fof(f13,plain,
! [X1] :
( g(X1)
| ~ s(X1,f(X1))
| ~ e(X1) ),
inference(consistent_polarity_flipping,[],[f8]) ).
fof(f14,plain,
! [X5] :
( p(X5)
| s(sK0,X5) ),
inference(consistent_polarity_flipping,[],[f6]) ).
fof(f20,plain,
$false,
inference(finite_model_not_found_(exhaustively_excluded_all_possible_domain_size_assignments),[],[f12,f11,f10,f9,f13,f7,f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN943+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 : n004.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:07 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 % (525925)Will run a generic schedule for satisfiability detection.
% 0.20/0.27 % (525930)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=57253068_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.27 % TRYING [1]
% 0.20/0.27 % TRYING [2]
% 0.20/0.27 % (525930) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-525925-525930"...
% 0.20/0.27 % (525930)...printing done.
% 0.20/0.27 % (525930)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 % (525930)------------------------------
% 0.20/0.27 % (525930)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (525930)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (525930)CaDiCaL version: 2.1.3
% 0.20/0.27 % (525930)Termination reason: Refutation
% 0.20/0.27 % (525930)Time elapsed: 0.001 s
% 0.20/0.27 % (525930)Peak memory usage: 11 MB
% 0.20/0.27 % (525930)Instructions burned: 1 (million)
% 0.20/0.27 % (525925)Success in time 0.028 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------