%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : CSR136^2 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.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 07:47:07 AM UTC 2026
% Result : Theorem 0.11s 0.26s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 7
% Syntax : Number of formulae : 45 ( 16 unt; 0 typ; 3 def)
% Number of atoms : 242 ( 43 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 239 ( 51 ~; 31 |; 8 &; 136 @)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 22 ( 22 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 15 usr; 9 con; 0-4 aty)
% ( 10 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 35 ( 0 sgn 19 !; 4 ?; 35 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
num: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_6,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(func_def_7,type,
parent_THFTYPE_IiioI: $i > $i > $o ).
thf(func_def_9,type,
vNOT: $o > $o ).
thf(func_def_12,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_13,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_14,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_15,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_17,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(f1,axiom,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax) ).
thf(f4,axiom,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_003) ).
thf(f5,axiom,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_004) ).
thf(f12,conjecture,
? [X0: $i > $i > $o] :
( ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ( X0 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ~ ! [X1: $i,X2: $i] : ( X0 @ X1 @ X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
thf(f13,negated_conjecture,
~ ? [X0: $i > $i > $o] :
( ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ( X0 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ~ ! [X1: $i,X2: $i] : ( X0 @ X1 @ X2 ) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
thf(f18,plain,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
inference(rectify,[],[f4]) ).
thf(f19,plain,
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) )
= $true ),
inference(fool_elimination,[],[f18]) ).
thf(f26,plain,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
inference(rectify,[],[f5]) ).
thf(f27,plain,
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
= $true ),
inference(fool_elimination,[],[f26]) ).
thf(f32,plain,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
inference(rectify,[],[f1]) ).
thf(f33,plain,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
= $true ),
inference(fool_elimination,[],[f32]) ).
thf(f34,plain,
~ ? [X0: $i > $i > $o] :
( ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ( X0 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ~ ! [X1: $i,X2: $i] : ( X0 @ X1 @ X2 ) ),
inference(rectify,[],[f13]) ).
thf(f35,plain,
~ ? [X0: $i > $i > $o] :
( ( ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
= $true )
& ( ( X0 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
= $true )
& ( $true
= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( X0 @ Y1 @ Y0 ) ) ) ) ) ),
inference(fool_elimination,[],[f34]) ).
thf(f38,plain,
! [X0: $i > $i > $o] :
( ( $true
!= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( X0 @ Y1 @ Y0 ) ) ) ) )
| ( ( X0 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= $true )
| ( ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
!= $true ) ),
inference(ennf_transformation,[],[f35]) ).
thf(f43,plain,
! [X0: $i > $i > $o] :
( ( $true
!= ( ~ ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( X0 @ Y1 @ Y0 ) ) ) ) )
| ( ( X0 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= $true )
| ( ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
!= $true ) ),
inference(cnf_transformation,[],[f38]) ).
thf(f45,plain,
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
= $true ),
inference(cnf_transformation,[],[f27]) ).
thf(f47,plain,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
= $true ),
inference(cnf_transformation,[],[f33]) ).
thf(f48,plain,
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) )
= $true ),
inference(cnf_transformation,[],[f19]) ).
thf(f52,plain,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
= $false ),
inference(not_proxy_clausification,[],[f48]) ).
thf(f54,plain,
! [X0: $i > $i > $o] :
( ( ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
!= $true )
| ( ( X0 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= $true )
| ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( X0 @ Y1 @ Y0 ) ) ) ) ),
inference(not_proxy_clausification,[],[f43]) ).
thf(f55,plain,
! [X0: $i > $i > $o,X1: $i] :
( ( ( X0 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= $true )
| ( ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( X0 @ Y1 @ Y0 ) )
@ X1 )
= $true )
| ( ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
!= $true ) ),
inference(pi_proxy_clausification,[],[f54]) ).
thf(f56,plain,
! [X0: $i > $i > $o,X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] : ( X0 @ Y0 @ X1 ) ) )
| ( ( X0 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= $true )
| ( ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
!= $true ) ),
inference(beta-eta_normalization,[],[f55]) ).
thf(f57,plain,
! [X2: $i,X0: $i > $i > $o,X1: $i] :
( ( $true
= ( ^ [Y0: $i] : ( X0 @ Y0 @ X1 )
@ X2 ) )
| ( ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
!= $true )
| ( ( X0 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= $true ) ),
inference(pi_proxy_clausification,[],[f56]) ).
thf(f58,plain,
! [X2: $i,X0: $i > $i > $o,X1: $i] :
( ( $true
= ( X0 @ X2 @ X1 ) )
| ( ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
!= $true )
| ( ( X0 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= $true ) ),
inference(beta-eta_normalization,[],[f57]) ).
thf(f70,definition,
( spl0_3
<=> ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
thf(f72,plain,
( ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
= $true )
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f70]) ).
thf(f73,plain,
spl0_3,
inference(avatar_split_clause,[],[f45,f70]) ).
thf(f80,definition,
( spl0_5
<=> ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
thf(f82,plain,
( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
= $false )
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f80]) ).
thf(f83,plain,
spl0_5,
inference(avatar_split_clause,[],[f52,f80]) ).
thf(f85,definition,
( spl0_6
<=> ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
thf(f87,plain,
( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
= $true )
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f85]) ).
thf(f88,plain,
spl0_6,
inference(avatar_split_clause,[],[f47,f85]) ).
thf(f104,plain,
( ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
!= $true )
| ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= $true )
| ( $false = $true )
| ~ spl0_5 ),
inference(superposition,[],[f58,f82]) ).
thf(f126,plain,
( ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
!= $true )
| ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= $true )
| ~ spl0_5 ),
inference(trivial_inequality_removal,[],[f104]) ).
thf(f144,plain,
( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= $true )
| ~ spl0_3
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f126,f72]) ).
thf(f147,plain,
( $false
| ~ spl0_3
| ~ spl0_5
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f144,f87]) ).
thf(f148,plain,
( ~ spl0_3
| ~ spl0_5
| ~ spl0_6 ),
inference(avatar_contradiction_clause,[],[f147]) ).
cnf(s3,plain,
spl0_3,
inference(sat_conversion,[],[f73]) ).
cnf(s5,plain,
spl0_5,
inference(sat_conversion,[],[f83]) ).
cnf(s6,plain,
spl0_6,
inference(sat_conversion,[],[f88]) ).
cnf(s15,plain,
( ~ spl0_3
| ~ spl0_5
| ~ spl0_6 ),
inference(sat_conversion,[],[f148]) ).
cnf(s16,plain,
~ spl0_3,
inference(rat,[],[s15,s6,s5]) ).
cnf(s17,plain,
$false,
inference(rat,[],[s3,s16]) ).
thf(f149,plain,
$false,
inference(avatar_sat_refutation,[],[s17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR136^2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.18 % Computer : n001.cluster.edu
% 0.11/0.18 % Model : x86_64 x86_64
% 0.11/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.18 % Memory : 8046.5625MB
% 0.11/0.18 % OS : Linux 6.8.0-71-generic
% 0.11/0.18 % CPULimit : 300
% 0.11/0.18 % WCLimit : 300
% 0.11/0.18 % DateTime : Tue Sep 29 18:01:51 UTC 2026
% 0.11/0.18 % CPUTime :
% 0.11/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.20 Running higher-order theorem proving
% 0.11/0.22 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.11/0.26 % (1607817)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.11/0.26 % (1607826)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=462814330:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.11/0.26 % (1607824)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1479845986:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.11/0.26 % (1607823)lrs+10_16_si=on:nwc=1.5:random_seed=503208583:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.11/0.26 % (1607825)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=607505584: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.11/0.26 % (1607826)Instruction limit reached!
% 0.11/0.26 % (1607826)------------------------------
% 0.11/0.26 % (1607826)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.26 % (1607826)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.26 % (1607826)CaDiCaL version: 2.1.3
% 0.11/0.26 % (1607826)Termination reason: Instruction limit
% 0.11/0.26 % (1607826)Termination phase: Saturation
% 0.11/0.26 % (1607826)Time elapsed: 0.008 s
% 0.11/0.26 % (1607826)Peak memory usage: 11 MB
% 0.11/0.26 % (1607826)Instructions burned: 26 (million)
% 0.11/0.26 % (1607822)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=600681126:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.11/0.26 % (1607824)Refutation not found, incomplete strategy
% 0.11/0.26 % (1607824)------------------------------
% 0.11/0.26 % (1607824)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.26 % (1607824)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.26 % (1607824)CaDiCaL version: 2.1.3
% 0.11/0.26 % (1607824)Termination reason: Refutation not found, incomplete strategy
% 0.11/0.26 % (1607824)Time elapsed: 0.002 s
% 0.11/0.26 % (1607824)Peak memory usage: 12 MB
% 0.11/0.26 % (1607824)Instructions burned: 2 (million)
% 0.11/0.26 % (1607824)------------------------------
% 0.11/0.26 % (1607824)------------------------------
% 0.11/0.26 % (1607825) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1607817-1607825"...
% 0.11/0.26 % (1607828)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.11/0.26 % (1607828)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.11/0.26 % (1607825)...printing done.
% 0.11/0.26 % (1607822) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1607817-1607822"...
% 0.11/0.26 % (1607828)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=919928281:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.11/0.26 % (1607825)Refutation found. Thanks to Tanya!
% 0.11/0.26 % SZS status Theorem for theBenchmark
% 0.11/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.27 % (1607825)------------------------------
% 0.11/0.27 % (1607825)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.27 % (1607825)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.27 % (1607825)CaDiCaL version: 2.1.3
% 0.11/0.27 % (1607825)Termination reason: Refutation
% 0.11/0.27 % (1607825)Time elapsed: 0.004 s
% 0.11/0.27 % (1607825)Peak memory usage: 13 MB
% 0.11/0.27 % (1607825)Instructions burned: 5 (million)
% 0.11/0.27 % (1607817)Success in time 0.038 s
% 0.11/0.27 % Vampire exiting
%------------------------------------------------------------------------------