%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO135^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:41 AM UTC 2026
% Result : Theorem 0.21s 0.30s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 8 unt; 0 typ; 2 def)
% Number of atoms : 140 ( 25 equ; 0 cnn)
% Maximal formula atoms : 9 ( 5 avg)
% Number of connectives : 92 ( 18 ~; 20 |; 8 &; 40 @)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 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 : 11 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn 8 !; 0 ?; 8 :)
% 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 > $o ).
thf(f1,conjecture,
( ( ! [X0: $i] : ( cP @ X0 )
| ( cQ @ x ) )
=> ( ( cQ @ x )
| ( ( cP @ a )
& ( cP @ b ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cDUP_BUG) ).
thf(f2,negated_conjecture,
~ ( ( ! [X0: $i] : ( cP @ X0 )
| ( cQ @ x ) )
=> ( ( cQ @ x )
| ( ( cP @ a )
& ( cP @ b ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ( ( ! [X0: $i] : ( cP @ X0 )
| ( cQ @ x ) )
=> ( ( cQ @ x )
| ( ( cP @ a )
& ( cP @ b ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ( ( ( ( cQ @ x )
= $true )
| ! [X0: $i] :
( ( cP @ X0 )
= $true ) )
=> ( ( ( cQ @ x )
= $true )
| ( ( ( cP @ a )
= $true )
& ( ( cP @ b )
= $true ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
( ( ( cQ @ x )
!= $true )
& ( ( ( cP @ b )
!= $true )
| ( ( cP @ a )
!= $true ) )
& ( ( ( cQ @ x )
= $true )
| ! [X0: $i] :
( ( cP @ X0 )
= $true ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
( ( ( cQ @ x )
!= $true )
& ( ( ( cQ @ x )
= $true )
| ! [X0: $i] :
( ( cP @ X0 )
= $true ) )
& ( ( ( cP @ b )
!= $true )
| ( ( cP @ a )
!= $true ) ) ),
inference(flattening,[],[f5]) ).
thf(f7,plain,
( ( ( cP @ b )
!= $true )
| ( ( cP @ a )
!= $true ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f8,plain,
! [X0: $i] :
( ( ( cQ @ x )
= $true )
| ( ( cP @ X0 )
= $true ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f9,plain,
( ( cQ @ x )
!= $true ),
inference(cnf_transformation,[],[f6]) ).
thf(f12,plain,
! [X0: $i] :
( ( cP @ X0 )
= $true ),
inference(forward_subsumption_resolution,[],[f8,f9]) ).
thf(f14,definition,
( spl0_1
<=> ( ( cP @ b )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
thf(f15,plain,
( ( ( cP @ b )
!= $true )
| spl0_1 ),
inference(avatar_component_clause,[],[f14]) ).
thf(f17,definition,
( spl0_2
<=> ( ( cP @ a )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
thf(f18,plain,
( ( ( cP @ a )
!= $true )
| spl0_2 ),
inference(avatar_component_clause,[],[f17]) ).
thf(f19,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f7,f17,f14]) ).
thf(f20,plain,
( $false
| spl0_1 ),
inference(forward_subsumption_resolution,[],[f15,f12]) ).
thf(f21,plain,
spl0_1,
inference(avatar_contradiction_clause,[],[f20]) ).
thf(f22,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f18,f12]) ).
thf(f23,plain,
spl0_2,
inference(avatar_contradiction_clause,[],[f22]) ).
cnf(s1,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f19]) ).
cnf(s2,plain,
spl0_1,
inference(sat_conversion,[],[f21]) ).
cnf(s3,plain,
spl0_2,
inference(sat_conversion,[],[f23]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s3,s2]) ).
thf(f24,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO135^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.09/0.20 % Computer : n009.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.21 % CPULimit : 300
% 0.09/0.21 % WCLimit : 300
% 0.09/0.21 % DateTime : Tue Sep 29 16:35:01 UTC 2026
% 0.09/0.21 % CPUTime :
% 0.09/0.21 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.24 Running higher-order theorem proving
% 0.09/0.26 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.21/0.30 % (26632)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.30 % (26643)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.21/0.30 % (26642)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=2806347466:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.21/0.30 % (26643)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.21/0.30 % (26637)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3166953143:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.21/0.30 % (26638)lrs+10_16_si=on:nwc=1.5:random_seed=616397616:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.21/0.30 % (26641)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3090975236:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.21/0.30 % (26640)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=2284807533: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.21/0.30 % (26642) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-26632-26642"...
% 0.21/0.30 % (26641) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-26632-26641"...
% 0.21/0.30 % (26637) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-26632-26637"...
% 0.21/0.30 % (26638) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-26632-26638"...
% 0.21/0.30 % (26642)...printing done.
% 0.21/0.30 % (26640) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-26632-26640"...
% 0.21/0.30 % (26641)...printing done.
% 0.21/0.30 % (26642)Refutation found. Thanks to Tanya!
% 0.21/0.30 % SZS status Theorem for theBenchmark
% 0.21/0.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.30 % (26642)------------------------------
% 0.21/0.30 % (26642)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.30 % (26642)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.30 % (26642)CaDiCaL version: 2.1.3
% 0.21/0.30 % (26642)Termination reason: Refutation
% 0.21/0.30 % (26642)Time elapsed: 0.002 s
% 0.21/0.30 % (26642)Peak memory usage: 12 MB
% 0.21/0.30 % (26642)Instructions burned: 1 (million)
% 0.21/0.30 % (26632)Success in time 0.037 s
% 0.21/0.30 % Vampire exiting
%------------------------------------------------------------------------------