%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU846^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 : 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:31:47 AM UTC 2026
% Result : Theorem 0.07s 0.24s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 8 unt; 0 typ; 2 def)
% Number of atoms : 183 ( 72 equ; 0 cnn)
% Maximal formula atoms : 10 ( 6 avg)
% Number of connectives : 239 ( 46 ~; 25 |; 40 &; 101 @)
% ( 2 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 24 ( 24 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 60 ( 0 sgn 48 !; 12 ?; 60 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_3,type,
sK0: a > $o ).
thf(func_def_4,type,
sK1: a > $o ).
thf(func_def_5,type,
sK2: a > $o ).
thf(func_def_6,type,
sK3: a ).
thf(f1,conjecture,
! [X0: a > $o,X2: a > $o,X1: a > $o] :
( ( ! [X3: a] :
( ( X0 @ X3 )
=> ( X1 @ X3 ) )
& ! [X3: a] :
( ( X1 @ X3 )
=> ( X2 @ X3 ) )
& ! [X3: a] :
( ( X0 @ X3 )
=> ( X2 @ X3 ) ) )
=> ! [X3: a] :
( ( ~ ( X1 @ X3 )
& ( X2 @ X3 ) )
=> ( ~ ( X0 @ X3 )
& ( X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cGAZING_THM11_pme) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o,X2: a > $o,X1: a > $o] :
( ( ! [X3: a] :
( ( X0 @ X3 )
=> ( X1 @ X3 ) )
& ! [X3: a] :
( ( X1 @ X3 )
=> ( X2 @ X3 ) )
& ! [X3: a] :
( ( X0 @ X3 )
=> ( X2 @ X3 ) ) )
=> ! [X3: a] :
( ( ~ ( X1 @ X3 )
& ( X2 @ X3 ) )
=> ( ~ ( X0 @ X3 )
& ( X2 @ X3 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ! [X3: a] :
( ( X0 @ X3 )
=> ( X2 @ X3 ) )
& ! [X4: a] :
( ( X2 @ X4 )
=> ( X1 @ X4 ) )
& ! [X5: a] :
( ( X0 @ X5 )
=> ( X1 @ X5 ) ) )
=> ! [X6: a] :
( ( ~ ( X2 @ X6 )
& ( X1 @ X6 ) )
=> ( ~ ( X0 @ X6 )
& ( X1 @ X6 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ! [X3: a] :
( ( ( X0 @ X3 )
= $true )
=> ( ( X2 @ X3 )
= $true ) )
& ! [X5: a] :
( ( $true
= ( X0 @ X5 ) )
=> ( ( X1 @ X5 )
= $true ) )
& ! [X4: a] :
( ( $true
= ( X2 @ X4 ) )
=> ( $true
= ( X1 @ X4 ) ) ) )
=> ! [X6: a] :
( ( ( ( X2 @ X6 )
!= $true )
& ( $true
= ( X1 @ X6 ) ) )
=> ( ( ( X0 @ X6 )
!= $true )
& ( $true
= ( X1 @ X6 ) ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
~ ! [X1: a > $o,X2: a > $o,X0: a > $o] :
( ( ! [X3: a] :
( ( ( X0 @ X3 )
= $true )
=> ( ( X2 @ X3 )
= $true ) )
& ! [X5: a] :
( ( $true
= ( X0 @ X5 ) )
=> ( ( X1 @ X5 )
= $true ) )
& ! [X4: a] :
( ( $true
= ( X2 @ X4 ) )
=> ( $true
= ( X1 @ X4 ) ) ) )
=> ! [X6: a] :
( ( ( ( X2 @ X6 )
!= $true )
& ( $true
= ( X1 @ X6 ) ) )
=> ( ( ( X0 @ X6 )
!= $true )
& ( $true
= ( X1 @ X6 ) ) ) ) ),
inference(flattening,[],[f4]) ).
thf(f6,plain,
? [X1: a > $o,X2: a > $o,X0: a > $o] :
( ? [X6: a] :
( ( ( $true
!= ( X1 @ X6 ) )
| ( ( X0 @ X6 )
= $true ) )
& ( ( X2 @ X6 )
!= $true )
& ( $true
= ( X1 @ X6 ) ) )
& ! [X3: a] :
( ( ( X0 @ X3 )
!= $true )
| ( ( X2 @ X3 )
= $true ) )
& ! [X5: a] :
( ( ( X1 @ X5 )
= $true )
| ( $true
!= ( X0 @ X5 ) ) )
& ! [X4: a] :
( ( $true
= ( X1 @ X4 ) )
| ( $true
!= ( X2 @ X4 ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f7,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ! [X3: a] :
( ( ( X0 @ X3 )
!= $true )
| ( ( X2 @ X3 )
= $true ) )
& ? [X6: a] :
( ( ( $true
!= ( X1 @ X6 ) )
| ( ( X0 @ X6 )
= $true ) )
& ( ( X2 @ X6 )
!= $true )
& ( $true
= ( X1 @ X6 ) ) )
& ! [X5: a] :
( ( ( X1 @ X5 )
= $true )
| ( $true
!= ( X0 @ X5 ) ) )
& ! [X4: a] :
( ( $true
= ( X1 @ X4 ) )
| ( $true
!= ( X2 @ X4 ) ) ) ),
inference(flattening,[],[f6]) ).
thf(f8,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ! [X3: a] :
( ( ( X0 @ X3 )
!= $true )
| ( ( X2 @ X3 )
= $true ) )
& ? [X4: a] :
( ( ( $true
!= ( X1 @ X4 ) )
| ( $true
= ( X0 @ X4 ) ) )
& ( $true
!= ( X2 @ X4 ) )
& ( $true
= ( X1 @ X4 ) ) )
& ! [X5: a] :
( ( ( X1 @ X5 )
= $true )
| ( $true
!= ( X0 @ X5 ) ) )
& ! [X6: a] :
( ( $true
= ( X1 @ X6 ) )
| ( ( X2 @ X6 )
!= $true ) ) ),
inference(rectify,[],[f7]) ).
thf(f9,plain,
( ! [X3: a] :
( ( ( sK0 @ X3 )
!= $true )
| ( ( sK2 @ X3 )
= $true ) )
& ( ( ( sK1 @ sK3 )
!= $true )
| ( $true
= ( sK0 @ sK3 ) ) )
& ( ( sK2 @ sK3 )
!= $true )
& ( ( sK1 @ sK3 )
= $true )
& ! [X5: a] :
( ( ( sK1 @ X5 )
= $true )
| ( ( sK0 @ X5 )
!= $true ) )
& ! [X6: a] :
( ( ( sK1 @ X6 )
= $true )
| ( $true
!= ( sK2 @ X6 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X4,sK3)],[f8]) ).
thf(f12,plain,
( ( sK1 @ sK3 )
= $true ),
inference(cnf_transformation,[],[f9]) ).
thf(f13,plain,
( ( sK2 @ sK3 )
!= $true ),
inference(cnf_transformation,[],[f9]) ).
thf(f14,plain,
( ( ( sK1 @ sK3 )
!= $true )
| ( $true
= ( sK0 @ sK3 ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f15,plain,
! [X3: a] :
( ( ( sK0 @ X3 )
!= $true )
| ( ( sK2 @ X3 )
= $true ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f19,definition,
( spl4_1
<=> ( $true
= ( sK0 @ sK3 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
thf(f21,plain,
( ( $true
= ( sK0 @ sK3 ) )
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f19]) ).
thf(f23,definition,
( spl4_2
<=> ( ( sK1 @ sK3 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
thf(f26,plain,
( spl4_1
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f14,f23,f19]) ).
thf(f27,plain,
spl4_2,
inference(avatar_split_clause,[],[f12,f23]) ).
thf(f30,plain,
( ( ( sK2 @ sK3 )
= $true )
| ( $true != $true )
| ~ spl4_1 ),
inference(constrained_superposition,[],[f15,f21]) ).
thf(f31,plain,
( ( ( sK2 @ sK3 )
= $true )
| ~ spl4_1 ),
inference(trivial_inequality_removal,[],[f30]) ).
thf(f32,plain,
( $false
| ~ spl4_1 ),
inference(forward_subsumption_resolution,[],[f31,f13]) ).
thf(f33,plain,
~ spl4_1,
inference(avatar_contradiction_clause,[],[f32]) ).
cnf(s1,plain,
( spl4_1
| ~ spl4_2 ),
inference(sat_conversion,[],[f26]) ).
cnf(s2,plain,
spl4_2,
inference(sat_conversion,[],[f27]) ).
cnf(s3,plain,
~ spl4_1,
inference(sat_conversion,[],[f33]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s2,s3]) ).
thf(f34,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU846^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.16 % Computer : n002.cluster.edu
% 0.07/0.16 % Model : x86_64 x86_64
% 0.07/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.16 % Memory : 8046.5625MB
% 0.07/0.16 % OS : Linux 6.8.0-71-generic
% 0.07/0.16 % CPULimit : 300
% 0.07/0.16 % WCLimit : 300
% 0.07/0.16 % DateTime : Tue Sep 29 14:42:38 UTC 2026
% 0.07/0.17 % CPUTime :
% 0.07/0.17 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.20 Running higher-order theorem proving
% 0.07/0.21 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.24 % (1382880)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.07/0.24 % (1382890)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=1141368489:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.07/0.24 % (1382890) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1382880-1382890"...
% 0.07/0.24 % (1382890)...printing done.
% 0.07/0.24 % (1382890)Refutation found. Thanks to Tanya!
% 0.07/0.24 % SZS status Theorem for theBenchmark
% 0.07/0.24 % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.24 % (1382890)------------------------------
% 0.07/0.24 % (1382890)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.24 % (1382890)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.24 % (1382890)CaDiCaL version: 2.1.3
% 0.07/0.24 % (1382890)Termination reason: Refutation
% 0.07/0.24 % (1382890)Time elapsed: 0.001 s
% 0.07/0.24 % (1382890)Peak memory usage: 13 MB
% 0.07/0.24 % (1382890)Instructions burned: 2 (million)
% 0.07/0.24 % (1382880)Success in time 0.017 s
% 0.07/0.24 % Vampire exiting
%------------------------------------------------------------------------------