%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU694^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 : n009.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:33:00 AM UTC 2026
% Result : Theorem 0.23s 0.32s
% Output : Refutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 8 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 53 ( 13 equ; 0 cnn)
% Maximal formula atoms : 3 ( 6 avg)
% Number of connectives : 104 ( 6 ~; 0 |; 4 &; 86 @)
% ( 0 <=>; 8 =>; 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; 6 con; 0-4 aty)
% Number of variables : 20 ( 0 ^; 16 !; 4 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
func: $i > $i > $i > $o ).
thf(func_def_2,type,
ap: $i > $i > $i > $i > $i ).
thf(f1,conjecture,
! [X0: $i,X1: $i,X2: $i] :
( ( func @ X0 @ X1 @ X2 )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( ( ap @ X0 @ X1 @ X2 @ X3 )
= ( ap @ X0 @ X1 @ X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ap2apEq2) ).
thf(f2,negated_conjecture,
~ ! [X0: $i,X1: $i,X2: $i] :
( ( func @ X0 @ X1 @ X2 )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( ( ap @ X0 @ X1 @ X2 @ X3 )
= ( ap @ X0 @ X1 @ X2 @ X3 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: $i,X1: $i,X2: $i] :
( ( func @ X0 @ X1 @ X2 )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( ( ap @ X0 @ X1 @ X2 @ X3 )
= ( ap @ X0 @ X1 @ X2 @ X3 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X0: $i,X1: $i,X2: $i] :
( ( ( func @ X0 @ X1 @ X2 )
= $true )
=> ! [X3: $i] :
( ( ( in @ X3 @ X0 )
= $true )
=> ( ( ap @ X0 @ X1 @ X2 @ X3 )
= ( ap @ X0 @ X1 @ X2 @ X3 ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
? [X0: $i,X1: $i,X2: $i] :
( ? [X3: $i] :
( ( ( ap @ X0 @ X1 @ X2 @ X3 )
!= ( ap @ X0 @ X1 @ X2 @ X3 ) )
& ( ( in @ X3 @ X0 )
= $true ) )
& ( ( func @ X0 @ X1 @ X2 )
= $true ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
( ( ( ap @ sK0 @ sK1 @ sK2 @ sK3 )
!= ( ap @ sK0 @ sK1 @ sK2 @ sK3 ) )
& ( $true
= ( in @ sK3 @ sK0 ) )
& ( $true
= ( func @ sK0 @ sK1 @ sK2 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f5]) ).
thf(f9,plain,
( ( ap @ sK0 @ sK1 @ sK2 @ sK3 )
!= ( ap @ sK0 @ sK1 @ sK2 @ sK3 ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f12,plain,
$false,
inference(trivial_inequality_removal,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU694^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 % Computer : n009.cluster.edu
% 0.09/0.22 % Model : x86_64 x86_64
% 0.09/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.22 % Memory : 8046.5625MB
% 0.09/0.22 % OS : Linux 6.8.0-71-generic
% 0.09/0.22 % CPULimit : 300
% 0.09/0.22 % WCLimit : 300
% 0.09/0.22 % DateTime : Tue Sep 29 14:11:45 UTC 2026
% 0.09/0.23 % CPUTime :
% 0.09/0.23 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.23/0.28 Running first-order model finding
% 0.23/0.28 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.23/0.32 % (4061643)Will run a generic schedule for satisfiability detection.
% 0.23/0.32 % (4061648)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1695653638_2999 on theBenchmark for (2999ds/0Mi)
% 0.23/0.32 % Exception at run slice level
% 0.23/0.32 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.23/0.32 % (4061650)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2646961729:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.23/0.32 % (4061650) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4061643-4061650"...
% 0.23/0.32 % (4061650)...printing done.
% 0.23/0.32 % (4061650)Refutation found. Thanks to Tanya!
% 0.23/0.32 % SZS status Theorem for theBenchmark
% 0.23/0.32 % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.32 % (4061650)------------------------------
% 0.23/0.32 % (4061650)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.32 % (4061650)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.32 % (4061650)CaDiCaL version: 2.1.3
% 0.23/0.32 % (4061650)Termination reason: Refutation
% 0.23/0.32 % (4061650)Time elapsed: 0.001 s
% 0.23/0.32 % (4061650)Peak memory usage: 12 MB
% 0.23/0.32 % (4061650)Instructions burned: 1 (million)
% 0.23/0.32 % (4061643)Success in time 0.027 s
% 0.23/0.32 % Vampire exiting
%------------------------------------------------------------------------------