%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PUZ136^1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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 08:20:57 AM UTC 2026
% Result : Theorem 0.24s 0.35s
% Output : Refutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 94 ( 30 equ; 0 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 98 ( 26 ~; 11 |; 5 &; 56 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 13 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 10 usr; 6 con; 0-4 aty)
% Number of variables : 44 ( 4 ^; 25 !; 15 ?; 44 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
parent: $i > $i > $o ).
thf(func_def_8,type,
vNOT: $o > $o ).
thf(func_def_9,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_10,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_11,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(f1,axiom,
parent @ kronus @ zeus,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
thf(f2,axiom,
~ ( parent @ sutekh @ horus ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2) ).
thf(f3,conjecture,
? [X0: $i > $o,X2: $i,X1: $i] :
( ( X0 @ X1 )
& ~ ( X0 @ X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hotwo) ).
thf(f4,negated_conjecture,
~ ? [X0: $i > $o,X2: $i,X1: $i] :
( ( X0 @ X1 )
& ~ ( X0 @ X2 ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f5,plain,
~ ? [X0: $i > $o,X1: $i,X2: $i] :
( ( X0 @ X2 )
& ~ ( X0 @ X1 ) ),
inference(rectify,[],[f4]) ).
thf(f6,plain,
~ ? [X0: $i > $o,X1: $i,X2: $i] :
( ( ( X0 @ X2 )
= $true )
& ( ( X0 @ X1 )
!= $true ) ),
inference(fool_elimination,[],[f5]) ).
thf(f7,plain,
parent @ kronus @ zeus,
inference(rectify,[],[f1]) ).
thf(f8,plain,
( ( parent @ kronus @ zeus )
= $true ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
~ ( parent @ sutekh @ horus ),
inference(rectify,[],[f2]) ).
thf(f10,plain,
( ( parent @ sutekh @ horus )
!= $true ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
~ ? [X2: $i,X1: $i,X0: $i > $o] :
( ( ( X0 @ X1 )
!= $true )
& ( ( X0 @ X2 )
= $true ) ),
inference(flattening,[],[f6]) ).
thf(f12,plain,
( ( parent @ sutekh @ horus )
!= $true ),
inference(flattening,[],[f10]) ).
thf(f13,plain,
! [X2: $i,X1: $i,X0: $i > $o] :
( ( ( X0 @ X1 )
= $true )
| ( ( X0 @ X2 )
!= $true ) ),
inference(ennf_transformation,[],[f11]) ).
thf(f14,plain,
! [X0: $i,X1: $i,X2: $i > $o] :
( ( $true
= ( X2 @ X1 ) )
| ( ( X2 @ X0 )
!= $true ) ),
inference(rectify,[],[f13]) ).
thf(f15,plain,
! [X2: $i > $o,X0: $i,X1: $i] :
( ( ( X2 @ X0 )
!= $true )
| ( $true
= ( X2 @ X1 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f16,plain,
( ( parent @ kronus @ zeus )
= $true ),
inference(cnf_transformation,[],[f8]) ).
thf(f17,plain,
( ( parent @ sutekh @ horus )
!= $true ),
inference(cnf_transformation,[],[f12]) ).
thf(f21,plain,
! [X0: $i,X1: $i] : ( X0 = X1 ),
inference(leibniz_equality_elimination,[],[f15]) ).
thf(f32,plain,
! [X2: $i,X0: $i > $i,X1: $i] :
( ( $true != $true )
| ( ( ^ [Y0: $i] :
( parent @ ( X0 @ Y0 )
@ ( ^ [Y1: $i] : Y1
@ Y0 ) )
@ X2 )
= $true )
| ( kronus
!= ( X0 @ X1 ) )
| ( zeus != X1 ) ),
inference(constrained_superposition,[],[f15,f16]) ).
thf(f34,plain,
! [X2: $i,X0: $i > $i,X1: $i] :
( ( ( ^ [Y0: $i] :
( parent @ ( X0 @ Y0 )
@ ( ^ [Y1: $i] : Y1
@ Y0 ) )
@ X2 )
= $true )
| ( zeus != X1 )
| ( kronus
!= ( X0 @ X1 ) ) ),
inference(trivial_inequality_removal,[],[f32]) ).
thf(f35,plain,
! [X2: $i,X0: $i > $i,X1: $i] :
( ( $true
= ( parent @ ( X0 @ X2 ) @ X2 ) )
| ( zeus != X1 )
| ( kronus
!= ( X0 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f34]) ).
thf(f38,plain,
! [X2: $i,X0: $i > $i,X1: $i] :
( ( zeus != X1 )
| ( $true
= ( parent @ ( X0 @ X2 ) @ X2 ) ) ),
inference(forward_subsumption_resolution,[],[f35,f21]) ).
thf(f40,plain,
! [X2: $i,X0: $i > $i] :
( $true
= ( parent @ ( X0 @ X2 ) @ X2 ) ),
inference(forward_subsumption_resolution,[],[f38,f21]) ).
thf(f224,plain,
$true != $true,
inference(constrained_superposition,[],[f17,f40]) ).
thf(f231,plain,
$false,
inference(trivial_inequality_removal,[],[f224]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : PUZ136^1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.24 % Computer : n006.cluster.edu
% 0.11/0.24 % Model : x86_64 x86_64
% 0.11/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.24 % Memory : 8046.5625MB
% 0.11/0.24 % OS : Linux 6.8.0-71-generic
% 0.11/0.24 % CPULimit : 300
% 0.11/0.24 % WCLimit : 300
% 0.11/0.24 % DateTime : Tue Sep 29 13:26:09 UTC 2026
% 0.11/0.24 % CPUTime :
% 0.11/0.24 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.29 Running higher-order theorem proving
% 0.24/0.31 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.24/0.35 % (701514)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.24/0.35 % (701525)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.24/0.35 % (701525)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.24/0.35 % (701520)lrs+10_16_si=on:nwc=1.5:random_seed=852768158:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.24/0.35 % (701525)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=1812922285:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.24/0.35 % (701520) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-701514-701520"...
% 0.24/0.35 % (701520)...printing done.
% 0.24/0.35 % (701525)Refutation not found, incomplete strategy
% 0.24/0.35 % (701525)------------------------------
% 0.24/0.35 % (701525)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.35 % (701525)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.35 % (701525)CaDiCaL version: 2.1.3
% 0.24/0.35 % (701525)Termination reason: Refutation not found, incomplete strategy
% 0.24/0.35 % (701525)Time elapsed: 0.005 s
% 0.24/0.35 % (701525)Peak memory usage: 12 MB
% 0.24/0.35 % (701520)Refutation found. Thanks to Tanya!
% 0.24/0.35 % SZS status Theorem for theBenchmark
% 0.24/0.35 % SZS output start Proof for theBenchmark
% See solution above
% 0.24/0.35 % (701520)------------------------------
% 0.24/0.35 % (701520)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.35 % (701520)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.35 % (701520)CaDiCaL version: 2.1.3
% 0.24/0.35 % (701520)Termination reason: Refutation
% 0.24/0.35 % (701520)Time elapsed: 0.007 s
% 0.24/0.35 % (701520)Peak memory usage: 12 MB
% 0.24/0.35 % (701520)Instructions burned: 13 (million)
% 0.24/0.35 % (701514)Success in time 0.03 s
% 0.24/0.35 % Vampire exiting
%------------------------------------------------------------------------------