%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV013^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n014.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:38:51 AM UTC 2026
% Result : Theorem 0.22s 0.29s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 44 ( 6 unt; 0 typ; 4 def)
% Number of atoms : 111 ( 67 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 111 ( 44 ~; 42 |; 15 &)
% ( 4 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 5 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 30 ( 0 sgn 18 !; 12 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
a: $tType ).
tff(func_def_0,type,
sK0: a ).
tff(func_def_1,type,
sK1: a ).
tff(func_def_2,type,
sK2: a ).
tff(func_def_3,type,
sK3: a ).
tff(func_def_4,type,
sK4: a ).
tff(func_def_5,type,
sK5: a ).
tff(f1,conjecture,
( ! [X0: a,X1: a,X2: a] :
( ( ( X1 = X2 )
& ( X0 = X1 ) )
=> ( X0 = X2 ) )
& ! [X0: a,X1: a] :
( ( X0 = X1 )
=> ( X1 = X0 ) )
& ! [X0: a] : ( X0 = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM511_pme) ).
tff(f2,negated_conjecture,
~ ( ! [X0: a,X1: a,X2: a] :
( ( ( X1 = X2 )
& ( X0 = X1 ) )
=> ( X0 = X2 ) )
& ! [X0: a,X1: a] :
( ( X0 = X1 )
=> ( X1 = X0 ) )
& ! [X0: a] : ( X0 = X0 ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
tff(f3,plain,
~ ( ! [X0: a,X1: a,X2: a] :
( ( ( X1 = X2 )
& ( X0 = X1 ) )
=> ( X0 = X2 ) )
& ! [X3: a,X4: a] :
( ( X3 = X4 )
=> ( X3 = X4 ) )
& ! [X5: a] : ( X5 = X5 ) ),
inference(rectify,[],[f2]) ).
tff(f4,plain,
( ? [X0: a,X1: a,X2: a] :
( ( X0 != X2 )
& ( X1 = X2 )
& ( X0 = X1 ) )
| ? [X3: a,X4: a] :
( ( X3 != X4 )
& ( X3 = X4 ) )
| ? [X5: a] : ( X5 != X5 ) ),
inference(ennf_transformation,[],[f3]) ).
tff(f5,plain,
( ? [X0: a,X1: a,X2: a] :
( ( X0 != X2 )
& ( X1 = X2 )
& ( X0 = X1 ) )
| ? [X3: a,X4: a] :
( ( X3 != X4 )
& ( X3 = X4 ) )
| ? [X5: a] : ( X5 != X5 ) ),
inference(flattening,[],[f4]) ).
tff(f6,plain,
( ( sK0 != sK0 )
| ( sK1 != sK2 )
| ( sK3 = sK4 ) ),
inference(cnf_transformation,[],[f5]) ).
tff(f7,plain,
( ( sK0 != sK0 )
| ( sK1 != sK2 )
| ( sK4 = sK5 ) ),
inference(cnf_transformation,[],[f5]) ).
tff(f8,plain,
( ( sK0 != sK0 )
| ( sK1 != sK2 )
| ( sK3 != sK5 ) ),
inference(cnf_transformation,[],[f5]) ).
tff(f9,plain,
( ( sK0 != sK0 )
| ( sK1 = sK2 )
| ( sK3 = sK4 ) ),
inference(cnf_transformation,[],[f5]) ).
tff(f10,plain,
( ( sK0 != sK0 )
| ( sK1 = sK2 )
| ( sK4 = sK5 ) ),
inference(cnf_transformation,[],[f5]) ).
tff(f11,plain,
( ( sK0 != sK0 )
| ( sK1 = sK2 )
| ( sK3 != sK5 ) ),
inference(cnf_transformation,[],[f5]) ).
tff(f12,plain,
( ( sK1 != sK2 )
| ( sK3 = sK4 ) ),
inference(trivial_inequality_removal,[],[f6]) ).
tff(f13,plain,
( ( sK1 != sK2 )
| ( sK4 = sK5 ) ),
inference(trivial_inequality_removal,[],[f7]) ).
tff(f14,plain,
( ( sK1 != sK2 )
| ( sK3 != sK5 ) ),
inference(trivial_inequality_removal,[],[f8]) ).
tff(f15,plain,
( ( sK1 = sK2 )
| ( sK3 = sK4 ) ),
inference(trivial_inequality_removal,[],[f9]) ).
tff(f16,plain,
( ( sK1 = sK2 )
| ( sK4 = sK5 ) ),
inference(trivial_inequality_removal,[],[f10]) ).
tff(f17,plain,
( ( sK1 = sK2 )
| ( sK3 != sK5 ) ),
inference(trivial_inequality_removal,[],[f11]) ).
tff(f19,definition,
( spl6_1
<=> ( sK3 = sK4 ) ),
introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).
tff(f21,plain,
( ( sK3 = sK4 )
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f19]) ).
tff(f23,definition,
( spl6_2
<=> ( sK1 = sK2 ) ),
introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).
tff(f26,plain,
( spl6_1
| ~ spl6_2 ),
inference(avatar_split_clause,[],[f12,f23,f19]) ).
tff(f28,definition,
( spl6_3
<=> ( sK4 = sK5 ) ),
introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition]) ).
tff(f30,plain,
( ( sK4 = sK5 )
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f28]) ).
tff(f31,plain,
( spl6_3
| ~ spl6_2 ),
inference(avatar_split_clause,[],[f13,f23,f28]) ).
tff(f33,definition,
( spl6_4
<=> ( sK3 = sK5 ) ),
introduced(definition,[new_symbols(definition,[spl6_4])],[avatar_definition]) ).
tff(f36,plain,
( ~ spl6_4
| ~ spl6_2 ),
inference(avatar_split_clause,[],[f14,f23,f33]) ).
tff(f37,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f15,f23,f19]) ).
tff(f38,plain,
( spl6_3
| spl6_2 ),
inference(avatar_split_clause,[],[f16,f23,f28]) ).
tff(f39,plain,
( ~ spl6_4
| spl6_2 ),
inference(avatar_split_clause,[],[f17,f23,f33]) ).
tff(f40,plain,
( ( sK3 = sK5 )
| ~ spl6_1
| ~ spl6_3 ),
inference(forward_demodulation,[],[f30,f21]) ).
tff(f41,plain,
( spl6_4
| ~ spl6_1
| ~ spl6_3 ),
inference(avatar_split_clause,[],[f40,f28,f19,f33]) ).
cnf(s1,plain,
( spl6_1
| ~ spl6_2 ),
inference(sat_conversion,[],[f26]) ).
cnf(s2,plain,
( ~ spl6_2
| spl6_3 ),
inference(sat_conversion,[],[f31]) ).
cnf(s3,plain,
( ~ spl6_2
| ~ spl6_4 ),
inference(sat_conversion,[],[f36]) ).
cnf(s4,plain,
( spl6_1
| spl6_2 ),
inference(sat_conversion,[],[f37]) ).
cnf(s5,plain,
( spl6_2
| spl6_3 ),
inference(sat_conversion,[],[f38]) ).
cnf(s6,plain,
( spl6_2
| ~ spl6_4 ),
inference(sat_conversion,[],[f39]) ).
cnf(s7,plain,
( ~ spl6_1
| ~ spl6_3
| spl6_4 ),
inference(sat_conversion,[],[f41]) ).
cnf(s8,plain,
spl6_1,
inference(rat,[],[s1,s4]) ).
cnf(s9,plain,
~ spl6_2,
inference(rat,[],[s7,s2,s3,s8]) ).
cnf(s10,plain,
~ spl6_4,
inference(rat,[],[s6,s9]) ).
cnf(s11,plain,
spl6_3,
inference(rat,[],[s5,s9]) ).
cnf(s12,plain,
$false,
inference(rat,[],[s7,s8,s10,s11]) ).
tff(f42,plain,
$false,
inference(avatar_sat_refutation,[],[s12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV013^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.20 % Computer : n014.cluster.edu
% 0.10/0.20 % Model : x86_64 x86_64
% 0.10/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20 % Memory : 8046.5625MB
% 0.10/0.20 % OS : Linux 6.8.0-71-generic
% 0.10/0.20 % CPULimit : 300
% 0.10/0.20 % WCLimit : 300
% 0.10/0.20 % DateTime : Tue Sep 29 15:00:00 UTC 2026
% 0.10/0.20 % CPUTime :
% 0.10/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.23 Running first-order model finding
% 0.10/0.23 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.29 % (2775287)Will run a generic schedule for satisfiability detection.
% 0.22/0.29 % (2775293)% WARNING: option uhcvi not known.
% 0.22/0.29 % (2775292)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3639381338_2999 on theBenchmark for (2999ds/0Mi)
% 0.22/0.29 % (2775293)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1518042186:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.22/0.29 % (2775294)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1512426382:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.22/0.29 % Detected minimum model sizes of [1]
% 0.22/0.29 % Detected maximum model sizes of [6]
% 0.22/0.29 % TRYING [1]
% 0.22/0.29 % (2775295)dis+10_1_sil=32000:sp=arity:random_seed=2856643108:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.22/0.29 % TRYING [2]
% 0.22/0.29 % TRYING [3]
% 0.22/0.29 % (2775293) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2775287-2775293"...
% 0.22/0.29 % TRYING [4]
% 0.22/0.29 % TRYING [5]
% 0.22/0.29 % (2775294) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2775287-2775294"...
% 0.22/0.29 % TRYING [6]
% 0.22/0.29 % (2775292) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2775287-2775292"...
% 0.22/0.29 % (2775295) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2775287-2775295"...
% 0.22/0.29 % (2775293)...printing done.
% 0.22/0.29 % (2775292)...printing done.
% 0.22/0.29 % (2775294)...printing done.
% 0.22/0.29 % (2775295)...printing done.
% 0.22/0.29 % (2775293)Refutation found. Thanks to Tanya!
% 0.22/0.29 % SZS status Theorem for theBenchmark
% 0.22/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.29 % (2775293)------------------------------
% 0.22/0.29 % (2775293)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29 % (2775293)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29 % (2775293)CaDiCaL version: 2.1.3
% 0.22/0.29 % (2775293)Termination reason: Refutation
% 0.22/0.29 % (2775293)Time elapsed: 0.002 s
% 0.22/0.29 % (2775293)Peak memory usage: 12 MB
% 0.22/0.29 % (2775293)Instructions burned: 1 (million)
% 0.22/0.29 % (2775287)Success in time 0.046 s
% 0.22/0.29 % Vampire exiting
%------------------------------------------------------------------------------