%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO061^4 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:46:25 AM UTC 2026
% Result : Theorem 0.20s 0.28s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 11 unt; 0 typ; 1 def)
% Number of atoms : 85 ( 6 equ; 0 cnn)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 63 ( 7 ~; 0 |; 0 &; 55 @)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 37 ( 34 usr; 3 con; 0-4 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
irel: $i > $i > $o ).
thf(func_def_2,type,
mnot: ( $i > $o ) > $i > $o ).
thf(func_def_3,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_4,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_5,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_6,type,
mbox_s4: ( $i > $o ) > $i > $o ).
thf(func_def_7,type,
iatom: ( $i > $o ) > $i > $o ).
thf(func_def_8,type,
inot: ( $i > $o ) > $i > $o ).
thf(func_def_9,type,
itrue: $i > $o ).
thf(func_def_10,type,
ifalse: $i > $o ).
thf(func_def_11,type,
iand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_12,type,
ior: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_13,type,
iimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_14,type,
iimplied: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_15,type,
iequiv: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_16,type,
ixor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_17,type,
ivalid: ( $i > $o ) > $o ).
thf(func_def_18,type,
isatisfiable: ( $i > $o ) > $o ).
thf(func_def_19,type,
icountersatisfiable: ( $i > $o ) > $o ).
thf(func_def_20,type,
iinvalid: ( $i > $o ) > $o ).
thf(func_def_21,type,
a: $i > $o ).
thf(func_def_22,type,
b: $i > $o ).
thf(func_def_23,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_24,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_25,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_26,type,
vNOT: $o > $o ).
thf(func_def_27,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_28,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_29,type,
vIMP: $o > $o > $o ).
thf(func_def_30,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_33,type,
vOR: $o > $o > $o ).
thf(func_def_34,type,
vAND: $o > $o > $o ).
thf(f22,axiom,
ivalid @ ( iimplies @ ( iatom @ a ) @ ( iatom @ b ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom1) ).
thf(f23,conjecture,
ivalid @ ( iimplies @ ( iatom @ a ) @ ( iatom @ b ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
thf(f24,negated_conjecture,
~ ( ivalid @ ( iimplies @ ( iatom @ a ) @ ( iatom @ b ) ) ),
inference(negated_conjecture,[status(cth)],[f23]) ).
thf(f43,plain,
ivalid @ ( iimplies @ ( iatom @ a ) @ ( iatom @ b ) ),
inference(rectify,[],[f22]) ).
thf(f44,plain,
( ( ivalid @ ( iimplies @ ( iatom @ a ) @ ( iatom @ b ) ) )
= $true ),
inference(fool_elimination,[],[f43]) ).
thf(f48,plain,
~ ( ivalid @ ( iimplies @ ( iatom @ a ) @ ( iatom @ b ) ) ),
inference(rectify,[],[f24]) ).
thf(f49,plain,
( ( ivalid @ ( iimplies @ ( iatom @ a ) @ ( iatom @ b ) ) )
!= $true ),
inference(fool_elimination,[],[f48]) ).
thf(f59,plain,
( ( ivalid @ ( iimplies @ ( iatom @ a ) @ ( iatom @ b ) ) )
!= $true ),
inference(flattening,[],[f49]) ).
thf(f79,plain,
( ( ivalid @ ( iimplies @ ( iatom @ a ) @ ( iatom @ b ) ) )
!= $true ),
inference(cnf_transformation,[],[f59]) ).
thf(f83,plain,
( ( ivalid @ ( iimplies @ ( iatom @ a ) @ ( iatom @ b ) ) )
= $true ),
inference(cnf_transformation,[],[f44]) ).
thf(f101,definition,
( spl0_3
<=> ( ( ivalid @ ( iimplies @ ( iatom @ a ) @ ( iatom @ b ) ) )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
thf(f104,plain,
~ spl0_3,
inference(avatar_split_clause,[],[f79,f101]) ).
thf(f185,plain,
spl0_3,
inference(avatar_split_clause,[],[f83,f101]) ).
cnf(s3,plain,
~ spl0_3,
inference(sat_conversion,[],[f104]) ).
cnf(s20,plain,
spl0_3,
inference(sat_conversion,[],[f185]) ).
cnf(s21,plain,
$false,
inference(rat,[],[s3,s20]) ).
thf(f186,plain,
$false,
inference(avatar_sat_refutation,[],[s21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO061^4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n013.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 16:25:21 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running higher-order theorem proving
% 0.09/0.24 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 % (2327207)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.28 % (2327216)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=3401563086: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 % (2327216) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2327207-2327216"...
% 0.20/0.28 % (2327216)...printing done.
% 0.20/0.28 % (2327216)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 % (2327216)------------------------------
% 0.20/0.28 % (2327216)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (2327216)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (2327216)CaDiCaL version: 2.1.3
% 0.20/0.28 % (2327216)Termination reason: Refutation
% 0.20/0.28 % (2327216)Time elapsed: 0.002 s
% 0.20/0.28 % (2327216)Peak memory usage: 12 MB
% 0.20/0.28 % (2327216)Instructions burned: 5 (million)
% 0.20/0.28 % (2327207)Success in time 0.03 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------