%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : CSR140^1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n026.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:19 AM UTC 2026
% Result : Theorem 0.22s 0.29s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 5
% Syntax : Number of formulae : 44 ( 11 unt; 0 typ; 2 def)
% Number of atoms : 191 ( 48 equ; 0 cnn)
% Maximal formula atoms : 5 ( 4 avg)
% Number of connectives : 179 ( 50 ~; 31 |; 4 &; 92 @)
% ( 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 : 17 ( 14 usr; 8 con; 0-4 aty)
% Number of variables : 60 ( 2 sgn 36 !; 12 ?; 60 :)
% 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(f4,axiom,
parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBen_THFTYPE_i,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_003) ).
thf(f10,axiom,
~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_009) ).
thf(f11,conjecture,
? [X0: $i > $i > $o,X1: $i,X2: $i] :
( ~ ( X0 @ X2 @ lAnna_THFTYPE_i )
& ( X0 @ X1 @ lAnna_THFTYPE_i ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
thf(f12,negated_conjecture,
~ ? [X0: $i > $i > $o,X1: $i,X2: $i] :
( ~ ( X0 @ X2 @ lAnna_THFTYPE_i )
& ( X0 @ X1 @ lAnna_THFTYPE_i ) ),
inference(negated_conjecture,[status(cth)],[f11]) ).
thf(f19,plain,
parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBen_THFTYPE_i,
inference(rectify,[],[f4]) ).
thf(f20,plain,
( ( parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBen_THFTYPE_i )
= $true ),
inference(fool_elimination,[],[f19]) ).
thf(f31,plain,
~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ),
inference(rectify,[],[f10]) ).
thf(f32,plain,
( ( ~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ) )
= $true ),
inference(fool_elimination,[],[f31]) ).
thf(f33,plain,
~ ? [X0: $i > $i > $o,X1: $i,X2: $i] :
( ~ ( X0 @ X2 @ lAnna_THFTYPE_i )
& ( X0 @ X1 @ lAnna_THFTYPE_i ) ),
inference(rectify,[],[f12]) ).
thf(f34,plain,
~ ? [X0: $i > $i > $o,X1: $i,X2: $i] :
( ( ( ~ ( X0 @ X2 @ lAnna_THFTYPE_i ) )
= $true )
& ( ( X0 @ X1 @ lAnna_THFTYPE_i )
= $true ) ),
inference(fool_elimination,[],[f33]) ).
thf(f35,plain,
! [X0: $i > $i > $o,X1: $i,X2: $i] :
( ( ( ~ ( X0 @ X2 @ lAnna_THFTYPE_i ) )
!= $true )
| ( ( X0 @ X1 @ lAnna_THFTYPE_i )
!= $true ) ),
inference(ennf_transformation,[],[f34]) ).
thf(f39,plain,
( ( parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBen_THFTYPE_i )
= $true ),
inference(cnf_transformation,[],[f20]) ).
thf(f45,plain,
( ( ~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ) )
= $true ),
inference(cnf_transformation,[],[f32]) ).
thf(f46,plain,
! [X2: $i,X0: $i > $i > $o,X1: $i] :
( ( ( ~ ( X0 @ X2 @ lAnna_THFTYPE_i ) )
!= $true )
| ( ( X0 @ X1 @ lAnna_THFTYPE_i )
!= $true ) ),
inference(cnf_transformation,[],[f35]) ).
thf(f49,plain,
! [X2: $i,X0: $i > $i > $o,X1: $i] :
( ( ( X0 @ X1 @ lAnna_THFTYPE_i )
!= $true )
| ( ( X0 @ X2 @ lAnna_THFTYPE_i )
= $true ) ),
inference(not_proxy_clausification,[],[f46]) ).
thf(f50,plain,
( ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i )
= $false ),
inference(not_proxy_clausification,[],[f45]) ).
thf(f53,plain,
! [X2: $i,X1: $i] :
( ( $true
!= ( ^ [Y0: $i,Y1: $i] : ( Y0 = Y1 )
@ X1
@ lAnna_THFTYPE_i ) )
| ( $true
= ( ^ [Y0: $i,Y1: $i] : ( Y0 = Y1 )
@ X2
@ lAnna_THFTYPE_i ) ) ),
inference(primitive_instantiation,[],[f49]) ).
thf(f70,plain,
! [X2: $i,X1: $i] :
( ( $true
!= ( X1 = lAnna_THFTYPE_i ) )
| ( $true
= ( X2 = lAnna_THFTYPE_i ) ) ),
inference(beta-eta_normalization,[],[f53]) ).
thf(f71,plain,
! [X2: $i,X1: $i] :
( ( lAnna_THFTYPE_i != X1 )
| ( $true
= ( X2 = lAnna_THFTYPE_i ) ) ),
inference(equality_proxy_clausification,[],[f70]) ).
thf(f72,plain,
! [X2: $i,X1: $i] :
( ( lAnna_THFTYPE_i != X1 )
| ( lAnna_THFTYPE_i = X2 ) ),
inference(equality_proxy_clausification,[],[f71]) ).
thf(f74,definition,
( spl0_1
<=> ! [X2: $i] : ( lAnna_THFTYPE_i != X2 ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
thf(f75,plain,
( ! [X2: $i] : ( lAnna_THFTYPE_i != X2 )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f74]) ).
thf(f77,definition,
( spl0_2
<=> ! [X1: $i] : ( lAnna_THFTYPE_i = X1 ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
thf(f78,plain,
( ! [X1: $i] : ( lAnna_THFTYPE_i = X1 )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f77]) ).
thf(f80,plain,
( spl0_2
| spl0_1 ),
inference(avatar_split_clause,[],[f72,f74,f77]) ).
thf(f136,plain,
( ( $true
= ( parent_THFTYPE_IiioI @ lAnna_THFTYPE_i @ lBen_THFTYPE_i ) )
| ~ spl0_2 ),
inference(forward_demodulation,[],[f39,f78]) ).
thf(f137,plain,
( ( $true
= ( parent_THFTYPE_IiioI @ lAnna_THFTYPE_i @ lAnna_THFTYPE_i ) )
| ~ spl0_2 ),
inference(forward_demodulation,[],[f136,f78]) ).
thf(f141,plain,
( ! [X2: $i,X0: $i > $i > $i,X1: $i] :
( ( $true != $true )
| ( $true
= ( ^ [Y0: $i,Y1: $i] :
( parent_THFTYPE_IiioI @ ( X0 @ Y0 @ Y1 )
@ ( ^ [Y2: $i,Y3: $i] : Y2
@ Y0
@ Y1 ) )
@ X2
@ lAnna_THFTYPE_i ) )
| ( lAnna_THFTYPE_i
!= ( X0 @ X1 @ lAnna_THFTYPE_i ) )
| ( lAnna_THFTYPE_i != X1 ) )
| ~ spl0_2 ),
inference(constrained_superposition,[],[f49,f137]) ).
thf(f148,plain,
( ! [X2: $i,X0: $i > $i > $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i,Y1: $i] :
( parent_THFTYPE_IiioI @ ( X0 @ Y0 @ Y1 )
@ ( ^ [Y2: $i,Y3: $i] : Y2
@ Y0
@ Y1 ) )
@ X2
@ lAnna_THFTYPE_i ) )
| ( lAnna_THFTYPE_i
!= ( X0 @ X1 @ lAnna_THFTYPE_i ) )
| ( lAnna_THFTYPE_i != X1 ) )
| ~ spl0_2 ),
inference(trivial_inequality_removal,[],[f141]) ).
thf(f149,plain,
( ! [X2: $i,X0: $i > $i > $i,X1: $i] :
( ( $true
= ( parent_THFTYPE_IiioI @ ( X0 @ X2 @ lAnna_THFTYPE_i ) @ X2 ) )
| ( lAnna_THFTYPE_i
!= ( X0 @ X1 @ lAnna_THFTYPE_i ) )
| ( lAnna_THFTYPE_i != X1 ) )
| ~ spl0_2 ),
inference(beta-eta_normalization,[],[f148]) ).
thf(f152,plain,
( ! [X2: $i,X0: $i > $i > $i,X1: $i] :
( ( $true
= ( parent_THFTYPE_IiioI @ ( X0 @ X2 @ lAnna_THFTYPE_i ) @ X2 ) )
| ( lAnna_THFTYPE_i != X1 ) )
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f149,f78]) ).
thf(f155,plain,
( ! [X2: $i,X0: $i > $i > $i] :
( $true
= ( parent_THFTYPE_IiioI @ ( X0 @ X2 @ lAnna_THFTYPE_i ) @ X2 ) )
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f152,f78]) ).
thf(f156,plain,
( ! [X2: $i] :
( $true
= ( parent_THFTYPE_IiioI @ lAnna_THFTYPE_i @ X2 ) )
| ~ spl0_2 ),
inference(forward_demodulation,[],[f155,f78]) ).
thf(f186,plain,
( ( $false
= ( parent_THFTYPE_IiioI @ lAnna_THFTYPE_i @ lAnna_THFTYPE_i ) )
| ~ spl0_2 ),
inference(forward_demodulation,[],[f50,f78]) ).
thf(f187,plain,
( ( $true = $false )
| ~ spl0_2 ),
inference(forward_demodulation,[],[f186,f156]) ).
thf(f188,plain,
( $false
| ~ spl0_2 ),
inference(trivial_inequality_removal,[],[f187]) ).
thf(f189,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f188]) ).
thf(f190,plain,
( $false
| ~ spl0_1 ),
inference(equality_resolution,[],[f75]) ).
thf(f191,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f190]) ).
cnf(s2,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f80]) ).
cnf(s3,plain,
~ spl0_2,
inference(sat_conversion,[],[f189]) ).
cnf(s4,plain,
~ spl0_1,
inference(sat_conversion,[],[f191]) ).
cnf(s5,plain,
$false,
inference(rat,[],[s2,s3,s4]) ).
thf(f192,plain,
$false,
inference(avatar_sat_refutation,[],[s5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR140^1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20 % Computer : n026.cluster.edu
% 0.08/0.20 % Model : x86_64 x86_64
% 0.08/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20 % Memory : 8046.5625MB
% 0.08/0.20 % OS : Linux 6.8.0-71-generic
% 0.08/0.20 % CPULimit : 300
% 0.08/0.20 % WCLimit : 300
% 0.08/0.20 % DateTime : Tue Sep 29 17:59:13 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.21 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.24 Running first-order model finding
% 0.08/0.24 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.29 % (951672)Will run a generic schedule for satisfiability detection.
% 0.22/0.29 % (951681)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3202569253:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.22/0.29 % (951681)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.22/0.29 % (951678)% WARNING: option uhcvi not known.
% 0.22/0.29 % (951677)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2657499686_2999 on theBenchmark for (2999ds/0Mi)
% 0.22/0.29 % (951680)dis+10_1_sil=32000:sp=arity:random_seed=4092296180:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.22/0.29 % (951678)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1946215278:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.22/0.29 % Exception at run slice level
% 0.22/0.29 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.22/0.29 % (951678)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.22/0.29 % (951678)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.22/0.29 % (951682)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3012117343:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.22/0.29 % (951683)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2426525005:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.22/0.29 % (951680) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-951672-951680"...
% 0.22/0.29 % (951679)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1025721072:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.22/0.29 % (951680)...printing done.
% 0.22/0.29 % (951681) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-951672-951681"...
% 0.22/0.29 % (951680)Refutation found. Thanks to Tanya!
% 0.22/0.29 % SZS status Theorem for theBenchmark
% 0.22/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.29 % (951680)------------------------------
% 0.22/0.29 % (951680)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29 % (951680)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29 % (951680)CaDiCaL version: 2.1.3
% 0.22/0.29 % (951680)Termination reason: Refutation
% 0.22/0.29 % (951680)Time elapsed: 0.007 s
% 0.22/0.29 % (951680)Peak memory usage: 12 MB
% 0.22/0.29 % (951680)Instructions burned: 10 (million)
% 0.22/0.29 % (951672)Success in time 0.044 s
% 0.22/0.29 % Vampire exiting
%------------------------------------------------------------------------------