%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEV134^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 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:37:52 AM UTC 2026
% Result : Theorem 0.07s 0.26s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 12 unt; 0 typ; 2 def)
% Number of atoms : 83 ( 32 equ; 0 cnn)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 104 ( 19 ~; 8 |; 12 &; 52 @)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 21 ( 21 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn 28 !; 9 ?; 37 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_3,type,
sK0: a > a > $o ).
thf(func_def_4,type,
sK1: a ).
thf(func_def_5,type,
sK2: a > $o ).
thf(func_def_6,type,
sF3: $o ).
thf(func_def_7,type,
sF4: a > a > $o ).
thf(func_def_8,type,
sF5: a > $o ).
thf(f1,conjecture,
! [X2: a > $o,X0: a > a > $o,X1: a] :
( ! [X4: a,X3: a] :
( ( ( X0 @ X3 @ X4 )
& ( X2 @ X3 ) )
=> ( X2 @ X4 ) )
=> ( ( X2 @ X1 )
=> ( X2 @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM201_pme) ).
thf(f2,negated_conjecture,
~ ! [X2: a > $o,X0: a > a > $o,X1: a] :
( ! [X4: a,X3: a] :
( ( ( X0 @ X3 @ X4 )
& ( X2 @ X3 ) )
=> ( X2 @ X4 ) )
=> ( ( X2 @ X1 )
=> ( X2 @ X1 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: a > $o,X1: a > a > $o,X2: a] :
( ! [X3: a,X4: a] :
( ( ( X1 @ X4 @ X3 )
& ( X0 @ X4 ) )
=> ( X0 @ X3 ) )
=> ( ( X0 @ X2 )
=> ( X0 @ X2 ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X1: a > a > $o,X2: a,X0: a > $o] :
( ! [X4: a,X3: a] :
( ( ( ( X0 @ X4 )
= $true )
& ( ( X1 @ X4 @ X3 )
= $true ) )
=> ( $true
= ( X0 @ X3 ) ) )
=> ( ( $true
= ( X0 @ X2 ) )
=> ( $true
= ( X0 @ X2 ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
? [X1: a > a > $o,X2: a,X0: a > $o] :
( ( $true
!= ( X0 @ X2 ) )
& ( $true
= ( X0 @ X2 ) )
& ! [X4: a,X3: a] :
( ( $true
= ( X0 @ X3 ) )
| ( ( X0 @ X4 )
!= $true )
| ( ( X1 @ X4 @ X3 )
!= $true ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
? [X1: a > a > $o,X2: a,X0: a > $o] :
( ( $true
!= ( X0 @ X2 ) )
& ( $true
= ( X0 @ X2 ) )
& ! [X4: a,X3: a] :
( ( ( X1 @ X4 @ X3 )
!= $true )
| ( $true
= ( X0 @ X3 ) )
| ( ( X0 @ X4 )
!= $true ) ) ),
inference(flattening,[],[f5]) ).
thf(f7,plain,
? [X0: a > a > $o,X1: a,X2: a > $o] :
( ( ( X2 @ X1 )
!= $true )
& ( ( X2 @ X1 )
= $true )
& ! [X3: a,X4: a] :
( ( ( X0 @ X3 @ X4 )
!= $true )
| ( ( X2 @ X4 )
= $true )
| ( ( X2 @ X3 )
!= $true ) ) ),
inference(rectify,[],[f6]) ).
thf(f8,plain,
( ( ( sK2 @ sK1 )
!= $true )
& ( ( sK2 @ sK1 )
= $true )
& ! [X3: a,X4: a] :
( ( $true
!= ( sK0 @ X3 @ X4 ) )
| ( $true
= ( sK2 @ X4 ) )
| ( ( sK2 @ X3 )
!= $true ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f7]) ).
thf(f10,plain,
( ( sK2 @ sK1 )
= $true ),
inference(cnf_transformation,[],[f8]) ).
thf(f11,plain,
( ( sK2 @ sK1 )
!= $true ),
inference(cnf_transformation,[],[f8]) ).
thf(f14,definition,
( sF3
= ( sK2 @ sK1 ) ),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
thf(f15,plain,
( ( sK2 @ sK1 )
= sF3 ),
inference(reorient_equations,[],[f14]) ).
thf(f16,plain,
$true != sF3,
inference(definition_folding,[],[f11,f15]) ).
thf(f17,plain,
$true = sF3,
inference(definition_folding,[],[f10,f15]) ).
thf(f28,definition,
( spl6_1
<=> ( $true = sF3 ) ),
introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).
thf(f45,plain,
~ spl6_1,
inference(avatar_split_clause,[],[f16,f28]) ).
thf(f46,plain,
spl6_1,
inference(avatar_split_clause,[],[f17,f28]) ).
cnf(s3,plain,
~ spl6_1,
inference(sat_conversion,[],[f45]) ).
cnf(s4,plain,
spl6_1,
inference(sat_conversion,[],[f46]) ).
cnf(s5,plain,
$false,
inference(rat,[],[s3,s4]) ).
thf(f47,plain,
$false,
inference(avatar_sat_refutation,[],[s5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV134^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.18 % Computer : n006.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 15:15:40 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.21 Running higher-order theorem proving
% 0.07/0.23 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.26 % (850302)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.07/0.26 % (850313)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.07/0.26 % (850313)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.07/0.26 % (850313)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=226302905:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.07/0.26 % (850313) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-850302-850313"...
% 0.07/0.26 % (850313)...printing done.
% 0.07/0.26 % (850313)Refutation found. Thanks to Tanya!
% 0.07/0.26 % SZS status Theorem for theBenchmark
% 0.07/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.26 % (850313)------------------------------
% 0.07/0.26 % (850313)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.26 % (850313)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.26 % (850313)CaDiCaL version: 2.1.3
% 0.07/0.26 % (850313)Termination reason: Refutation
% 0.07/0.26 % (850313)Time elapsed: 0.001 s
% 0.07/0.26 % (850313)Peak memory usage: 12 MB
% 0.07/0.26 % (850313)Instructions burned: 1 (million)
% 0.07/0.26 % (850302)Success in time 0.025 s
% 0.07/0.26 % Vampire exiting
%------------------------------------------------------------------------------