%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : CSR140^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 : n002.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:08 AM UTC 2026
% Result : Theorem 0.20s 0.28s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 5
% Syntax : Number of formulae : 46 ( 12 unt; 0 typ; 2 def)
% Number of atoms : 175 ( 46 equ; 0 cnn)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 157 ( 45 ~; 24 |; 4 &; 82 @)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 24 ( 24 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 15 usr; 9 con; 0-4 aty)
% Number of variables : 63 ( 0 sgn 43 !; 12 ?; 63 :)
% 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,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_13,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_14,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_15,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(f2,axiom,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_001) ).
thf(f7,axiom,
likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_006) ).
thf(f11,conjecture,
? [X0: $i > $i > $o,X1: $i,X2: $i] :
( ( X0 @ X1 @ lAnna_THFTYPE_i )
& ~ ( X0 @ X2 @ lAnna_THFTYPE_i ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
thf(f12,negated_conjecture,
~ ? [X0: $i > $i > $o,X1: $i,X2: $i] :
( ( X0 @ X1 @ lAnna_THFTYPE_i )
& ~ ( X0 @ X2 @ lAnna_THFTYPE_i ) ),
inference(negated_conjecture,[status(cth)],[f11]) ).
thf(f13,plain,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
inference(rectify,[],[f2]) ).
thf(f14,plain,
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) )
= $true ),
inference(fool_elimination,[],[f13]) ).
thf(f27,plain,
~ ? [X0: $i > $i > $o,X1: $i,X2: $i] :
( ( X0 @ X1 @ lAnna_THFTYPE_i )
& ~ ( X0 @ X2 @ lAnna_THFTYPE_i ) ),
inference(rectify,[],[f12]) ).
thf(f28,plain,
~ ? [X0: $i > $i > $o,X2: $i,X1: $i] :
( ( ( X0 @ X1 @ lAnna_THFTYPE_i )
= $true )
& ( ( ~ ( X0 @ X2 @ lAnna_THFTYPE_i ) )
= $true ) ),
inference(fool_elimination,[],[f27]) ).
thf(f29,plain,
likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i,
inference(rectify,[],[f7]) ).
thf(f30,plain,
( ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
= $true ),
inference(fool_elimination,[],[f29]) ).
thf(f35,plain,
! [X2: $i,X0: $i > $i > $o,X1: $i] :
( ( ( ~ ( X0 @ X2 @ lAnna_THFTYPE_i ) )
!= $true )
| ( ( X0 @ X1 @ lAnna_THFTYPE_i )
!= $true ) ),
inference(ennf_transformation,[],[f28]) ).
thf(f36,plain,
! [X0: $i,X1: $i > $i > $o,X2: $i] :
( ( $true
!= ( ~ ( X1 @ X0 @ lAnna_THFTYPE_i ) ) )
| ( $true
!= ( X1 @ X2 @ lAnna_THFTYPE_i ) ) ),
inference(rectify,[],[f35]) ).
thf(f37,plain,
( ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
= $true ),
inference(cnf_transformation,[],[f30]) ).
thf(f40,plain,
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) )
= $true ),
inference(cnf_transformation,[],[f14]) ).
thf(f45,plain,
! [X2: $i,X0: $i,X1: $i > $i > $o] :
( ( $true
!= ( X1 @ X2 @ lAnna_THFTYPE_i ) )
| ( $true
!= ( ~ ( X1 @ X0 @ lAnna_THFTYPE_i ) ) ) ),
inference(cnf_transformation,[],[f36]) ).
thf(f50,plain,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
= $false ),
inference(not_proxy_clausification,[],[f40]) ).
thf(f52,plain,
! [X2: $i,X0: $i,X1: $i > $i > $o] :
( ( $true
!= ( X1 @ X2 @ lAnna_THFTYPE_i ) )
| ( ( X1 @ X0 @ lAnna_THFTYPE_i )
= $true ) ),
inference(not_proxy_clausification,[],[f45]) ).
thf(f58,plain,
! [X2: $i,X3: $i > $i > $o,X0: $i] :
( ( $true
= ( ^ [Y0: $i,Y1: $i] :
~ ( X3 @ Y0 @ Y1 )
@ X0
@ lAnna_THFTYPE_i ) )
| ( $true
!= ( ^ [Y0: $i,Y1: $i] :
~ ( X3 @ Y0 @ Y1 )
@ X2
@ lAnna_THFTYPE_i ) ) ),
inference(primitive_instantiation,[],[f52]) ).
thf(f64,plain,
! [X2: $i,X3: $i > $i > $o,X0: $i] :
( ( $true
!= ( ~ ( X3 @ X2 @ lAnna_THFTYPE_i ) ) )
| ( $true
= ( ~ ( X3 @ X0 @ lAnna_THFTYPE_i ) ) ) ),
inference(beta-eta_normalization,[],[f58]) ).
thf(f65,plain,
! [X2: $i,X3: $i > $i > $o,X0: $i] :
( ( $true
= ( X3 @ X2 @ lAnna_THFTYPE_i ) )
| ( $true
= ( ~ ( X3 @ X0 @ lAnna_THFTYPE_i ) ) ) ),
inference(not_proxy_clausification,[],[f64]) ).
thf(f66,plain,
! [X2: $i,X3: $i > $i > $o,X0: $i] :
( ( $false
= ( X3 @ X0 @ lAnna_THFTYPE_i ) )
| ( $true
= ( X3 @ X2 @ lAnna_THFTYPE_i ) ) ),
inference(not_proxy_clausification,[],[f65]) ).
thf(f75,definition,
( spl0_1
<=> ! [X2: $i] : ( lAnna_THFTYPE_i != X2 ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
thf(f76,plain,
( ! [X2: $i] : ( lAnna_THFTYPE_i != X2 )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f75]) ).
thf(f78,definition,
( spl0_2
<=> ! [X0: $i] : ( lAnna_THFTYPE_i = X0 ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
thf(f79,plain,
( ! [X0: $i] : ( lAnna_THFTYPE_i = X0 )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f78]) ).
thf(f82,plain,
( ! [X0: $i,X1: $i] : ( X0 = X1 )
| ~ spl0_2 ),
inference(constrained_superposition,[],[f79,f79]) ).
thf(f88,plain,
! [X2: $i,X0: $i] :
( ( $true
= ( ^ [Y0: $i,Y1: $i] : ( Y0 = Y1 )
@ X2
@ lAnna_THFTYPE_i ) )
| ( $false
= ( ^ [Y0: $i,Y1: $i] : ( Y0 = Y1 )
@ X0
@ lAnna_THFTYPE_i ) ) ),
inference(primitive_instantiation,[],[f66]) ).
thf(f134,plain,
! [X2: $i,X0: $i] :
( ( $true
= ( X2 = lAnna_THFTYPE_i ) )
| ( ( X0 = lAnna_THFTYPE_i )
= $false ) ),
inference(beta-eta_normalization,[],[f88]) ).
thf(f135,plain,
! [X2: $i,X0: $i] :
( ( ( X0 = lAnna_THFTYPE_i )
= $false )
| ( lAnna_THFTYPE_i = X2 ) ),
inference(equality_proxy_clausification,[],[f134]) ).
thf(f136,plain,
! [X2: $i,X0: $i] :
( ( lAnna_THFTYPE_i != X0 )
| ( lAnna_THFTYPE_i = X2 ) ),
inference(equality_proxy_clausification,[],[f135]) ).
thf(f298,plain,
( ! [X0: $i] :
( $false
= ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0 ) )
| ~ spl0_2 ),
inference(constrained_superposition,[],[f50,f82]) ).
thf(f310,plain,
( ! [X0: $i] :
( $false
= ( likes_THFTYPE_IiioI @ lAnna_THFTYPE_i @ X0 ) )
| ~ spl0_2 ),
inference(forward_demodulation,[],[f298,f79]) ).
thf(f316,plain,
( ! [X0: $i,X1: $i] :
( $false
= ( likes_THFTYPE_IiioI @ X0 @ X1 ) )
| ~ spl0_2 ),
inference(constrained_superposition,[],[f310,f79]) ).
thf(f356,plain,
( ! [X0: $i] :
( $true
= ( likes_THFTYPE_IiioI @ X0 @ lBill_THFTYPE_i ) )
| ~ spl0_2 ),
inference(constrained_superposition,[],[f37,f82]) ).
thf(f394,plain,
( ( $false = $true )
| ~ spl0_2 ),
inference(forward_demodulation,[],[f356,f316]) ).
thf(f395,plain,
( $false
| ~ spl0_2 ),
inference(trivial_inequality_removal,[],[f394]) ).
thf(f396,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f395]) ).
thf(f399,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f136,f78,f75]) ).
thf(f401,plain,
( $false
| ~ spl0_1 ),
inference(equality_resolution,[],[f76]) ).
thf(f404,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f401]) ).
cnf(s13,plain,
~ spl0_2,
inference(sat_conversion,[],[f396]) ).
cnf(s16,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f399]) ).
cnf(s18,plain,
~ spl0_1,
inference(sat_conversion,[],[f404]) ).
cnf(s19,plain,
spl0_2,
inference(rat,[],[s16,s18]) ).
cnf(s20,plain,
$false,
inference(rat,[],[s13,s19]) ).
thf(f405,plain,
$false,
inference(avatar_sat_refutation,[],[s20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR140^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.19 % Computer : n002.cluster.edu
% 0.10/0.19 % Model : x86_64 x86_64
% 0.10/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19 % Memory : 8046.5625MB
% 0.10/0.19 % OS : Linux 6.8.0-71-generic
% 0.10/0.19 % CPULimit : 300
% 0.10/0.19 % WCLimit : 300
% 0.10/0.19 % DateTime : Tue Sep 29 17:59:08 UTC 2026
% 0.10/0.19 % CPUTime :
% 0.10/0.19 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.20/0.28 % (1641886)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.28 % (1641891)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3337951743:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.20/0.28 % (1641891) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1641886-1641891"...
% 0.20/0.28 % (1641891)...printing done.
% 0.20/0.28 % (1641891)Refutation found. Thanks to Tanya!
% 0.20/0.28 % SZS status Theorem for theBenchmark
% 0.20/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.28 % (1641891)------------------------------
% 0.20/0.28 % (1641891)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (1641891)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (1641891)CaDiCaL version: 2.1.3
% 0.20/0.28 % (1641891)Termination reason: Refutation
% 0.20/0.28 % (1641891)Time elapsed: 0.004 s
% 0.20/0.28 % (1641891)Peak memory usage: 13 MB
% 0.20/0.28 % (1641891)Instructions burned: 12 (million)
% 0.20/0.28 % (1641886)Success in time 0.032 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------