%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : CSR139^1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/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.21s 0.29s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 3
% Syntax : Number of formulae : 35 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 180 ( 74 equ; 8 cnn)
% Maximal formula atoms : 3 ( 5 avg)
% Number of connectives : 142 ( 38 ~; 24 |; 8 &; 72 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 42 ( 42 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 12 usr; 7 con; 0-4 aty)
% Number of variables : 69 ( 20 ^; 37 !; 12 ?; 69 :)
% 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,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $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(f1,axiom,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax) ).
thf(f2,axiom,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_001) ).
thf(f11,conjecture,
? [X2: $i,X1: $i > $i > $o,X0: $i > $i > $o] :
( ( X0 @ X2 @ lAnna_THFTYPE_i )
& ( X1 != X0 )
& ( X1 @ X2 @ lBill_THFTYPE_i ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
thf(f12,negated_conjecture,
~ ? [X2: $i,X1: $i > $i > $o,X0: $i > $i > $o] :
( ( X0 @ X2 @ lAnna_THFTYPE_i )
& ( X1 != X0 )
& ( X1 @ X2 @ lBill_THFTYPE_i ) ),
inference(negated_conjecture,[status(cth)],[f11]) ).
thf(f19,plain,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
inference(rectify,[],[f2]) ).
thf(f20,plain,
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) )
= $true ),
inference(fool_elimination,[],[f19]) ).
thf(f21,plain,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
inference(rectify,[],[f1]) ).
thf(f22,plain,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
= $true ),
inference(fool_elimination,[],[f21]) ).
thf(f23,plain,
~ ? [X0: $i,X1: $i > $i > $o,X2: $i > $i > $o] :
( ( X2 @ X0 @ lAnna_THFTYPE_i )
& ( X1 != X2 )
& ( X1 @ X0 @ lBill_THFTYPE_i ) ),
inference(rectify,[],[f12]) ).
thf(f24,plain,
~ ? [X1: $i > $i > $o,X0: $i,X2: $i > $i > $o] :
( ( $true
= ( X1 != X2 ) )
& ( $true
= ( X1 @ X0 @ lBill_THFTYPE_i ) )
& ( $true
= ( X2 @ X0 @ lAnna_THFTYPE_i ) ) ),
inference(fool_elimination,[],[f23]) ).
thf(f35,plain,
! [X2: $i > $i > $o,X1: $i > $i > $o,X0: $i] :
( ( $true
!= ( X1 @ X0 @ lBill_THFTYPE_i ) )
| ( $true
!= ( X2 @ X0 @ lAnna_THFTYPE_i ) )
| ( $true
!= ( X1 != X2 ) ) ),
inference(ennf_transformation,[],[f24]) ).
thf(f36,plain,
! [X0: $i > $i > $o,X1: $i > $i > $o,X2: $i] :
( ( ( X1 @ X2 @ lBill_THFTYPE_i )
!= $true )
| ( ( X0 @ X2 @ lAnna_THFTYPE_i )
!= $true )
| ( $true
!= ( X1 != X0 ) ) ),
inference(rectify,[],[f35]) ).
thf(f37,plain,
! [X2: $i,X0: $i > $i > $o,X1: $i > $i > $o] :
( ( ( X1 @ X2 @ lBill_THFTYPE_i )
!= $true )
| ( $true
!= ( X1 != X0 ) )
| ( ( X0 @ X2 @ lAnna_THFTYPE_i )
!= $true ) ),
inference(cnf_transformation,[],[f36]) ).
thf(f38,plain,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
= $true ),
inference(cnf_transformation,[],[f22]) ).
thf(f41,plain,
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) )
= $true ),
inference(cnf_transformation,[],[f20]) ).
thf(f49,plain,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
= $false ),
inference(not_proxy_clausification,[],[f41]) ).
thf(f52,plain,
! [X2: $i,X0: $i > $i > $o,X1: $i > $i > $o] :
( ( $true
= ( X1 = X0 ) )
| ( ( X1 @ X2 @ lBill_THFTYPE_i )
!= $true )
| ( ( X0 @ X2 @ lAnna_THFTYPE_i )
!= $true ) ),
inference(not_proxy_clausification,[],[f37]) ).
thf(f53,plain,
! [X2: $i,X0: $i > $i > $o,X1: $i > $i > $o] :
( ( ( X0 @ X2 @ lAnna_THFTYPE_i )
!= $true )
| ( X0 = X1 )
| ( ( X1 @ X2 @ lBill_THFTYPE_i )
!= $true ) ),
inference(equality_proxy_clausification,[],[f52]) ).
thf(f54,plain,
! [X2: $i,X1: $i > $i > $o] :
( ( ( X1 @ X2 @ lBill_THFTYPE_i )
!= $true )
| ( $true
!= ( ^ [Y0: $i,Y1: $i] : ( Y0 = Y1 )
@ X2
@ lAnna_THFTYPE_i ) )
| ( ( ^ [Y0: $i,Y1: $i] : ( Y0 = Y1 ) )
= X1 ) ),
inference(primitive_instantiation,[],[f53]) ).
thf(f65,plain,
! [X2: $i,X1: $i > $i > $o] :
( ( (=) = X1 )
| ( $true
!= ( X2 = lAnna_THFTYPE_i ) )
| ( ( X1 @ X2 @ lBill_THFTYPE_i )
!= $true ) ),
inference(beta-eta_normalization,[],[f54]) ).
thf(f66,plain,
! [X2: $i,X1: $i > $i > $o] :
( ( ( X1 @ X2 @ lBill_THFTYPE_i )
!= $true )
| ( lAnna_THFTYPE_i != X2 )
| ( (=) = X1 ) ),
inference(equality_proxy_clausification,[],[f65]) ).
thf(f77,plain,
! [X2: $i] :
( ( ( ^ [Y0: $i,Y1: $i] : $true )
= (=) )
| ( $true
!= ( ^ [Y0: $i,Y1: $i] : $true
@ X2
@ lBill_THFTYPE_i ) )
| ( lAnna_THFTYPE_i != X2 ) ),
inference(imitation,[],[f66]) ).
thf(f83,plain,
! [X2: $i] :
( ( lAnna_THFTYPE_i != X2 )
| ( ( ^ [Y0: $i,Y1: $i] : $true )
= (=) )
| ( $true != $true ) ),
inference(beta-eta_normalization,[],[f77]) ).
thf(f84,plain,
! [X2: $i] :
( ( lAnna_THFTYPE_i != X2 )
| ( ( ^ [Y0: $i,Y1: $i] : $true )
= (=) ) ),
inference(trivial_inequality_removal,[],[f83]) ).
thf(f91,plain,
( ( ^ [Y0: $i,Y1: $i] : $true )
= (=) ),
inference(equality_resolution,[],[f84]) ).
thf(f93,plain,
! [X1: $i] :
( ( (=) @ X1 )
= ( ^ [Y0: $i,Y1: $i] : $true
@ X1 ) ),
inference(argument_congruence,[],[f91]) ).
thf(f94,plain,
! [X1: $i] :
( ( (=) @ X1 )
= ( ^ [Y0: $i] : $true ) ),
inference(beta-eta_normalization,[],[f93]) ).
thf(f95,plain,
! [X2: $i,X1: $i] :
( ( X1 = X2 )
= ( ^ [Y0: $i] : $true
@ X2 ) ),
inference(argument_congruence,[],[f94]) ).
thf(f96,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ^ [Y0: $i] : $true
@ X2 ) )
| ( $true
= ( X1 = X2 ) ) ),
inference(iff_proxy_clausification,[],[f95]) ).
thf(f100,plain,
! [X2: $i,X1: $i] :
( ( X1 = X2 )
| ( $false
= ( ^ [Y0: $i] : $true
@ X2 ) ) ),
inference(equality_proxy_clausification,[],[f96]) ).
thf(f101,plain,
! [X2: $i,X1: $i] :
( ( X1 = X2 )
| ( $true = $false ) ),
inference(beta-eta_normalization,[],[f100]) ).
thf(f102,plain,
! [X2: $i,X1: $i] : ( X1 = X2 ),
inference(trivial_inequality_removal,[],[f101]) ).
thf(f107,plain,
! [X0: $i] :
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0 )
= $true ),
inference(superposition,[],[f38,f102]) ).
thf(f181,plain,
$true = $false,
inference(forward_demodulation,[],[f49,f107]) ).
thf(f182,plain,
$false,
inference(trivial_inequality_removal,[],[f181]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR139^1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.18 % Computer : n001.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.18 % CPULimit : 300
% 0.10/0.18 % WCLimit : 300
% 0.10/0.18 % DateTime : Tue Sep 29 18:02:06 UTC 2026
% 0.10/0.18 % CPUTime :
% 0.10/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.22 Running higher-order theorem proving
% 0.10/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.21/0.29 % (1608710)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.29 % (1608728)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=1079174299:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.21/0.29 % (1608734)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.29 % (1608734)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.29 % (1608732)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3703485369:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.21/0.29 % (1608729)lrs+10_16_si=on:nwc=1.5:random_seed=1600831198:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.21/0.29 % (1608730)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=177373300:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.21/0.29 % (1608731)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=823140139: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.29 % (1608733)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=33097805:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.21/0.29 % (1608734)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=3394584406:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.21/0.29 % (1608730)Refutation not found, incomplete strategy
% 0.21/0.29 % (1608730)------------------------------
% 0.21/0.29 % (1608730)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29 % (1608730)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29 % (1608730)CaDiCaL version: 2.1.3
% 0.21/0.29 % (1608730)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.29 % (1608730)Time elapsed: 0.002 s
% 0.21/0.29 % (1608730)Peak memory usage: 12 MB
% 0.21/0.29 % (1608730)Instructions burned: 2 (million)
% 0.21/0.29 % (1608730)------------------------------
% 0.21/0.29 % (1608730)------------------------------
% 0.21/0.29 % (1608732) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1608710-1608732"...
% 0.21/0.29 % (1608732)...printing done.
% 0.21/0.29 % (1608732)Refutation found. Thanks to Tanya!
% 0.21/0.29 % SZS status Theorem for theBenchmark
% 0.21/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.29 % (1608732)------------------------------
% 0.21/0.29 % (1608732)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29 % (1608732)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29 % (1608732)CaDiCaL version: 2.1.3
% 0.21/0.29 % (1608732)Termination reason: Refutation
% 0.21/0.29 % (1608732)Time elapsed: 0.006 s
% 0.21/0.29 % (1608732)Peak memory usage: 12 MB
% 0.21/0.29 % (1608732)Instructions burned: 9 (million)
% 0.21/0.29 % (1608710)Success in time 0.05 s
% 0.21/0.29 % Vampire exiting
%------------------------------------------------------------------------------