%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO083^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 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:46:35 AM UTC 2026
% Result : Theorem 0.20s 0.28s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 7 unt; 0 typ; 2 def)
% Number of atoms : 90 ( 15 equ; 0 cnn)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 82 ( 17 ~; 14 |; 1 &; 44 @)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 6 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn 18 !; 4 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
cP: $i > $i > $o ).
thf(f1,conjecture,
( ( ! [X0: $i] : ( cP @ cA @ X0 )
| ! [X1: $i] : ( cP @ X1 @ cB ) )
=> ? [X2: $i] : ( cP @ X2 @ X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM62) ).
thf(f2,negated_conjecture,
~ ( ( ! [X0: $i] : ( cP @ cA @ X0 )
| ! [X1: $i] : ( cP @ X1 @ cB ) )
=> ? [X2: $i] : ( cP @ X2 @ X2 ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ( ( ! [X0: $i] : ( cP @ cA @ X0 )
| ! [X1: $i] : ( cP @ X1 @ cB ) )
=> ? [X2: $i] : ( cP @ X2 @ X2 ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ( ( ! [X0: $i] :
( ( cP @ cA @ X0 )
= $true )
| ! [X1: $i] :
( ( cP @ X1 @ cB )
= $true ) )
=> ? [X2: $i] :
( ( cP @ X2 @ X2 )
= $true ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
( ( ! [X0: $i] :
( ( cP @ cA @ X0 )
= $true )
| ! [X1: $i] :
( ( cP @ X1 @ cB )
= $true ) )
& ! [X2: $i] :
( ( cP @ X2 @ X2 )
!= $true ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
! [X2: $i] :
( ( cP @ X2 @ X2 )
!= $true ),
inference(cnf_transformation,[],[f5]) ).
thf(f7,plain,
! [X0: $i,X1: $i] :
( ( ( cP @ cA @ X0 )
= $true )
| ( ( cP @ X1 @ cB )
= $true ) ),
inference(cnf_transformation,[],[f5]) ).
thf(f11,definition,
( spl0_1
<=> ! [X0: $i] :
( ( cP @ cA @ X0 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
thf(f12,plain,
( ! [X0: $i] :
( ( cP @ cA @ X0 )
= $true )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f11]) ).
thf(f14,definition,
( spl0_2
<=> ! [X1: $i] :
( ( cP @ X1 @ cB )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
thf(f15,plain,
( ! [X1: $i] :
( ( cP @ X1 @ cB )
= $true )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f14]) ).
thf(f16,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f7,f14,f11]) ).
thf(f17,plain,
( ( $true != $true )
| ~ spl0_2 ),
inference(constrained_superposition,[],[f6,f15]) ).
thf(f18,plain,
( $false
| ~ spl0_2 ),
inference(trivial_inequality_removal,[],[f17]) ).
thf(f19,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f18]) ).
thf(f20,plain,
( ( $true != $true )
| ~ spl0_1 ),
inference(constrained_superposition,[],[f6,f12]) ).
thf(f21,plain,
( $false
| ~ spl0_1 ),
inference(trivial_inequality_removal,[],[f20]) ).
thf(f22,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f21]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f16]) ).
cnf(s2,plain,
~ spl0_2,
inference(sat_conversion,[],[f19]) ).
cnf(s3,plain,
~ spl0_1,
inference(sat_conversion,[],[f22]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s2,s3]) ).
thf(f23,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO083^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n009.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 16:33:15 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/0.23 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.28 % (21126)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.28 % (21131)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=1599052059:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.20/0.28 % (21131) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-21126-21131"...
% 0.20/0.28 % (21131)...printing done.
% 0.20/0.28 % (21131)Refutation found. Thanks to Tanya!
% 0.20/0.28 % SZS status Theorem for theBenchmark
% 0.20/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.28 % (21131)------------------------------
% 0.20/0.28 % (21131)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (21131)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (21131)CaDiCaL version: 2.1.3
% 0.20/0.28 % (21131)Termination reason: Refutation
% 0.20/0.28 % (21131)Time elapsed: 0.001 s
% 0.20/0.28 % (21131)Peak memory usage: 13 MB
% 0.20/0.28 % (21131)Instructions burned: 1 (million)
% 0.20/0.28 % (21126)Success in time 0.042 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------