%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO146^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 : n019.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:43 AM UTC 2026
% Result : Theorem 0.24s 0.27s
% Output : Refutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 4
% Syntax : Number of formulae : 33 ( 7 unt; 0 typ; 3 def)
% Number of atoms : 194 ( 32 equ; 0 cnn)
% Maximal formula atoms : 10 ( 5 avg)
% Number of connectives : 141 ( 23 ~; 33 |; 8 &; 70 @)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 12 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn 14 !; 0 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_1,type,
cQ: $i > $o ).
thf(func_def_3,type,
cP: $i > $i > $o ).
thf(f1,conjecture,
( ! [X0: $i] :
( ( cQ @ X0 )
| ! [X1: $i] : ( cP @ X0 @ X1 ) )
=> ( ( ( cP @ a @ c )
& ( cP @ a @ b ) )
| ( cQ @ a ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cDUP_EXPL_1) ).
thf(f2,negated_conjecture,
~ ( ! [X0: $i] :
( ( cQ @ X0 )
| ! [X1: $i] : ( cP @ X0 @ X1 ) )
=> ( ( ( cP @ a @ c )
& ( cP @ a @ b ) )
| ( cQ @ a ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ( ! [X0: $i] :
( ( cQ @ X0 )
| ! [X1: $i] : ( cP @ X0 @ X1 ) )
=> ( ( ( cP @ a @ c )
& ( cP @ a @ b ) )
| ( cQ @ a ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ( ! [X0: $i] :
( ( ( cQ @ X0 )
= $true )
| ! [X1: $i] :
( ( cP @ X0 @ X1 )
= $true ) )
=> ( ( ( ( cP @ a @ b )
= $true )
& ( ( cP @ a @ c )
= $true ) )
| ( ( cQ @ a )
= $true ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
( ( ( ( cP @ a @ b )
!= $true )
| ( ( cP @ a @ c )
!= $true ) )
& ( ( cQ @ a )
!= $true )
& ! [X0: $i] :
( ( ( cQ @ X0 )
= $true )
| ! [X1: $i] :
( ( cP @ X0 @ X1 )
= $true ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
( ! [X0: $i] :
( ( ( cQ @ X0 )
= $true )
| ! [X1: $i] :
( ( cP @ X0 @ X1 )
= $true ) )
& ( ( ( cP @ a @ b )
!= $true )
| ( ( cP @ a @ c )
!= $true ) )
& ( ( cQ @ a )
!= $true ) ),
inference(flattening,[],[f5]) ).
thf(f7,plain,
( ( cQ @ a )
!= $true ),
inference(cnf_transformation,[],[f6]) ).
thf(f8,plain,
( ( ( cP @ a @ b )
!= $true )
| ( ( cP @ a @ c )
!= $true ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f9,plain,
! [X0: $i,X1: $i] :
( ( ( cP @ X0 @ X1 )
= $true )
| ( ( cQ @ X0 )
= $true ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f12,definition,
( spl0_1
<=> ( ( cQ @ a )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
thf(f14,plain,
( ( ( cQ @ a )
!= $true )
| spl0_1 ),
inference(avatar_component_clause,[],[f12]) ).
thf(f15,plain,
~ spl0_1,
inference(avatar_split_clause,[],[f7,f12]) ).
thf(f17,definition,
( spl0_2
<=> ( ( cP @ a @ b )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
thf(f19,plain,
( ( ( cP @ a @ b )
!= $true )
| spl0_2 ),
inference(avatar_component_clause,[],[f17]) ).
thf(f21,definition,
( spl0_3
<=> ( ( cP @ a @ c )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
thf(f23,plain,
( ( ( cP @ a @ c )
!= $true )
| spl0_3 ),
inference(avatar_component_clause,[],[f21]) ).
thf(f24,plain,
( ~ spl0_2
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f8,f21,f17]) ).
thf(f25,plain,
( ( ( cQ @ a )
= $true )
| ( $true != $true )
| spl0_2 ),
inference(superposition,[],[f19,f9]) ).
thf(f26,plain,
( ( ( cQ @ a )
= $true )
| spl0_2 ),
inference(trivial_inequality_removal,[],[f25]) ).
thf(f27,plain,
( $false
| spl0_1
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f26,f14]) ).
thf(f28,plain,
( spl0_1
| spl0_2 ),
inference(avatar_contradiction_clause,[],[f27]) ).
thf(f29,plain,
( ( ( cQ @ a )
= $true )
| ( $true != $true )
| spl0_3 ),
inference(superposition,[],[f23,f9]) ).
thf(f30,plain,
( ( ( cQ @ a )
= $true )
| spl0_3 ),
inference(trivial_inequality_removal,[],[f29]) ).
thf(f31,plain,
( $false
| spl0_1
| spl0_3 ),
inference(forward_subsumption_resolution,[],[f30,f14]) ).
thf(f32,plain,
( spl0_1
| spl0_3 ),
inference(avatar_contradiction_clause,[],[f31]) ).
cnf(s1,plain,
~ spl0_1,
inference(sat_conversion,[],[f15]) ).
cnf(s2,plain,
( ~ spl0_2
| ~ spl0_3 ),
inference(sat_conversion,[],[f24]) ).
cnf(s3,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f28]) ).
cnf(s4,plain,
( spl0_1
| spl0_3 ),
inference(sat_conversion,[],[f32]) ).
cnf(s5,plain,
spl0_3,
inference(rat,[],[s4,s1]) ).
cnf(s6,plain,
spl0_2,
inference(rat,[],[s3,s1]) ).
cnf(s7,plain,
$false,
inference(rat,[],[s2,s5,s6]) ).
thf(f33,plain,
$false,
inference(avatar_sat_refutation,[],[s7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO146^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.09/0.20 % Computer : n019.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Tue Sep 29 16:35:18 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running higher-order theorem proving
% 0.09/0.25 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.24/0.27 % (1015257)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.24/0.27 % (1015265)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=3898256723:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.24/0.27 % (1015265) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1015257-1015265"...
% 0.24/0.27 % (1015265)...printing done.
% 0.24/0.27 % (1015265)Refutation found. Thanks to Tanya!
% 0.24/0.27 % SZS status Theorem for theBenchmark
% 0.24/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.24/0.27 % (1015265)------------------------------
% 0.24/0.27 % (1015265)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.27 % (1015265)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.27 % (1015265)CaDiCaL version: 2.1.3
% 0.24/0.27 % (1015265)Termination reason: Refutation
% 0.24/0.27 % (1015265)Time elapsed: 0.001 s
% 0.24/0.27 % (1015265)Peak memory usage: 13 MB
% 0.24/0.27 % (1015265)Instructions burned: 2 (million)
% 0.24/0.27 % (1015257)Success in time 0.018 s
% 0.24/0.27 % Vampire exiting
%------------------------------------------------------------------------------