%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN551+2 : TPTP v9.3.1. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n008.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 : Tue Sep 29 02:17:34 PM UTC 2026
% Result : Theorem 0.09s 0.26s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 9
% Syntax : Number of formulae : 112 ( 9 unt; 8 def)
% Number of atoms : 400 ( 197 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 515 ( 227 ~; 253 |; 15 &)
% ( 19 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 9 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-1 aty)
% Number of variables : 83 ( 0 sgn 67 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ? [X0] :
! [X1] :
( X1 = f(g(X1))
<=> X0 = X1 )
<=> ? [X0] :
! [X1] :
( X1 = g(f(X1))
<=> X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_cute_thing) ).
fof(f2,negated_conjecture,
~ ( ? [X0] :
! [X1] :
( X1 = f(g(X1))
<=> X0 = X1 )
<=> ? [X0] :
! [X1] :
( X1 = g(f(X1))
<=> X0 = X1 ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
~ ( ? [X0] :
! [X1] :
( X1 = f(g(X1))
<=> X0 = X1 )
<=> ? [X2] :
! [X3] :
( g(f(X3)) = X3
<=> X2 = X3 ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ? [X0] :
! [X1] :
( X1 = f(g(X1))
<=> X0 = X1 )
<~> ? [X2] :
! [X3] :
( g(f(X3)) = X3
<=> X2 = X3 ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ( ! [X2] :
? [X3] :
( ( X2 != X3
| g(f(X3)) != X3 )
& ( X2 = X3
| g(f(X3)) = X3 ) )
| ! [X0] :
? [X1] :
( ( X0 != X1
| f(g(X1)) != X1 )
& ( X0 = X1
| X1 = f(g(X1)) ) ) )
& ( ? [X2] :
! [X3] :
( ( g(f(X3)) = X3
| X2 != X3 )
& ( X2 = X3
| g(f(X3)) != X3 ) )
| ? [X0] :
! [X1] :
( ( X1 = f(g(X1))
| X0 != X1 )
& ( X0 = X1
| f(g(X1)) != X1 ) ) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f6,plain,
( ( ! [X0] :
? [X1] :
( ( X0 != X1
| g(f(X1)) != X1 )
& ( X0 = X1
| g(f(X1)) = X1 ) )
| ! [X2] :
? [X3] :
( ( X2 != X3
| f(g(X3)) != X3 )
& ( X2 = X3
| f(g(X3)) = X3 ) ) )
& ( ? [X4] :
! [X5] :
( ( g(f(X5)) = X5
| X4 != X5 )
& ( X4 = X5
| g(f(X5)) != X5 ) )
| ? [X6] :
! [X7] :
( ( f(g(X7)) = X7
| X6 != X7 )
& ( X6 = X7
| f(g(X7)) != X7 ) ) ) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
( ( ! [X0] :
( ( sK0(X0) != X0
| sK0(X0) != g(f(sK0(X0))) )
& ( sK0(X0) = X0
| sK0(X0) = g(f(sK0(X0))) ) )
| ! [X2] :
( ( sK1(X2) != X2
| sK1(X2) != f(g(sK1(X2))) )
& ( sK1(X2) = X2
| sK1(X2) = f(g(sK1(X2))) ) ) )
& ( ! [X5] :
( ( g(f(X5)) = X5
| sK2 != X5 )
& ( sK2 = X5
| g(f(X5)) != X5 ) )
| ! [X7] :
( ( f(g(X7)) = X7
| sK3 != X7 )
& ( sK3 = X7
| f(g(X7)) != X7 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X1,sK0(X0)),skolemize(X3,sK1(X2)),skolemize(X4,sK2),skolemize(X6,sK3)],[f6]) ).
fof(f8,plain,
! [X7,X5] :
( sK2 = X5
| g(f(X5)) != X5
| sK3 = X7
| f(g(X7)) != X7 ),
inference(cnf_transformation,[],[f7]) ).
fof(f9,plain,
! [X7,X5] :
( sK2 = X5
| g(f(X5)) != X5
| f(g(X7)) = X7
| sK3 != X7 ),
inference(cnf_transformation,[],[f7]) ).
fof(f10,plain,
! [X7,X5] :
( g(f(X5)) = X5
| sK2 != X5
| sK3 = X7
| f(g(X7)) != X7 ),
inference(cnf_transformation,[],[f7]) ).
fof(f11,plain,
! [X7,X5] :
( g(f(X5)) = X5
| sK2 != X5
| f(g(X7)) = X7
| sK3 != X7 ),
inference(cnf_transformation,[],[f7]) ).
fof(f12,plain,
! [X2,X0] :
( sK0(X0) = X0
| sK0(X0) = g(f(sK0(X0)))
| sK1(X2) = X2
| sK1(X2) = f(g(sK1(X2))) ),
inference(cnf_transformation,[],[f7]) ).
fof(f13,plain,
! [X2,X0] :
( sK0(X0) = X0
| sK0(X0) = g(f(sK0(X0)))
| sK1(X2) != X2
| sK1(X2) != f(g(sK1(X2))) ),
inference(cnf_transformation,[],[f7]) ).
fof(f14,plain,
! [X2,X0] :
( sK0(X0) != X0
| sK0(X0) != g(f(sK0(X0)))
| sK1(X2) = X2
| sK1(X2) = f(g(sK1(X2))) ),
inference(cnf_transformation,[],[f7]) ).
fof(f15,plain,
! [X2,X0] :
( sK0(X0) != X0
| sK0(X0) != g(f(sK0(X0)))
| sK1(X2) != X2
| sK1(X2) != f(g(sK1(X2))) ),
inference(cnf_transformation,[],[f7]) ).
fof(f16,plain,
! [X7] :
( sK2 = g(f(sK2))
| f(g(X7)) = X7
| sK3 != X7 ),
inference(equality_resolution,[],[f11]) ).
fof(f17,plain,
( sK2 = g(f(sK2))
| sK3 = f(g(sK3)) ),
inference(equality_resolution,[],[f16]) ).
fof(f18,plain,
! [X7] :
( sK2 = g(f(sK2))
| sK3 = X7
| f(g(X7)) != X7 ),
inference(equality_resolution,[],[f10]) ).
fof(f19,plain,
! [X5] :
( sK2 = X5
| g(f(X5)) != X5
| sK3 = f(g(sK3)) ),
inference(equality_resolution,[],[f9]) ).
fof(f21,definition,
( spl4_1
<=> ! [X7] :
( sK3 = X7
| f(g(X7)) != X7 ) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
fof(f22,plain,
( ! [X7] :
( f(g(X7)) != X7
| sK3 = X7 )
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f21]) ).
fof(f24,definition,
( spl4_2
<=> ! [X5] :
( sK2 = X5
| g(f(X5)) != X5 ) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
fof(f25,plain,
( ! [X5] :
( g(f(X5)) != X5
| sK2 = X5 )
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f24]) ).
fof(f26,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f8,f24,f21]) ).
fof(f28,definition,
( spl4_3
<=> sK3 = f(g(sK3)) ),
introduced(definition,[new_symbols(definition,[spl4_3])],[avatar_definition]) ).
fof(f30,plain,
( sK3 = f(g(sK3))
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f28]) ).
fof(f31,plain,
( spl4_3
| spl4_2 ),
inference(avatar_split_clause,[],[f19,f24,f28]) ).
fof(f33,definition,
( spl4_4
<=> sK2 = g(f(sK2)) ),
introduced(definition,[new_symbols(definition,[spl4_4])],[avatar_definition]) ).
fof(f34,plain,
( sK2 != g(f(sK2))
| spl4_4 ),
inference(avatar_component_clause,[],[f33]) ).
fof(f35,plain,
( sK2 = g(f(sK2))
| ~ spl4_4 ),
inference(avatar_component_clause,[],[f33]) ).
fof(f36,plain,
( spl4_1
| spl4_4 ),
inference(avatar_split_clause,[],[f18,f33,f21]) ).
fof(f37,plain,
( spl4_3
| spl4_4 ),
inference(avatar_split_clause,[],[f17,f33,f28]) ).
fof(f39,definition,
( spl4_5
<=> ! [X2] :
( sK1(X2) = X2
| sK1(X2) = f(g(sK1(X2))) ) ),
introduced(definition,[new_symbols(definition,[spl4_5])],[avatar_definition]) ).
fof(f40,plain,
( ! [X2] :
( sK1(X2) = f(g(sK1(X2)))
| sK1(X2) = X2 )
| ~ spl4_5 ),
inference(avatar_component_clause,[],[f39]) ).
fof(f42,definition,
( spl4_6
<=> ! [X0] :
( sK0(X0) = X0
| sK0(X0) = g(f(sK0(X0))) ) ),
introduced(definition,[new_symbols(definition,[spl4_6])],[avatar_definition]) ).
fof(f43,plain,
( ! [X0] :
( sK0(X0) = g(f(sK0(X0)))
| sK0(X0) = X0 )
| ~ spl4_6 ),
inference(avatar_component_clause,[],[f42]) ).
fof(f44,plain,
( spl4_5
| spl4_6 ),
inference(avatar_split_clause,[],[f12,f42,f39]) ).
fof(f46,definition,
( spl4_7
<=> ! [X2] :
( sK1(X2) != X2
| sK1(X2) != f(g(sK1(X2))) ) ),
introduced(definition,[new_symbols(definition,[spl4_7])],[avatar_definition]) ).
fof(f47,plain,
( ! [X2] :
( sK1(X2) != f(g(sK1(X2)))
| sK1(X2) != X2 )
| ~ spl4_7 ),
inference(avatar_component_clause,[],[f46]) ).
fof(f48,plain,
( spl4_7
| spl4_6 ),
inference(avatar_split_clause,[],[f13,f42,f46]) ).
fof(f50,definition,
( spl4_8
<=> ! [X0] :
( sK0(X0) != X0
| sK0(X0) != g(f(sK0(X0))) ) ),
introduced(definition,[new_symbols(definition,[spl4_8])],[avatar_definition]) ).
fof(f51,plain,
( ! [X0] :
( sK0(X0) != g(f(sK0(X0)))
| sK0(X0) != X0 )
| ~ spl4_8 ),
inference(avatar_component_clause,[],[f50]) ).
fof(f52,plain,
( spl4_5
| spl4_8 ),
inference(avatar_split_clause,[],[f14,f50,f39]) ).
fof(f53,plain,
( spl4_7
| spl4_8 ),
inference(avatar_split_clause,[],[f15,f50,f46]) ).
fof(f54,plain,
( ! [X0] :
( g(sK1(X0)) != g(sK1(X0))
| sK2 = g(sK1(X0))
| sK1(X0) = X0 )
| ~ spl4_2
| ~ spl4_5 ),
inference(superposition,[],[f25,f40]) ).
fof(f55,plain,
( ! [X0] :
( sK2 = g(sK1(X0))
| sK1(X0) = X0 )
| ~ spl4_2
| ~ spl4_5 ),
inference(trivial_inequality_removal,[],[f54]) ).
fof(f58,plain,
( ! [X0] :
( f(sK2) = sK1(X0)
| sK1(X0) = X0
| sK1(X0) = X0 )
| ~ spl4_2
| ~ spl4_5 ),
inference(superposition,[],[f40,f55]) ).
fof(f59,plain,
( ! [X0] :
( f(sK2) = sK1(X0)
| sK1(X0) = X0 )
| ~ spl4_2
| ~ spl4_5 ),
inference(duplicate_literal_removal,[],[f58]) ).
fof(f64,plain,
( ! [X0] :
( f(sK2) != X0
| sK1(X0) = X0 )
| ~ spl4_2
| ~ spl4_5 ),
inference(equality_factoring,[],[f59]) ).
fof(f69,plain,
( f(sK2) = sK1(f(sK2))
| ~ spl4_2
| ~ spl4_5 ),
inference(equality_resolution,[],[f64]) ).
fof(f70,plain,
( f(sK2) != f(g(f(sK2)))
| f(sK2) != f(sK2)
| ~ spl4_2
| ~ spl4_5
| ~ spl4_7 ),
inference(superposition,[],[f47,f69]) ).
fof(f71,plain,
( f(sK2) != f(g(f(sK2)))
| ~ spl4_2
| ~ spl4_5
| ~ spl4_7 ),
inference(trivial_inequality_removal,[],[f70]) ).
fof(f72,plain,
( f(sK2) != f(sK2)
| ~ spl4_2
| ~ spl4_4
| ~ spl4_5
| ~ spl4_7 ),
inference(forward_demodulation,[],[f71,f35]) ).
fof(f73,plain,
( $false
| ~ spl4_2
| ~ spl4_4
| ~ spl4_5
| ~ spl4_7 ),
inference(trivial_inequality_removal,[],[f72]) ).
fof(f74,plain,
( ~ spl4_2
| ~ spl4_4
| ~ spl4_5
| ~ spl4_7 ),
inference(avatar_contradiction_clause,[],[f73]) ).
fof(f75,plain,
( ! [X0] :
( sK0(X0) != sK0(X0)
| sK0(X0) = sK2
| sK0(X0) = X0 )
| ~ spl4_2
| ~ spl4_6 ),
inference(superposition,[],[f25,f43]) ).
fof(f76,plain,
( ! [X0] :
( sK0(X0) = sK2
| sK0(X0) = X0 )
| ~ spl4_2
| ~ spl4_6 ),
inference(trivial_inequality_removal,[],[f75]) ).
fof(f78,plain,
( ! [X0] :
( sK2 != X0
| sK0(X0) = X0 )
| ~ spl4_2
| ~ spl4_6 ),
inference(equality_factoring,[],[f76]) ).
fof(f85,plain,
( sK2 = sK0(sK2)
| ~ spl4_2
| ~ spl4_6 ),
inference(equality_resolution,[],[f78]) ).
fof(f87,plain,
( sK2 != g(f(sK2))
| sK2 != sK2
| ~ spl4_2
| ~ spl4_6
| ~ spl4_8 ),
inference(superposition,[],[f51,f85]) ).
fof(f88,plain,
( sK2 != g(f(sK2))
| ~ spl4_2
| ~ spl4_6
| ~ spl4_8 ),
inference(trivial_inequality_removal,[],[f87]) ).
fof(f92,plain,
( ~ spl4_4
| ~ spl4_2
| ~ spl4_6
| ~ spl4_8 ),
inference(avatar_split_clause,[],[f88,f50,f42,f24,f33]) ).
fof(f97,plain,
( g(sK3) != g(sK3)
| sK2 = g(sK3)
| ~ spl4_2
| ~ spl4_3 ),
inference(superposition,[],[f25,f30]) ).
fof(f98,plain,
( sK2 = g(sK3)
| ~ spl4_2
| ~ spl4_3 ),
inference(trivial_inequality_removal,[],[f97]) ).
fof(f99,plain,
( sK3 = f(sK2)
| ~ spl4_2
| ~ spl4_3 ),
inference(superposition,[],[f30,f98]) ).
fof(f103,plain,
( ! [X0] :
( f(sK0(X0)) != f(sK0(X0))
| f(sK0(X0)) = sK3
| sK0(X0) = X0 )
| ~ spl4_1
| ~ spl4_6 ),
inference(superposition,[],[f22,f43]) ).
fof(f104,plain,
( ! [X0] :
( f(sK0(X0)) = sK3
| sK0(X0) = X0 )
| ~ spl4_1
| ~ spl4_6 ),
inference(trivial_inequality_removal,[],[f103]) ).
fof(f105,plain,
( sK2 != g(sK3)
| ~ spl4_2
| ~ spl4_3
| spl4_4 ),
inference(superposition,[],[f34,f99]) ).
fof(f106,plain,
( $false
| ~ spl4_2
| ~ spl4_3
| spl4_4 ),
inference(forward_subsumption_resolution,[],[f105,f98]) ).
fof(f107,plain,
( ~ spl4_2
| ~ spl4_3
| spl4_4 ),
inference(avatar_contradiction_clause,[],[f106]) ).
fof(f114,plain,
( ! [X0] :
( sK0(X0) = g(sK3)
| sK0(X0) = X0
| sK0(X0) = X0 )
| ~ spl4_1
| ~ spl4_6 ),
inference(superposition,[],[f43,f104]) ).
fof(f115,plain,
( ! [X0] :
( sK0(X0) = g(sK3)
| sK0(X0) = X0 )
| ~ spl4_1
| ~ spl4_6 ),
inference(duplicate_literal_removal,[],[f114]) ).
fof(f120,plain,
( ! [X0] :
( g(sK3) != X0
| sK0(X0) = X0 )
| ~ spl4_1
| ~ spl4_6 ),
inference(equality_factoring,[],[f115]) ).
fof(f125,plain,
( g(sK3) = sK0(g(sK3))
| ~ spl4_1
| ~ spl4_6 ),
inference(equality_resolution,[],[f120]) ).
fof(f126,plain,
( g(sK3) != g(f(g(sK3)))
| g(sK3) != g(sK3)
| ~ spl4_1
| ~ spl4_6
| ~ spl4_8 ),
inference(superposition,[],[f51,f125]) ).
fof(f127,plain,
( g(sK3) != g(f(g(sK3)))
| ~ spl4_1
| ~ spl4_6
| ~ spl4_8 ),
inference(trivial_inequality_removal,[],[f126]) ).
fof(f128,plain,
( g(sK3) != g(sK3)
| ~ spl4_1
| ~ spl4_3
| ~ spl4_6
| ~ spl4_8 ),
inference(forward_demodulation,[],[f127,f30]) ).
fof(f129,plain,
( $false
| ~ spl4_1
| ~ spl4_3
| ~ spl4_6
| ~ spl4_8 ),
inference(trivial_inequality_removal,[],[f128]) ).
fof(f130,plain,
( ~ spl4_1
| ~ spl4_3
| ~ spl4_6
| ~ spl4_8 ),
inference(avatar_contradiction_clause,[],[f129]) ).
fof(f132,plain,
( ! [X0] :
( sK1(X0) != sK1(X0)
| sK3 = sK1(X0)
| sK1(X0) = X0 )
| ~ spl4_1
| ~ spl4_5 ),
inference(superposition,[],[f22,f40]) ).
fof(f133,plain,
( ! [X0] :
( sK3 = sK1(X0)
| sK1(X0) = X0 )
| ~ spl4_1
| ~ spl4_5 ),
inference(trivial_inequality_removal,[],[f132]) ).
fof(f137,plain,
( ! [X0] :
( sK3 != X0
| sK1(X0) = X0 )
| ~ spl4_1
| ~ spl4_5 ),
inference(equality_factoring,[],[f133]) ).
fof(f141,plain,
( sK3 = sK1(sK3)
| ~ spl4_1
| ~ spl4_5 ),
inference(equality_resolution,[],[f137]) ).
fof(f142,plain,
( sK3 != f(g(sK3))
| sK3 != sK3
| ~ spl4_1
| ~ spl4_5
| ~ spl4_7 ),
inference(superposition,[],[f47,f141]) ).
fof(f143,plain,
( sK3 != f(g(sK3))
| ~ spl4_1
| ~ spl4_5
| ~ spl4_7 ),
inference(trivial_inequality_removal,[],[f142]) ).
fof(f144,plain,
( $false
| ~ spl4_1
| ~ spl4_3
| ~ spl4_5
| ~ spl4_7 ),
inference(forward_subsumption_resolution,[],[f143,f30]) ).
fof(f145,plain,
( ~ spl4_1
| ~ spl4_3
| ~ spl4_5
| ~ spl4_7 ),
inference(avatar_contradiction_clause,[],[f144]) ).
cnf(s1,plain,
( spl4_1
| spl4_2 ),
inference(sat_conversion,[],[f26]) ).
cnf(s2,plain,
( spl4_2
| spl4_3 ),
inference(sat_conversion,[],[f31]) ).
cnf(s3,plain,
( spl4_1
| spl4_4 ),
inference(sat_conversion,[],[f36]) ).
cnf(s4,plain,
( spl4_3
| spl4_4 ),
inference(sat_conversion,[],[f37]) ).
cnf(s5,plain,
( spl4_5
| spl4_6 ),
inference(sat_conversion,[],[f44]) ).
cnf(s6,plain,
( spl4_6
| spl4_7 ),
inference(sat_conversion,[],[f48]) ).
cnf(s7,plain,
( spl4_5
| spl4_8 ),
inference(sat_conversion,[],[f52]) ).
cnf(s8,plain,
( spl4_7
| spl4_8 ),
inference(sat_conversion,[],[f53]) ).
cnf(s9,plain,
( ~ spl4_2
| ~ spl4_4
| ~ spl4_5
| ~ spl4_7 ),
inference(sat_conversion,[],[f74]) ).
cnf(s11,plain,
( ~ spl4_2
| ~ spl4_4
| ~ spl4_6
| ~ spl4_8 ),
inference(sat_conversion,[],[f92]) ).
cnf(s13,plain,
( ~ spl4_2
| ~ spl4_3
| spl4_4 ),
inference(sat_conversion,[],[f107]) ).
cnf(s15,plain,
( ~ spl4_1
| ~ spl4_3
| ~ spl4_6
| ~ spl4_8 ),
inference(sat_conversion,[],[f130]) ).
cnf(s16,plain,
( ~ spl4_1
| ~ spl4_3
| ~ spl4_5
| ~ spl4_7 ),
inference(sat_conversion,[],[f145]) ).
cnf(s17,plain,
( spl4_5
| spl4_1 ),
inference(rat,[],[s11,s5,s7,s3,s1]) ).
cnf(s18,plain,
( ~ spl4_5
| ~ spl4_2
| ~ spl4_4 ),
inference(rat,[],[s11,s6,s8,s9]) ).
cnf(s19,plain,
spl4_1,
inference(rat,[],[s18,s17,s1,s3]) ).
cnf(s20,plain,
( ~ spl4_4
| ~ spl4_2 ),
inference(rat,[],[s11,s5,s7,s18]) ).
cnf(s21,plain,
~ spl4_2,
inference(rat,[],[s13,s4,s20]) ).
cnf(s22,plain,
spl4_3,
inference(rat,[],[s2,s21]) ).
cnf(s23,plain,
spl4_5,
inference(rat,[],[s15,s5,s7,s19,s22]) ).
cnf(s24,plain,
~ spl4_7,
inference(rat,[],[s16,s22,s19,s23]) ).
cnf(s25,plain,
spl4_8,
inference(rat,[],[s8,s24]) ).
cnf(s26,plain,
spl4_6,
inference(rat,[],[s6,s24]) ).
cnf(s28,plain,
$false,
inference(rat,[],[s15,s22,s19,s25,s26]) ).
fof(f146,plain,
$false,
inference(avatar_sat_refutation,[],[s28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN551+2 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n008.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 : Mon Sep 28 16:28:54 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.22 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.09/0.26 % (2380620)Will run a generic schedule for satisfiability detection.
% 0.09/0.26 % (2380628)dis+10_1_sil=32000:sp=arity:random_seed=783130151:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.26 % (2380628) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2380620-2380628"...
% 0.09/0.26 % (2380626)% WARNING: option uhcvi not known.
% 0.09/0.26 % (2380628)...printing done.
% 0.09/0.26 % (2380628)Refutation found. Thanks to Tanya!
% 0.09/0.26 % SZS status Theorem for theBenchmark
% 0.09/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.26 % (2380628)------------------------------
% 0.20/0.26 % (2380628)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.26 % (2380628)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.26 % (2380628)CaDiCaL version: 2.1.3
% 0.20/0.26 % (2380628)Termination reason: Refutation
% 0.20/0.26 % (2380628)Time elapsed: 0.003 s
% 0.20/0.26 % (2380628)Peak memory usage: 12 MB
% 0.20/0.26 % (2380628)Instructions burned: 8 (million)
% 0.20/0.26 % (2380620)Success in time 0.032 s
% 0.20/0.26 % Vampire exiting
%------------------------------------------------------------------------------