%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU537^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n002.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:32:21 AM UTC 2026
% Result : Theorem 0.10s 0.25s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 15 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 95 ( 28 equ; 0 cnn)
% Maximal formula atoms : 4 ( 6 avg)
% Number of connectives : 110 ( 26 ~; 5 |; 11 &; 58 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 30 ( 0 ^; 19 !; 11 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_5,type,
sK1: $i > $o ).
thf(f1,conjecture,
! [X0: $i,X1: $i > $o] :
( ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ~ ( X1 @ X2 ) )
=> ~ ? [X2: $i] :
( ( X1 @ X2 )
& ( in @ X2 @ X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quantDeMorgan2) ).
thf(f2,negated_conjecture,
~ ! [X0: $i,X1: $i > $o] :
( ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ~ ( X1 @ X2 ) )
=> ~ ? [X2: $i] :
( ( X1 @ X2 )
& ( in @ X2 @ X0 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: $i,X1: $i > $o] :
( ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ~ ( X1 @ X2 ) )
=> ~ ? [X3: $i] :
( ( X1 @ X3 )
& ( in @ X3 @ X0 ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X0: $i,X1: $i > $o] :
( ! [X2: $i] :
( ( ( in @ X2 @ X0 )
= $true )
=> ( ( X1 @ X2 )
!= $true ) )
=> ~ ? [X3: $i] :
( ( ( X1 @ X3 )
= $true )
& ( ( in @ X3 @ X0 )
= $true ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
~ ! [X0: $i,X1: $i > $o] :
( ! [X2: $i] :
( ( ( in @ X2 @ X0 )
= $true )
=> ( ( X1 @ X2 )
!= $true ) )
=> ~ ? [X3: $i] :
( ( ( X1 @ X3 )
= $true )
& ( ( in @ X3 @ X0 )
= $true ) ) ),
inference(flattening,[],[f4]) ).
thf(f6,plain,
? [X0: $i,X1: $i > $o] :
( ? [X3: $i] :
( ( ( X1 @ X3 )
= $true )
& ( ( in @ X3 @ X0 )
= $true ) )
& ! [X2: $i] :
( ( ( X1 @ X2 )
!= $true )
| ( ( in @ X2 @ X0 )
!= $true ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f7,plain,
? [X0: $i,X1: $i > $o] :
( ? [X2: $i] :
( ( ( X1 @ X2 )
= $true )
& ( ( in @ X2 @ X0 )
= $true ) )
& ! [X3: $i] :
( ( ( X1 @ X3 )
!= $true )
| ( ( in @ X3 @ X0 )
!= $true ) ) ),
inference(rectify,[],[f6]) ).
thf(f8,plain,
( ( $true
= ( sK1 @ sK2 ) )
& ( $true
= ( in @ sK2 @ sK0 ) )
& ! [X3: $i] :
( ( $true
!= ( sK1 @ X3 ) )
| ( $true
!= ( in @ X3 @ sK0 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f7]) ).
thf(f9,plain,
! [X3: $i] :
( ( $true
!= ( sK1 @ X3 ) )
| ( $true
!= ( in @ X3 @ sK0 ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f10,plain,
( $true
= ( in @ sK2 @ sK0 ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f11,plain,
( $true
= ( sK1 @ sK2 ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f14,plain,
( ( $true != $true )
| ( $true
!= ( in @ sK2 @ sK0 ) ) ),
inference(constrained_superposition,[],[f9,f11]) ).
thf(f15,plain,
( $true
!= ( in @ sK2 @ sK0 ) ),
inference(trivial_inequality_removal,[],[f14]) ).
thf(f16,plain,
$true != $true,
inference(constrained_superposition,[],[f15,f10]) ).
thf(f17,plain,
$false,
inference(trivial_inequality_removal,[],[f16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU537^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.18 % Computer : n002.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.18 % CPULimit : 300
% 0.10/0.18 % WCLimit : 300
% 0.10/0.18 % DateTime : Tue Sep 29 13:51:52 UTC 2026
% 0.10/0.18 % CPUTime :
% 0.10/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.21 Running first-order model finding
% 0.10/0.21 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.10/0.25 % (1316893)Will run a generic schedule for satisfiability detection.
% 0.10/0.25 % (1316904)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1390599414:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.25 % (1316904) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1316893-1316904"...
% 0.10/0.25 % (1316904)...printing done.
% 0.10/0.25 % (1316899)% WARNING: option uhcvi not known.
% 0.10/0.25 % (1316904)Refutation found. Thanks to Tanya!
% 0.10/0.25 % SZS status Theorem for theBenchmark
% 0.10/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.25 % (1316904)------------------------------
% 0.10/0.25 % (1316904)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.25 % (1316904)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.25 % (1316904)CaDiCaL version: 2.1.3
% 0.10/0.25 % (1316904)Termination reason: Refutation
% 0.10/0.25 % (1316904)Time elapsed: 0.001 s
% 0.10/0.25 % (1316904)Peak memory usage: 12 MB
% 0.10/0.25 % (1316904)Instructions burned: 1 (million)
% 0.10/0.25 % (1316893)Success in time 0.036 s
% 0.10/0.25 % Vampire exiting
%------------------------------------------------------------------------------