%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN055^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n015.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 : Wed Sep 30 08:41:50 AM UTC 2026
% Result : Theorem 0.09s 0.25s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 15 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 302 ( 86 equ; 0 cnn)
% Maximal formula atoms : 13 ( 20 avg)
% Number of connectives : 274 ( 38 ~; 28 |; 63 &; 125 @)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 56 ( 0 ^; 35 !; 21 ?; 56 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
cP: $i > $o ).
thf(func_def_1,type,
cQ: $i > $o ).
thf(func_def_2,type,
cR: $i > $o ).
thf(func_def_3,type,
cF: $i > $o ).
thf(func_def_4,type,
cG: $i > $o ).
thf(f1,conjecture,
( ( ( ? [X0: $i] :
( ( cR @ X0 )
& ( cP @ X0 ) )
| ! [X0: $i] :
( ( cP @ X0 )
=> ( cQ @ X0 ) ) )
& ! [X0: $i] :
( ( cP @ X0 )
=> ( ( cF @ X0 )
& ( cG @ X0 ) ) )
& ! [X0: $i] :
( ( cF @ X0 )
=> ( ( cR @ X0 )
& ~ ( cG @ X0 ) ) )
& ? [X0: $i] : ( cP @ X0 ) )
=> ? [X0: $i] :
( ( cP @ X0 )
& ( cQ @ X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cPELL25) ).
thf(f2,negated_conjecture,
~ ( ( ( ? [X0: $i] :
( ( cR @ X0 )
& ( cP @ X0 ) )
| ! [X0: $i] :
( ( cP @ X0 )
=> ( cQ @ X0 ) ) )
& ! [X0: $i] :
( ( cP @ X0 )
=> ( ( cF @ X0 )
& ( cG @ X0 ) ) )
& ! [X0: $i] :
( ( cF @ X0 )
=> ( ( cR @ X0 )
& ~ ( cG @ X0 ) ) )
& ? [X0: $i] : ( cP @ X0 ) )
=> ? [X0: $i] :
( ( cP @ X0 )
& ( cQ @ X0 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ( ( ( ? [X0: $i] :
( ( cR @ X0 )
& ( cP @ X0 ) )
| ! [X1: $i] :
( ( cP @ X1 )
=> ( cQ @ X1 ) ) )
& ! [X2: $i] :
( ( cP @ X2 )
=> ( ( cF @ X2 )
& ( cG @ X2 ) ) )
& ! [X3: $i] :
( ( cF @ X3 )
=> ( ( cR @ X3 )
& ~ ( cG @ X3 ) ) )
& ? [X4: $i] : ( cP @ X4 ) )
=> ? [X5: $i] :
( ( cP @ X5 )
& ( cQ @ X5 ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ( ( ( ? [X0: $i] :
( ( ( cR @ X0 )
= $true )
& ( ( cP @ X0 )
= $true ) )
| ! [X1: $i] :
( ( ( cP @ X1 )
= $true )
=> ( ( cQ @ X1 )
= $true ) ) )
& ! [X2: $i] :
( ( ( cP @ X2 )
= $true )
=> ( ( ( cF @ X2 )
= $true )
& ( ( cG @ X2 )
= $true ) ) )
& ! [X3: $i] :
( ( ( cF @ X3 )
= $true )
=> ( ( ( cR @ X3 )
= $true )
& ( ( cG @ X3 )
!= $true ) ) )
& ? [X4: $i] :
( ( cP @ X4 )
= $true ) )
=> ? [X5: $i] :
( ( ( cP @ X5 )
= $true )
& ( ( cQ @ X5 )
= $true ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
~ ( ( ( ? [X0: $i] :
( ( ( cR @ X0 )
= $true )
& ( ( cP @ X0 )
= $true ) )
| ! [X1: $i] :
( ( ( cP @ X1 )
= $true )
=> ( ( cQ @ X1 )
= $true ) ) )
& ! [X2: $i] :
( ( ( cP @ X2 )
= $true )
=> ( ( ( cF @ X2 )
= $true )
& ( ( cG @ X2 )
= $true ) ) )
& ! [X3: $i] :
( ( ( cF @ X3 )
= $true )
=> ( ( ( cR @ X3 )
= $true )
& ( ( cG @ X3 )
!= $true ) ) )
& ? [X4: $i] :
( ( cP @ X4 )
= $true ) )
=> ? [X5: $i] :
( ( ( cP @ X5 )
= $true )
& ( ( cQ @ X5 )
= $true ) ) ),
inference(flattening,[],[f4]) ).
thf(f6,plain,
( ! [X5: $i] :
( ( ( cP @ X5 )
!= $true )
| ( ( cQ @ X5 )
!= $true ) )
& ( ? [X0: $i] :
( ( ( cR @ X0 )
= $true )
& ( ( cP @ X0 )
= $true ) )
| ! [X1: $i] :
( ( ( cQ @ X1 )
= $true )
| ( ( cP @ X1 )
!= $true ) ) )
& ! [X2: $i] :
( ( ( ( cF @ X2 )
= $true )
& ( ( cG @ X2 )
= $true ) )
| ( ( cP @ X2 )
!= $true ) )
& ! [X3: $i] :
( ( ( ( cR @ X3 )
= $true )
& ( ( cG @ X3 )
!= $true ) )
| ( ( cF @ X3 )
!= $true ) )
& ? [X4: $i] :
( ( cP @ X4 )
= $true ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f7,plain,
( ! [X5: $i] :
( ( ( cP @ X5 )
!= $true )
| ( ( cQ @ X5 )
!= $true ) )
& ( ? [X0: $i] :
( ( ( cR @ X0 )
= $true )
& ( ( cP @ X0 )
= $true ) )
| ! [X1: $i] :
( ( ( cQ @ X1 )
= $true )
| ( ( cP @ X1 )
!= $true ) ) )
& ! [X2: $i] :
( ( ( ( cF @ X2 )
= $true )
& ( ( cG @ X2 )
= $true ) )
| ( ( cP @ X2 )
!= $true ) )
& ! [X3: $i] :
( ( ( ( cR @ X3 )
= $true )
& ( ( cG @ X3 )
!= $true ) )
| ( ( cF @ X3 )
!= $true ) )
& ? [X4: $i] :
( ( cP @ X4 )
= $true ) ),
inference(flattening,[],[f6]) ).
thf(f8,plain,
( ! [X0: $i] :
( ( ( cP @ X0 )
!= $true )
| ( ( cQ @ X0 )
!= $true ) )
& ( ? [X1: $i] :
( ( $true
= ( cR @ X1 ) )
& ( ( cP @ X1 )
= $true ) )
| ! [X2: $i] :
( ( $true
= ( cQ @ X2 ) )
| ( ( cP @ X2 )
!= $true ) ) )
& ! [X3: $i] :
( ( ( ( cF @ X3 )
= $true )
& ( ( cG @ X3 )
= $true ) )
| ( $true
!= ( cP @ X3 ) ) )
& ! [X4: $i] :
( ( ( $true
= ( cR @ X4 ) )
& ( $true
!= ( cG @ X4 ) ) )
| ( $true
!= ( cF @ X4 ) ) )
& ? [X5: $i] :
( ( cP @ X5 )
= $true ) ),
inference(rectify,[],[f7]) ).
thf(f9,plain,
( ! [X0: $i] :
( ( ( cP @ X0 )
!= $true )
| ( ( cQ @ X0 )
!= $true ) )
& ( ( ( $true
= ( cR @ sK0 ) )
& ( $true
= ( cP @ sK0 ) ) )
| ! [X2: $i] :
( ( $true
= ( cQ @ X2 ) )
| ( ( cP @ X2 )
!= $true ) ) )
& ! [X3: $i] :
( ( ( ( cF @ X3 )
= $true )
& ( ( cG @ X3 )
= $true ) )
| ( $true
!= ( cP @ X3 ) ) )
& ! [X4: $i] :
( ( ( $true
= ( cR @ X4 ) )
& ( $true
!= ( cG @ X4 ) ) )
| ( $true
!= ( cF @ X4 ) ) )
& ( $true
= ( cP @ sK1 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X1,sK0),skolemize(X5,sK1)],[f8]) ).
thf(f10,plain,
( $true
= ( cP @ sK1 ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f11,plain,
! [X4: $i] :
( ( $true
!= ( cG @ X4 ) )
| ( $true
!= ( cF @ X4 ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f13,plain,
! [X3: $i] :
( ( ( cG @ X3 )
= $true )
| ( $true
!= ( cP @ X3 ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f14,plain,
! [X3: $i] :
( ( ( cF @ X3 )
= $true )
| ( $true
!= ( cP @ X3 ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f20,plain,
! [X3: $i] :
( $true
!= ( cP @ X3 ) ),
inference(global_subsumption,[],[f14,f13,f11]) ).
thf(f30,plain,
$false,
inference(forward_subsumption_resolution,[],[f10,f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN055^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18 % Computer : n015.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Tue Sep 29 16:17:33 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 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.25 % (3721294)Will run a generic schedule for satisfiability detection.
% 0.09/0.25 % (3721308)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1318759417:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.09/0.25 % (3721308) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3721294-3721308"...
% 0.09/0.25 % (3721308)...printing done.
% 0.09/0.25 % (3721308)Refutation found. Thanks to Tanya!
% 0.09/0.25 % SZS status Theorem for theBenchmark
% 0.09/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.25 % (3721308)------------------------------
% 0.09/0.25 % (3721308)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.25 % (3721308)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.25 % (3721308)CaDiCaL version: 2.1.3
% 0.09/0.25 % (3721308)Termination reason: Refutation
% 0.09/0.25 % (3721308)Time elapsed: 0.002 s
% 0.09/0.25 % (3721308)Peak memory usage: 12 MB
% 0.09/0.25 % (3721308)Instructions burned: 2 (million)
% 0.09/0.25 % (3721294)Success in time 0.025 s
% 0.09/0.25 % Vampire exiting
%------------------------------------------------------------------------------