%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO088^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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:35 AM UTC 2026
% Result : Theorem 0.21s 0.28s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 47 ( 11 unt; 0 typ; 6 def)
% Number of atoms : 382 ( 97 equ)
% Maximal formula atoms : 14 ( 8 avg)
% Number of connectives : 232 ( 91 ~; 86 |; 34 &)
% ( 6 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of FOOLs : 194 ( 194 fml; 0 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 16 ( 13 usr; 15 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
t: $o ).
tff(func_def_1,type,
s: $o ).
tff(func_def_2,type,
p: $o ).
tff(func_def_3,type,
d: $o ).
tff(func_def_4,type,
c: $o ).
tff(func_def_5,type,
b: $o ).
tff(func_def_6,type,
a: $o ).
tff(f1,conjecture,
( ( ( s
=> t )
| ( ( ~ d
| ~ c
| ~ b
| ~ a )
& p ) )
=> ( ( s
=> t )
| ( p
& ( ~ ( d
& c )
| ~ ( b
& a ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cARR_COM_DMG5) ).
tff(f2,negated_conjecture,
~ ( ( ( s
=> t )
| ( ( ~ d
| ~ c
| ~ b
| ~ a )
& p ) )
=> ( ( s
=> t )
| ( p
& ( ~ ( d
& c )
| ~ ( b
& a ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
tff(f3,plain,
~ ( ( ( s
=> t )
| ( ( ~ d
| ~ c
| ~ b
| ~ a )
& p ) )
=> ( ( s
=> t )
| ( p
& ( ~ ( d
& c )
| ~ ( b
& a ) ) ) ) ),
inference(rectify,[],[f2]) ).
tff(f4,plain,
~ ( ( ( ( s = $true )
=> ( t = $true ) )
| ( ( ( d != $true )
| ( c != $true )
| ( b != $true )
| ( a != $true ) )
& ( p = $true ) ) )
=> ( ( ( s = $true )
=> ( t = $true ) )
| ( ( p = $true )
& ( ~ ( ( d = $true )
& ( c = $true ) )
| ~ ( ( b = $true )
& ( a = $true ) ) ) ) ) ),
inference(fool_elimination,[],[f3]) ).
tff(f5,plain,
~ ( ( ( ( s = $true )
=> ( t = $true ) )
| ( ( ( d != $true )
| ( c != $true )
| ( b != $true )
| ( a != $true ) )
& ( p = $true ) ) )
=> ( ( ( s = $true )
=> ( t = $true ) )
| ( ( p = $true )
& ( ~ ( ( d = $true )
& ( c = $true ) )
| ~ ( ( b = $true )
& ( a = $true ) ) ) ) ) ),
inference(flattening,[],[f4]) ).
tff(f6,plain,
( ( t != $true )
& ( s = $true )
& ( ( p != $true )
| ( ( d = $true )
& ( c = $true )
& ( b = $true )
& ( a = $true ) ) )
& ( ( t = $true )
| ( s != $true )
| ( ( ( d != $true )
| ( c != $true )
| ( b != $true )
| ( a != $true ) )
& ( p = $true ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
tff(f7,plain,
( ( t != $true )
& ( s = $true )
& ( ( p != $true )
| ( ( d = $true )
& ( c = $true )
& ( b = $true )
& ( a = $true ) ) )
& ( ( t = $true )
| ( s != $true )
| ( ( ( d != $true )
| ( c != $true )
| ( b != $true )
| ( a != $true ) )
& ( p = $true ) ) ) ),
inference(flattening,[],[f6]) ).
tff(f8,plain,
( ( t = $true )
| ( s != $true )
| ( p = $true ) ),
inference(cnf_transformation,[],[f7]) ).
tff(f9,plain,
( ( t = $true )
| ( s != $true )
| ( d != $true )
| ( c != $true )
| ( b != $true )
| ( a != $true ) ),
inference(cnf_transformation,[],[f7]) ).
tff(f10,plain,
( ( p != $true )
| ( a = $true ) ),
inference(cnf_transformation,[],[f7]) ).
tff(f11,plain,
( ( p != $true )
| ( b = $true ) ),
inference(cnf_transformation,[],[f7]) ).
tff(f12,plain,
( ( p != $true )
| ( c = $true ) ),
inference(cnf_transformation,[],[f7]) ).
tff(f13,plain,
( ( p != $true )
| ( d = $true ) ),
inference(cnf_transformation,[],[f7]) ).
tff(f14,plain,
s = $true,
inference(cnf_transformation,[],[f7]) ).
tff(f15,plain,
t != $true,
inference(cnf_transformation,[],[f7]) ).
tff(f18,plain,
( ( t = $true )
| ( $true != $true )
| ( d != $true )
| ( c != $true )
| ( b != $true )
| ( a != $true ) ),
inference(definition_unfolding,[],[f9,f14]) ).
tff(f19,plain,
( ( t = $true )
| ( $true != $true )
| ( p = $true ) ),
inference(definition_unfolding,[],[f8,f14]) ).
tff(f20,plain,
( ( t = $true )
| ( p = $true ) ),
inference(trivial_inequality_removal,[],[f19]) ).
tff(f21,plain,
( ( t = $true )
| ( d != $true )
| ( c != $true )
| ( b != $true )
| ( a != $true ) ),
inference(trivial_inequality_removal,[],[f18]) ).
tff(f23,definition,
( spl0_1
<=> ( p = $true ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
tff(f27,definition,
( spl0_2
<=> ( t = $true ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
tff(f30,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f20,f27,f23]) ).
tff(f32,definition,
( spl0_3
<=> ( a = $true ) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
tff(f36,definition,
( spl0_4
<=> ( b = $true ) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
tff(f40,definition,
( spl0_5
<=> ( c = $true ) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
tff(f44,definition,
( spl0_6
<=> ( d = $true ) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
tff(f47,plain,
( ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| spl0_2 ),
inference(avatar_split_clause,[],[f21,f27,f44,f40,f36,f32]) ).
tff(f48,plain,
( spl0_3
| ~ spl0_1 ),
inference(avatar_split_clause,[],[f10,f23,f32]) ).
tff(f49,plain,
( spl0_4
| ~ spl0_1 ),
inference(avatar_split_clause,[],[f11,f23,f36]) ).
tff(f50,plain,
( spl0_5
| ~ spl0_1 ),
inference(avatar_split_clause,[],[f12,f23,f40]) ).
tff(f51,plain,
( spl0_6
| ~ spl0_1 ),
inference(avatar_split_clause,[],[f13,f23,f44]) ).
tff(f52,plain,
~ spl0_2,
inference(avatar_split_clause,[],[f15,f27]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f30]) ).
cnf(s2,plain,
( spl0_2
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6 ),
inference(sat_conversion,[],[f47]) ).
cnf(s3,plain,
( ~ spl0_1
| spl0_3 ),
inference(sat_conversion,[],[f48]) ).
cnf(s4,plain,
( ~ spl0_1
| spl0_4 ),
inference(sat_conversion,[],[f49]) ).
cnf(s5,plain,
( ~ spl0_1
| spl0_5 ),
inference(sat_conversion,[],[f50]) ).
cnf(s6,plain,
( ~ spl0_1
| spl0_6 ),
inference(sat_conversion,[],[f51]) ).
cnf(s7,plain,
~ spl0_2,
inference(sat_conversion,[],[f52]) ).
cnf(s8,plain,
( ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6 ),
inference(rat,[],[s2,s7]) ).
cnf(s9,plain,
spl0_1,
inference(rat,[],[s1,s7]) ).
cnf(s10,plain,
spl0_6,
inference(rat,[],[s6,s9]) ).
cnf(s11,plain,
spl0_5,
inference(rat,[],[s5,s9]) ).
cnf(s12,plain,
spl0_4,
inference(rat,[],[s4,s9]) ).
cnf(s13,plain,
spl0_3,
inference(rat,[],[s3,s9]) ).
cnf(s14,plain,
$false,
inference(rat,[],[s8,s10,s11,s12,s13]) ).
tff(f53,plain,
$false,
inference(avatar_sat_refutation,[],[s14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO088^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.19 % Computer : n013.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 16:32:51 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.22 Running higher-order theorem proving
% 0.07/0.24 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.21/0.28 % (2337842)Detected formulas, will run a generic FOF schedule.
% 0.21/0.28 % (2337850)lrs+1011_32_sil=2000:tgt=full:alpa=true:random_seed=3517050943:st=5:i=107:sd=1:ss=included:er=filter_2999 on theBenchmark for (2999ds/107Mi)
% 0.21/0.28 % (2337850) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2337842-2337850"...
% 0.21/0.28 % (2337850)...printing done.
% 0.21/0.28 % (2337850)Refutation found. Thanks to Tanya!
% 0.21/0.28 % SZS status Theorem for theBenchmark
% 0.21/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.28 % (2337850)------------------------------
% 0.21/0.28 % (2337850)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28 % (2337850)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28 % (2337850)CaDiCaL version: 2.1.3
% 0.21/0.28 % (2337850)Termination reason: Refutation
% 0.21/0.28 % (2337850)Time elapsed: 0.001 s
% 0.21/0.28 % (2337850)Peak memory usage: 12 MB
% 0.21/0.28 % (2337850)Instructions burned: 1 (million)
% 0.21/0.28 % (2337842)Success in time 0.027 s
% 0.21/0.28 % Vampire exiting
%------------------------------------------------------------------------------