%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN357^5 : TPTP v9.3.1. Released v4.0.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:41:51 AM UTC 2026
% Result : Theorem 0.08s 0.25s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 10 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 36 ( 9 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 27 ( 7 ~; 0 |; 2 &; 14 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 3 con; 0-2 aty)
% Number of variables : 12 ( 0 ^; 7 !; 5 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
cP: $i > $o ).
thf(f1,conjecture,
! [X0: $i] :
? [X1: $i] :
( ( cP @ X0 )
=> ( cP @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cLX2108) ).
thf(f2,negated_conjecture,
~ ! [X0: $i] :
? [X1: $i] :
( ( cP @ X0 )
=> ( cP @ X1 ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: $i] :
? [X1: $i] :
( ( cP @ X0 )
=> ( cP @ X1 ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X0: $i] :
? [X1: $i] :
( ( ( cP @ X0 )
= $true )
=> ( ( cP @ X1 )
= $true ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
? [X0: $i] :
! [X1: $i] :
( ( ( cP @ X1 )
!= $true )
& ( ( cP @ X0 )
= $true ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
! [X1: $i] :
( ( ( cP @ X1 )
!= $true )
& ( $true
= ( cP @ sK0 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f5]) ).
thf(f7,plain,
( $true
= ( cP @ sK0 ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f8,plain,
! [X1: $i] :
( ( cP @ X1 )
!= $true ),
inference(cnf_transformation,[],[f6]) ).
thf(f11,plain,
$true != $true,
inference(constrained_superposition,[],[f8,f7]) ).
thf(f12,plain,
$false,
inference(trivial_inequality_removal,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN357^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.17 % Computer : n009.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Tue Sep 29 16:15:00 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/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.08/0.25 % (4193990)Will run a generic schedule for satisfiability detection.
% 0.08/0.25 % (4193995)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4130284164_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.25 % Exception at run slice level
% 0.08/0.25 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.08/0.25 % (4193998)dis+10_1_sil=32000:sp=arity:random_seed=1483439725:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.25 % (4194000)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2995870084:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.25 % (4193999)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2495040936:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.25 % (4194001)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2829356120:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.25 % (4193999)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.08/0.25 % (4194000) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4193990-4194000"...
% 0.08/0.25 % (4193998) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4193990-4193998"...
% 0.08/0.25 % (4193999) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4193990-4193999"...
% 0.08/0.25 % (4194001) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4193990-4194001"...
% 0.08/0.25 % (4194000)...printing done.
% 0.08/0.25 % (4193998)...printing done.
% 0.08/0.25 % (4193999)...printing done.
% 0.08/0.25 % (4194001)...printing done.
% 0.08/0.25 % (4194003)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2734188069:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.08/0.25 % Exception at run slice level
% 0.08/0.25 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.08/0.25 % (4193999)Refutation found. Thanks to Tanya!
% 0.08/0.25 % SZS status Theorem for theBenchmark
% 0.08/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.25 % (4193999)------------------------------
% 0.08/0.25 % (4193999)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.25 % (4193999)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.25 % (4193999)CaDiCaL version: 2.1.3
% 0.08/0.25 % (4193999)Termination reason: Refutation
% 0.08/0.25 % (4193999)Time elapsed: 0.001 s
% 0.08/0.25 % (4193999)Peak memory usage: 12 MB
% 0.08/0.25 % (4193990)Success in time 0.035 s
% 0.08/0.25 % Vampire exiting
%------------------------------------------------------------------------------