%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO305^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 : 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 : Wed Sep 30 08:49:42 AM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 16 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 123 ( 36 equ; 0 cnn)
% Maximal formula atoms : 6 ( 7 avg)
% Number of connectives : 108 ( 17 ~; 10 |; 9 &; 52 @)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 28 ( 0 ^; 24 !; 4 ?; 28 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
cB: $i > $o ).
thf(func_def_1,type,
cA: $i > $o ).
thf(func_def_5,type,
sK0: $i > $o ).
thf(f1,conjecture,
( ! [X0: $i] :
( ( cA @ X0 )
=> ( cB @ X0 ) )
=> ! [X0: $i > $o] :
( ! [X1: $i] :
( ( X0 @ X1 )
=> ( cA @ X1 ) )
=> ! [X1: $i] :
( ( X0 @ X1 )
=> ( cB @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cSET79_pme) ).
thf(f2,negated_conjecture,
~ ( ! [X0: $i] :
( ( cA @ X0 )
=> ( cB @ X0 ) )
=> ! [X0: $i > $o] :
( ! [X1: $i] :
( ( X0 @ X1 )
=> ( cA @ X1 ) )
=> ! [X1: $i] :
( ( X0 @ X1 )
=> ( cB @ X1 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ( ! [X0: $i] :
( ( cA @ X0 )
=> ( cB @ X0 ) )
=> ! [X1: $i > $o] :
( ! [X2: $i] :
( ( X1 @ X2 )
=> ( cA @ X2 ) )
=> ! [X3: $i] :
( ( X1 @ X3 )
=> ( cB @ X3 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ( ! [X0: $i] :
( ( ( cA @ X0 )
= $true )
=> ( ( cB @ X0 )
= $true ) )
=> ! [X1: $i > $o] :
( ! [X2: $i] :
( ( ( X1 @ X2 )
= $true )
=> ( ( cA @ X2 )
= $true ) )
=> ! [X3: $i] :
( ( ( X1 @ X3 )
= $true )
=> ( ( cB @ X3 )
= $true ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
( ? [X1: $i > $o] :
( ? [X3: $i] :
( ( ( cB @ X3 )
!= $true )
& ( ( X1 @ X3 )
= $true ) )
& ! [X2: $i] :
( ( ( cA @ X2 )
= $true )
| ( ( X1 @ X2 )
!= $true ) ) )
& ! [X0: $i] :
( ( ( cB @ X0 )
= $true )
| ( ( cA @ X0 )
!= $true ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
( ? [X0: $i > $o] :
( ? [X1: $i] :
( ( ( cB @ X1 )
!= $true )
& ( ( X0 @ X1 )
= $true ) )
& ! [X2: $i] :
( ( ( cA @ X2 )
= $true )
| ( $true
!= ( X0 @ X2 ) ) ) )
& ! [X3: $i] :
( ( ( cB @ X3 )
= $true )
| ( $true
!= ( cA @ X3 ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f7,plain,
( ( $true
!= ( cB @ sK1 ) )
& ( $true
= ( sK0 @ sK1 ) )
& ! [X2: $i] :
( ( ( cA @ X2 )
= $true )
| ( $true
!= ( sK0 @ X2 ) ) )
& ! [X3: $i] :
( ( ( cB @ X3 )
= $true )
| ( $true
!= ( cA @ X3 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f6]) ).
thf(f8,plain,
! [X3: $i] :
( ( $true
!= ( cA @ X3 ) )
| ( ( cB @ X3 )
= $true ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f9,plain,
! [X2: $i] :
( ( $true
!= ( sK0 @ X2 ) )
| ( ( cA @ X2 )
= $true ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f10,plain,
( $true
= ( sK0 @ sK1 ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f11,plain,
( $true
!= ( cB @ sK1 ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f14,plain,
( ( $true != $true )
| ( $true
= ( cA @ sK1 ) ) ),
inference(constrained_superposition,[],[f9,f10]) ).
thf(f15,plain,
( $true
= ( cA @ sK1 ) ),
inference(trivial_inequality_removal,[],[f14]) ).
thf(f16,plain,
( ( $true != $true )
| ( $true
= ( cB @ sK1 ) ) ),
inference(constrained_superposition,[],[f8,f15]) ).
thf(f17,plain,
( $true
= ( cB @ sK1 ) ),
inference(trivial_inequality_removal,[],[f16]) ).
thf(f18,plain,
$false,
inference(forward_subsumption_resolution,[],[f17,f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO305^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.08/0.19 % Computer : n006.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 16:44:24 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/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.20/0.27 % (996197)Will run a generic schedule for satisfiability detection.
% 0.20/0.27 % (996221)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2815296975:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.27 % (996221)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.27 % (996221) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-996197-996221"...
% 0.20/0.27 % (996221)...printing done.
% 0.20/0.27 % (996221)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 % (996221)------------------------------
% 0.20/0.27 % (996221)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (996221)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (996221)CaDiCaL version: 2.1.3
% 0.20/0.27 % (996221)Termination reason: Refutation
% 0.20/0.27 % (996221)Time elapsed: 0.001 s
% 0.20/0.27 % (996221)Peak memory usage: 12 MB
% 0.20/0.27 % (996221)Instructions burned: 1 (million)
% 0.20/0.27 % (996197)Success in time 0.039 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------