%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : ITP209^2 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:08:52 AM UTC 2026
% Result : Theorem 0.20s 0.28s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 16 unt; 0 typ; 0 def)
% Number of atoms : 16 ( 15 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 115 ( 7 ~; 0 |; 0 &; 108 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 44 ( 42 usr; 4 con; 0-4 aty)
% Number of variables : 18 ( 0 ^; 18 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
syntax_ac_operator:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > $o ) ).
thf(func_def_1,type,
syntax7388354845996824322omatch:
!>[X0: $tType,X1: $tType] : ( X0 > X1 > $o ) ).
thf(func_def_2,type,
syntax2379306206330768139omatch:
!>[X0: $tType,X1: $tType] : ( X0 > X1 > $o ) ).
thf(func_def_3,type,
a2: a ).
thf(func_def_4,type,
b: a ).
thf(func_def_5,type,
c: a ).
thf(func_def_6,type,
f: a > a > a ).
thf(func_def_8,type,
vAND: $o > $o > $o ).
thf(func_def_9,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_10,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_11,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
db2:
!>[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(func_def_18,type,
sK0:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_19,type,
sK1:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_20,type,
sK2:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_21,type,
sK3:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_22,type,
sK4:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_23,type,
vNOT: $o > $o ).
thf(func_def_24,type,
sK5:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_25,type,
sK6:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_26,type,
sK7:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_27,type,
sK8:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_28,type,
sK9:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_29,type,
sK10:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_30,type,
sK11:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_31,type,
sK12:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_32,type,
sK13:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_33,type,
sK14:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_34,type,
sK15:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_35,type,
sK16:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_36,type,
sK17:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_37,type,
sK18:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_38,type,
sK19:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_39,type,
sK20:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_40,type,
sK21:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_41,type,
sK22:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_42,type,
sK23:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_43,type,
sK24:
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(f2,axiom,
! [X1: a,X0: a] :
( ( f @ X0 @ X1 )
= ( f @ X1 @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_commute) ).
thf(f3,axiom,
! [X0: a,X2: a,X1: a] :
( ( f @ X0 @ ( f @ X1 @ X2 ) )
= ( f @ X1 @ ( f @ X0 @ X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2_left__commute) ).
thf(f13,conjecture,
( ( f @ ( f @ a2 @ b ) @ c )
= ( f @ ( f @ a2 @ c ) @ b ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
thf(f14,negated_conjecture,
( ( f @ ( f @ a2 @ b ) @ c )
!= ( f @ ( f @ a2 @ c ) @ b ) ),
inference(negated_conjecture,[status(cth)],[f13]) ).
thf(f32,plain,
! [X1: a,X0: a,X2: a] :
( ( f @ X2 @ ( f @ X0 @ X1 ) )
= ( f @ X0 @ ( f @ X2 @ X1 ) ) ),
inference(rectify,[],[f3]) ).
thf(f33,plain,
( ( f @ ( f @ a2 @ b ) @ c )
!= ( f @ ( f @ a2 @ c ) @ b ) ),
inference(flattening,[],[f14]) ).
thf(f35,plain,
! [X0: a,X1: a] :
( ( f @ X0 @ X1 )
= ( f @ X1 @ X0 ) ),
inference(rectify,[],[f2]) ).
thf(f44,plain,
! [X0: a,X1: a,X2: a] :
( ( f @ X1 @ ( f @ X2 @ X0 ) )
= ( f @ X2 @ ( f @ X1 @ X0 ) ) ),
inference(rectify,[],[f32]) ).
thf(f54,plain,
! [X0: a,X1: a] :
( ( f @ X0 @ X1 )
= ( f @ X1 @ X0 ) ),
inference(cnf_transformation,[],[f35]) ).
thf(f56,plain,
! [X2: a,X0: a,X1: a] :
( ( f @ X1 @ ( f @ X2 @ X0 ) )
= ( f @ X2 @ ( f @ X1 @ X0 ) ) ),
inference(cnf_transformation,[],[f44]) ).
thf(f63,plain,
( ( f @ ( f @ a2 @ b ) @ c )
!= ( f @ ( f @ a2 @ c ) @ b ) ),
inference(cnf_transformation,[],[f33]) ).
thf(f151,plain,
( ( f @ ( f @ a2 @ b ) @ c )
!= ( f @ b @ ( f @ a2 @ c ) ) ),
inference(constrained_superposition,[],[f63,f54]) ).
thf(f153,plain,
( ( f @ b @ ( f @ a2 @ c ) )
!= ( f @ c @ ( f @ a2 @ b ) ) ),
inference(forward_demodulation,[],[f151,f54]) ).
thf(f155,plain,
( ( f @ b @ ( f @ a2 @ c ) )
!= ( f @ a2 @ ( f @ c @ b ) ) ),
inference(forward_demodulation,[],[f153,f56]) ).
thf(f157,plain,
( ( f @ b @ ( f @ a2 @ c ) )
!= ( f @ a2 @ ( f @ b @ c ) ) ),
inference(forward_demodulation,[],[f155,f54]) ).
thf(f159,plain,
$false,
inference(forward_subsumption_resolution,[],[f157,f56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP209^2 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.19 % Computer : n004.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Tue Sep 29 20:13:47 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.22 Running higher-order theorem proving
% 0.07/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 % (1786855)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.28 % (1786862)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1287145620:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.20/0.28 % (1786862)Instruction limit reached!
% 0.20/0.28 % (1786862)------------------------------
% 0.20/0.28 % (1786862)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (1786862)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (1786862)CaDiCaL version: 2.1.3
% 0.20/0.28 % (1786862)Termination reason: Instruction limit
% 0.20/0.28 % (1786862)Termination phase: Saturation
% 0.20/0.28 % (1786862)Time elapsed: 0.002 s
% 0.20/0.28 % (1786862)Peak memory usage: 11 MB
% 0.20/0.28 % (1786862)Instructions burned: 5 (million)
% 0.20/0.28 % (1786861)lrs+10_16_si=on:nwc=1.5:random_seed=1421371043:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.20/0.28 % (1786860)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=4278100877:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.20/0.28 % (1786863)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=499216186: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.20/0.28 % (1786861) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1786855-1786861"...
% 0.20/0.28 % (1786860) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1786855-1786860"...
% 0.20/0.28 % (1786868)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=3557856545:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.20/0.28 % (1786860)...printing done.
% 0.20/0.28 % (1786861)...printing done.
% 0.20/0.28 % (1786863) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1786855-1786863"...
% 0.20/0.28 % (1786860)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 % (1786860)------------------------------
% 0.20/0.28 % (1786860)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (1786860)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (1786860)CaDiCaL version: 2.1.3
% 0.20/0.28 % (1786860)Termination reason: Refutation
% 0.20/0.28 % (1786860)Time elapsed: 0.006 s
% 0.20/0.28 % (1786860)Peak memory usage: 12 MB
% 0.20/0.28 % (1786860)Instructions burned: 11 (million)
% 0.20/0.28 % (1786855)Success in time 0.04 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------