%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN050+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 : n017.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:33 PM UTC 2026
% Result : Theorem 0.25s 0.33s
% Output : Refutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 14 ( 5 unt; 0 def)
% Number of atoms : 54 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 60 ( 20 ~; 11 |; 20 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 54 ( 39 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ! [X0,X1] :
? [X2] :
! [X3] :
( ( big_p(X0)
& big_q(X1) )
=> ( big_r(X2)
& big_s(X3) ) )
=> ? [X4,X5] :
( ( big_p(X4)
& big_q(X5) )
=> ? [X6] : big_r(X6) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel20) ).
fof(f2,negated_conjecture,
~ ( ! [X0,X1] :
? [X2] :
! [X3] :
( ( big_p(X0)
& big_q(X1) )
=> ( big_r(X2)
& big_s(X3) ) )
=> ? [X4,X5] :
( ( big_p(X4)
& big_q(X5) )
=> ? [X6] : big_r(X6) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
~ ( ! [X0,X1] :
? [X2] :
! [X3] :
( ( big_p(X0)
& big_q(X1) )
=> big_r(X2) )
=> ? [X4,X5] :
( ( big_p(X4)
& big_q(X5) )
=> ? [X6] : big_r(X6) ) ),
inference(pure_predicate_removal,[],[f2]) ).
fof(f4,plain,
( ! [X4,X5] :
( ! [X6] : ~ big_r(X6)
& big_p(X4)
& big_q(X5) )
& ! [X0,X1] :
? [X2] :
! [X3] :
( big_r(X2)
| ~ big_p(X0)
| ~ big_q(X1) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ! [X4,X5] :
( ! [X6] : ~ big_r(X6)
& big_p(X4)
& big_q(X5) )
& ! [X0,X1] :
? [X2] :
! [X3] :
( big_r(X2)
| ~ big_p(X0)
| ~ big_q(X1) ) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
( ! [X0,X1] :
( ! [X2] : ~ big_r(X2)
& big_p(X0)
& big_q(X1) )
& ! [X3,X4] :
? [X5] :
( big_r(X5)
| ~ big_p(X3)
| ~ big_q(X4) ) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
( ! [X0,X1] :
( ! [X2] : ~ big_r(X2)
& big_p(X0)
& big_q(X1) )
& ! [X3,X4] :
( big_r(sK0(X3,X4))
| ~ big_p(X3)
| ~ big_q(X4) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X5,sK0(X3,X4))],[f6]) ).
fof(f8,plain,
! [X3,X4] :
( big_r(sK0(X3,X4))
| ~ big_p(X3)
| ~ big_q(X4) ),
inference(cnf_transformation,[],[f7]) ).
fof(f9,plain,
! [X1] : big_q(X1),
inference(cnf_transformation,[],[f7]) ).
fof(f10,plain,
! [X0] : big_p(X0),
inference(cnf_transformation,[],[f7]) ).
fof(f11,plain,
! [X2] : ~ big_r(X2),
inference(cnf_transformation,[],[f7]) ).
fof(f12,plain,
! [X3,X4] :
( ~ big_p(X3)
| ~ big_q(X4) ),
inference(forward_subsumption_resolution,[],[f8,f11]) ).
fof(f13,plain,
! [X4] : ~ big_q(X4),
inference(forward_subsumption_resolution,[],[f12,f10]) ).
fof(f14,plain,
$false,
inference(forward_subsumption_resolution,[],[f13,f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN050+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.07 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.23 % Computer : n017.cluster.edu
% 0.11/0.23 % Model : x86_64 x86_64
% 0.11/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.23 % Memory : 8046.5625MB
% 0.11/0.23 % OS : Linux 6.8.0-71-generic
% 0.11/0.23 % CPULimit : 300
% 0.11/0.23 % WCLimit : 300
% 0.11/0.23 % DateTime : Mon Sep 28 15:22:06 UTC 2026
% 0.11/0.24 % CPUTime :
% 0.11/0.24 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.25/0.29 Running first-order model finding
% 0.25/0.29 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.25/0.33 % (3631074)Will run a generic schedule for satisfiability detection.
% 0.25/0.33 % (3631082)dis+10_1_sil=32000:sp=arity:random_seed=1757550255:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.25/0.33 % (3631082) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3631074-3631082"...
% 0.25/0.33 % (3631082)...printing done.
% 0.25/0.33 % (3631082)Refutation found. Thanks to Tanya!
% 0.25/0.33 % SZS status Theorem for theBenchmark
% 0.25/0.33 % SZS output start Proof for theBenchmark
% See solution above
% 0.25/0.33 % (3631082)------------------------------
% 0.25/0.33 % (3631082)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.25/0.33 % (3631082)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.25/0.33 % (3631082)CaDiCaL version: 2.1.3
% 0.25/0.33 % (3631082)Termination reason: Refutation
% 0.25/0.33 % (3631082)Time elapsed: 0.001 s
% 0.25/0.33 % (3631082)Peak memory usage: 11 MB
% 0.25/0.33 % (3631074)Success in time 0.023 s
% 0.25/0.33 % Vampire exiting
%------------------------------------------------------------------------------