%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : CSR135^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 : n006.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:06 AM UTC 2026
% Result : Theorem 0.11s 0.27s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 10 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 56 ( 11 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 48 ( 12 ~; 4 |; 4 &; 28 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 5 con; 0-4 aty)
% Number of variables : 10 ( 4 ^; 2 !; 4 ?; 10 :)
% 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_13,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_14,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_15,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_16,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(f9,conjecture,
? [X0: $i > $i > $o] :
( ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ( X0 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
thf(f10,negated_conjecture,
~ ? [X0: $i > $i > $o] :
( ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ( X0 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(negated_conjecture,[status(cth)],[f9]) ).
thf(f11,plain,
~ ? [X0: $i > $i > $o] :
( ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ( X0 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(rectify,[],[f10]) ).
thf(f12,plain,
~ ? [X0: $i > $i > $o] :
( ( ( X0 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
= $true )
& ( ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
= $true ) ),
inference(fool_elimination,[],[f11]) ).
thf(f29,plain,
! [X0: $i > $i > $o] :
( ( ( X0 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= $true )
| ( ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
!= $true ) ),
inference(ennf_transformation,[],[f12]) ).
thf(f38,plain,
! [X0: $i > $i > $o] :
( ( ( X0 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
!= $true )
| ( ( X0 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
!= $true ) ),
inference(cnf_transformation,[],[f29]) ).
thf(f86,plain,
( ( $true
!= ( ^ [Y0: $i,Y1: $i] : $true
@ lMary_THFTYPE_i
@ lBill_THFTYPE_i ) )
| ( $true
!= ( ^ [Y0: $i,Y1: $i] : $true
@ lSue_THFTYPE_i
@ lBill_THFTYPE_i ) ) ),
inference(imitation,[],[f38]) ).
thf(f90,plain,
( ( $true != $true )
| ( $true != $true ) ),
inference(beta-eta_normalization,[],[f86]) ).
thf(f91,plain,
$true != $true,
inference(duplicate_literal_removal,[],[f90]) ).
thf(f92,plain,
$false,
inference(trivial_inequality_removal,[],[f91]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR135^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.11/0.18 % Computer : n006.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 17:55:39 UTC 2026
% 0.11/0.18 % CPUTime :
% 0.11/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.22 Running higher-order theorem proving
% 0.11/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.11/0.27 % (1093188)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.11/0.27 % (1093196)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=704792125: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.27 % (1093196) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1093188-1093196"...
% 0.11/0.27 % (1093196)...printing done.
% 0.11/0.27 % (1093199)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.27 % (1093199)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.27 % (1093196)Refutation found. Thanks to Tanya!
% 0.11/0.27 % SZS status Theorem for theBenchmark
% 0.11/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.27 % (1093196)------------------------------
% 0.11/0.27 % (1093196)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.27 % (1093196)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.27 % (1093196)CaDiCaL version: 2.1.3
% 0.11/0.27 % (1093196)Termination reason: Refutation
% 0.11/0.27 % (1093196)Time elapsed: 0.001 s
% 0.11/0.27 % (1093196)Peak memory usage: 12 MB
% 0.11/0.27 % (1093196)Instructions burned: 2 (million)
% 0.11/0.27 % (1093188)Success in time 0.034 s
% 0.11/0.27 % Vampire exiting
%------------------------------------------------------------------------------