%------------------------------------------------------------------------------
% File : Vampire-SAT---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 SAT
% Computer : n009.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.08s 0.25s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 5
% Syntax : Number of formulae : 48 ( 11 unt; 0 typ; 2 def)
% Number of atoms : 213 ( 76 equ; 9 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 176 ( 55 ~; 39 |; 8 &; 72 @)
% ( 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 : 38 ( 38 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 16 usr; 10 con; 0-4 aty)
% Number of variables : 73 ( 18 sgn 39 !; 12 ?; 73 :)
% 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(func_def_17,type,
db2:
!>[X0: $tType] : X0 ).
thf(f4,axiom,
parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBen_THFTYPE_i,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_003) ).
thf(f10,axiom,
~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_009) ).
thf(f11,conjecture,
? [X0: $i > $i > $o,X1: $i > $i > $o,X2: $i] :
( ( X1 != X0 )
& ( X0 @ X2 @ lAnna_THFTYPE_i )
& ( X1 @ X2 @ lBill_THFTYPE_i ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
thf(f12,negated_conjecture,
~ ? [X0: $i > $i > $o,X1: $i > $i > $o,X2: $i] :
( ( X1 != X0 )
& ( X0 @ X2 @ lAnna_THFTYPE_i )
& ( X1 @ X2 @ lBill_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 > $i > $o,X2: $i] :
( ( X1 != X0 )
& ( X0 @ X2 @ lAnna_THFTYPE_i )
& ( X1 @ X2 @ lBill_THFTYPE_i ) ),
inference(rectify,[],[f12]) ).
thf(f34,plain,
~ ? [X0: $i > $i > $o,X1: $i > $i > $o,X2: $i] :
( ( $true
= ( X0 != X1 ) )
& ( ( X0 @ X2 @ lAnna_THFTYPE_i )
= $true )
& ( ( X1 @ X2 @ lBill_THFTYPE_i )
= $true ) ),
inference(fool_elimination,[],[f33]) ).
thf(f35,plain,
! [X0: $i > $i > $o,X1: $i > $i > $o,X2: $i] :
( ( $true
!= ( X0 != X1 ) )
| ( ( X0 @ X2 @ lAnna_THFTYPE_i )
!= $true )
| ( ( X1 @ X2 @ lBill_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 > $i > $o] :
( ( $true
!= ( X0 != X1 ) )
| ( ( X0 @ X2 @ lAnna_THFTYPE_i )
!= $true )
| ( ( X1 @ X2 @ lBill_THFTYPE_i )
!= $true ) ),
inference(cnf_transformation,[],[f35]) ).
thf(f49,plain,
! [X2: $i,X0: $i > $i > $o,X1: $i > $i > $o] :
( ( $true
= ( X0 = X1 ) )
| ( ( X0 @ X2 @ lAnna_THFTYPE_i )
!= $true )
| ( ( X1 @ X2 @ lBill_THFTYPE_i )
!= $true ) ),
inference(not_proxy_clausification,[],[f46]) ).
thf(f50,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,[],[f49]) ).
thf(f51,plain,
( ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i )
= $false ),
inference(not_proxy_clausification,[],[f45]) ).
thf(f54,plain,
! [X2: $i,X1: $i > $i > $o] :
( ( $true
!= ( ^ [Y0: $i,Y1: $i] : ( Y0 = Y1 )
@ X2
@ lAnna_THFTYPE_i ) )
| ( ( ^ [Y0: $i,Y1: $i] : ( Y0 = Y1 ) )
= X1 )
| ( ( X1 @ X2 @ lBill_THFTYPE_i )
!= $true ) ),
inference(primitive_instantiation,[],[f50]) ).
thf(f68,plain,
! [X2: $i,X1: $i > $i > $o] :
( ( $true
!= ( X2 = lAnna_THFTYPE_i ) )
| ( (=) = X1 )
| ( ( X1 @ X2 @ lBill_THFTYPE_i )
!= $true ) ),
inference(beta-eta_normalization,[],[f54]) ).
thf(f69,plain,
! [X2: $i,X1: $i > $i > $o] :
( ( ( X1 @ X2 @ lBill_THFTYPE_i )
!= $true )
| ( (=) = X1 )
| ( lAnna_THFTYPE_i != X2 ) ),
inference(equality_proxy_clausification,[],[f68]) ).
thf(f72,plain,
! [X2: $i] :
( ( $true
!= ( ^ [Y0: $i,Y1: $i] : $true
@ X2
@ lBill_THFTYPE_i ) )
| ( (=)
= ( ^ [Y0: $i,Y1: $i] : $true ) )
| ( lAnna_THFTYPE_i != X2 ) ),
inference(primitive_instantiation,[],[f69]) ).
thf(f79,plain,
! [X2: $i] :
( ( $true != $true )
| ( (=)
= ( ^ [Y0: $i,Y1: $i] : $true ) )
| ( lAnna_THFTYPE_i != X2 ) ),
inference(beta-eta_normalization,[],[f72]) ).
thf(f80,plain,
! [X2: $i] :
( ( (=)
= ( ^ [Y0: $i,Y1: $i] : $true ) )
| ( lAnna_THFTYPE_i != X2 ) ),
inference(trivial_inequality_removal,[],[f79]) ).
thf(f87,definition,
( spl0_1
<=> ! [X0: $i] : ( lAnna_THFTYPE_i != X0 ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
thf(f88,plain,
( ! [X0: $i] : ( lAnna_THFTYPE_i != X0 )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f87]) ).
thf(f90,definition,
( spl0_2
<=> ( (=)
= ( ^ [Y0: $i,Y1: $i] : $true ) ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
thf(f92,plain,
( ( (=)
= ( ^ [Y0: $i,Y1: $i] : $true ) )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f90]) ).
thf(f94,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f80,f90,f87]) ).
thf(f116,plain,
( ! [X1: $i] :
( ( ^ [Y0: $i,Y1: $i] : $true
@ X1 )
= ( (=) @ X1 ) )
| ~ spl0_2 ),
inference(argument_congruence,[],[f92]) ).
thf(f117,plain,
( ! [X1: $i] :
( ( ^ [Y0: $i] : $true )
= ( (=) @ X1 ) )
| ~ spl0_2 ),
inference(beta-eta_normalization,[],[f116]) ).
thf(f133,plain,
( ! [X2: $i,X1: $i] :
( ( ^ [Y0: $i] : $true
@ X2 )
= ( X1 = X2 ) )
| ~ spl0_2 ),
inference(argument_congruence,[],[f117]) ).
thf(f136,plain,
( ! [X2: $i,X1: $i] :
( ( $false
= ( ^ [Y0: $i] : $true
@ X2 ) )
| ( $true
= ( X1 = X2 ) ) )
| ~ spl0_2 ),
inference(iff_proxy_clausification,[],[f133]) ).
thf(f137,plain,
( ! [X2: $i,X1: $i] :
( ( $false
= ( ^ [Y0: $i] : $true
@ X2 ) )
| ( X1 = X2 ) )
| ~ spl0_2 ),
inference(equality_proxy_clausification,[],[f136]) ).
thf(f138,plain,
( ! [X2: $i,X1: $i] :
( ( $true = $false )
| ( X1 = X2 ) )
| ~ spl0_2 ),
inference(beta-eta_normalization,[],[f137]) ).
thf(f139,plain,
( ! [X2: $i,X1: $i] : ( X1 = X2 )
| ~ spl0_2 ),
inference(trivial_inequality_removal,[],[f138]) ).
thf(f182,plain,
( ! [X0: $i] :
( $true
= ( parent_THFTYPE_IiioI @ lMary_THFTYPE_i @ X0 ) )
| ~ spl0_2 ),
inference(constrained_superposition,[],[f39,f139]) ).
thf(f321,plain,
( ! [X0: $i,X1: $i] :
( $true
= ( parent_THFTYPE_IiioI @ X0 @ X1 ) )
| ~ spl0_2 ),
inference(constrained_superposition,[],[f182,f139]) ).
thf(f376,plain,
( ! [X0: $i] :
( $false
= ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ X0 ) )
| ~ spl0_2 ),
inference(constrained_superposition,[],[f51,f139]) ).
thf(f402,plain,
( ( $true = $false )
| ~ spl0_2 ),
inference(forward_demodulation,[],[f376,f321]) ).
thf(f403,plain,
( $false
| ~ spl0_2 ),
inference(trivial_inequality_removal,[],[f402]) ).
thf(f404,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f403]) ).
thf(f405,plain,
( $false
| ~ spl0_1 ),
inference(equality_resolution,[],[f88]) ).
thf(f406,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f405]) ).
cnf(s2,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f94]) ).
cnf(s7,plain,
~ spl0_2,
inference(sat_conversion,[],[f404]) ).
cnf(s8,plain,
~ spl0_1,
inference(sat_conversion,[],[f406]) ).
cnf(s9,plain,
$false,
inference(rat,[],[s2,s7,s8]) ).
thf(f407,plain,
$false,
inference(avatar_sat_refutation,[],[s9]) ).
%------------------------------------------------------------------------------
%----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 SAT
% 0.08/0.17 % Computer : n009.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Tue Sep 29 17:56:16 UTC 2026
% 0.08/0.17 % CPUTime :
% 0.08/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20 Running first-order model finding
% 0.08/0.20 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.25 % (143246)Will run a generic schedule for satisfiability detection.
% 0.08/0.25 % (143256)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3230959299:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.25 % (143251)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1812725644_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.25 % (143253)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1490843364:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.25 % (143254)dis+10_1_sil=32000:sp=arity:random_seed=74920694:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.25 % (143255)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2759328794:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.25 % Exception at run slice level% (143257)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1365891386:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.25
% 0.08/0.25 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.08/0.25 % (143252)% WARNING: option uhcvi not known.
% 0.08/0.25 % (143256) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-143246-143256"...
% 0.08/0.25 % (143255)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.08/0.25 % (143256)...printing done.
% 0.08/0.25 % (143256)Refutation found. Thanks to Tanya!
% 0.08/0.25 % SZS status Theorem for theBenchmark
% 0.08/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.25 % (143256)------------------------------
% 0.08/0.25 % (143256)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.25 % (143256)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.25 % (143256)CaDiCaL version: 2.1.3
% 0.08/0.25 % (143256)Termination reason: Refutation
% 0.08/0.25 % (143256)Time elapsed: 0.009 s
% 0.08/0.25 % (143256)Peak memory usage: 12 MB
% 0.08/0.25 % (143256)Instructions burned: 28 (million)
% 0.08/0.25 % (143246)Success in time 0.034 s
% 0.08/0.25 % Vampire exiting
%------------------------------------------------------------------------------