%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN551+1 : 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 : n010.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.19s 0.29s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 13
% Syntax : Number of formulae : 142 ( 11 unt; 12 def)
% Number of atoms : 485 ( 172 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 605 ( 262 ~; 304 |; 16 &)
% ( 15 <=>; 6 =>; 0 <=; 2 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 14 ( 12 usr; 13 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-1 aty)
% Number of variables : 76 ( 0 sgn 66 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ? [X0] : X0 = f(g(X0))
& ! [X1,X2] :
( ( X1 = f(g(X1))
& X2 = f(g(X2)) )
=> X1 = X2 ) )
<=> ( ? [X0] : X0 = g(f(X0))
& ! [X1,X2] :
( ( X1 = g(f(X1))
& X2 = g(f(X2)) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_cute_thing) ).
fof(f2,negated_conjecture,
~ ( ( ? [X0] : X0 = f(g(X0))
& ! [X1,X2] :
( ( X1 = f(g(X1))
& X2 = f(g(X2)) )
=> X1 = X2 ) )
<=> ( ? [X0] : X0 = g(f(X0))
& ! [X1,X2] :
( ( X1 = g(f(X1))
& X2 = g(f(X2)) )
=> X1 = X2 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
~ ( ( ? [X0] : X0 = f(g(X0))
& ! [X1,X2] :
( ( X1 = f(g(X1))
& X2 = f(g(X2)) )
=> X1 = X2 ) )
<=> ( ? [X3] : g(f(X3)) = X3
& ! [X4,X5] :
( ( g(f(X4)) = X4
& g(f(X5)) = X5 )
=> X4 = X5 ) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ( ? [X0] : X0 = f(g(X0))
& ! [X1,X2] :
( X1 = X2
| f(g(X1)) != X1
| f(g(X2)) != X2 ) )
<~> ( ? [X3] : g(f(X3)) = X3
& ! [X4,X5] :
( X4 = X5
| g(f(X4)) != X4
| g(f(X5)) != X5 ) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ( ? [X0] : X0 = f(g(X0))
& ! [X1,X2] :
( X1 = X2
| f(g(X1)) != X1
| f(g(X2)) != X2 ) )
<~> ( ? [X3] : g(f(X3)) = X3
& ! [X4,X5] :
( X4 = X5
| g(f(X4)) != X4
| g(f(X5)) != X5 ) ) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
! [X4,X5] :
( g(f(X5)) != X5
| g(f(X4)) != X4
| X4 = X5
| sK2 = f(g(sK2)) ),
inference(cnf_transformation,[],[f5]) ).
fof(f7,plain,
! [X2,X1,X4,X5] :
( g(f(X5)) != X5
| g(f(X4)) != X4
| X4 = X5
| f(g(X2)) != X2
| f(g(X1)) != X1
| X1 = X2 ),
inference(cnf_transformation,[],[f5]) ).
fof(f8,plain,
! [X3,X0] :
( sK4 = g(f(sK4))
| g(f(X3)) != X3
| sK0 != sK1
| f(g(X0)) != X0 ),
inference(cnf_transformation,[],[f5]) ).
fof(f9,plain,
! [X3,X0] :
( sK3 = g(f(sK3))
| g(f(X3)) != X3
| sK0 != sK1
| f(g(X0)) != X0 ),
inference(cnf_transformation,[],[f5]) ).
fof(f10,plain,
! [X3,X0] :
( sK3 != sK4
| g(f(X3)) != X3
| sK0 != sK1
| f(g(X0)) != X0 ),
inference(cnf_transformation,[],[f5]) ).
fof(f11,plain,
! [X3,X0] :
( sK4 = g(f(sK4))
| g(f(X3)) != X3
| sK0 = f(g(sK0))
| f(g(X0)) != X0 ),
inference(cnf_transformation,[],[f5]) ).
fof(f12,plain,
! [X3,X0] :
( sK3 = g(f(sK3))
| g(f(X3)) != X3
| sK0 = f(g(sK0))
| f(g(X0)) != X0 ),
inference(cnf_transformation,[],[f5]) ).
fof(f13,plain,
! [X3,X0] :
( sK3 != sK4
| g(f(X3)) != X3
| sK0 = f(g(sK0))
| f(g(X0)) != X0 ),
inference(cnf_transformation,[],[f5]) ).
fof(f14,plain,
! [X3,X0] :
( sK4 = g(f(sK4))
| g(f(X3)) != X3
| sK1 = f(g(sK1))
| f(g(X0)) != X0 ),
inference(cnf_transformation,[],[f5]) ).
fof(f15,plain,
! [X3,X0] :
( sK3 = g(f(sK3))
| g(f(X3)) != X3
| sK1 = f(g(sK1))
| f(g(X0)) != X0 ),
inference(cnf_transformation,[],[f5]) ).
fof(f16,plain,
! [X3,X0] :
( sK3 != sK4
| g(f(X3)) != X3
| sK1 = f(g(sK1))
| f(g(X0)) != X0 ),
inference(cnf_transformation,[],[f5]) ).
fof(f17,plain,
! [X2,X1] :
( sK5 = g(f(sK5))
| f(g(X2)) != X2
| f(g(X1)) != X1
| X1 = X2 ),
inference(cnf_transformation,[],[f5]) ).
fof(f18,plain,
( sK5 = g(f(sK5))
| sK2 = f(g(sK2)) ),
inference(cnf_transformation,[],[f5]) ).
fof(f20,definition,
( spl6_1
<=> sK2 = f(g(sK2)) ),
introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).
fof(f22,plain,
( sK2 = f(g(sK2))
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f20]) ).
fof(f24,definition,
( spl6_2
<=> ! [X4,X5] :
( g(f(X5)) != X5
| g(f(X4)) != X4
| X4 = X5 ) ),
introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).
fof(f25,plain,
( ! [X4,X5] :
( g(f(X5)) != X5
| g(f(X4)) != X4
| X4 = X5 )
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f24]) ).
fof(f26,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f6,f24,f20]) ).
fof(f28,definition,
( spl6_3
<=> ! [X2,X1] :
( f(g(X2)) != X2
| f(g(X1)) != X1
| X1 = X2 ) ),
introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition]) ).
fof(f29,plain,
( ! [X2,X1] :
( f(g(X2)) != X2
| f(g(X1)) != X1
| X1 = X2 )
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f28]) ).
fof(f30,plain,
( spl6_3
| spl6_2 ),
inference(avatar_split_clause,[],[f7,f24,f28]) ).
fof(f32,definition,
( spl6_4
<=> ! [X0] : f(g(X0)) != X0 ),
introduced(definition,[new_symbols(definition,[spl6_4])],[avatar_definition]) ).
fof(f33,plain,
( ! [X0] : f(g(X0)) != X0
| ~ spl6_4 ),
inference(avatar_component_clause,[],[f32]) ).
fof(f35,definition,
( spl6_5
<=> sK0 = sK1 ),
introduced(definition,[new_symbols(definition,[spl6_5])],[avatar_definition]) ).
fof(f37,plain,
( sK0 != sK1
| spl6_5 ),
inference(avatar_component_clause,[],[f35]) ).
fof(f39,definition,
( spl6_6
<=> ! [X3] : g(f(X3)) != X3 ),
introduced(definition,[new_symbols(definition,[spl6_6])],[avatar_definition]) ).
fof(f40,plain,
( ! [X3] : g(f(X3)) != X3
| ~ spl6_6 ),
inference(avatar_component_clause,[],[f39]) ).
fof(f42,definition,
( spl6_7
<=> sK4 = g(f(sK4)) ),
introduced(definition,[new_symbols(definition,[spl6_7])],[avatar_definition]) ).
fof(f44,plain,
( sK4 = g(f(sK4))
| ~ spl6_7 ),
inference(avatar_component_clause,[],[f42]) ).
fof(f45,plain,
( spl6_4
| ~ spl6_5
| spl6_6
| spl6_7 ),
inference(avatar_split_clause,[],[f8,f42,f39,f35,f32]) ).
fof(f47,definition,
( spl6_8
<=> sK3 = g(f(sK3)) ),
introduced(definition,[new_symbols(definition,[spl6_8])],[avatar_definition]) ).
fof(f49,plain,
( sK3 = g(f(sK3))
| ~ spl6_8 ),
inference(avatar_component_clause,[],[f47]) ).
fof(f50,plain,
( spl6_4
| ~ spl6_5
| spl6_6
| spl6_8 ),
inference(avatar_split_clause,[],[f9,f47,f39,f35,f32]) ).
fof(f52,definition,
( spl6_9
<=> sK3 = sK4 ),
introduced(definition,[new_symbols(definition,[spl6_9])],[avatar_definition]) ).
fof(f54,plain,
( sK3 != sK4
| spl6_9 ),
inference(avatar_component_clause,[],[f52]) ).
fof(f55,plain,
( spl6_4
| ~ spl6_5
| spl6_6
| ~ spl6_9 ),
inference(avatar_split_clause,[],[f10,f52,f39,f35,f32]) ).
fof(f57,definition,
( spl6_10
<=> sK0 = f(g(sK0)) ),
introduced(definition,[new_symbols(definition,[spl6_10])],[avatar_definition]) ).
fof(f59,plain,
( sK0 = f(g(sK0))
| ~ spl6_10 ),
inference(avatar_component_clause,[],[f57]) ).
fof(f60,plain,
( spl6_4
| spl6_10
| spl6_6
| spl6_7 ),
inference(avatar_split_clause,[],[f11,f42,f39,f57,f32]) ).
fof(f61,plain,
( spl6_4
| spl6_10
| spl6_6
| spl6_8 ),
inference(avatar_split_clause,[],[f12,f47,f39,f57,f32]) ).
fof(f62,plain,
( spl6_4
| spl6_10
| spl6_6
| ~ spl6_9 ),
inference(avatar_split_clause,[],[f13,f52,f39,f57,f32]) ).
fof(f64,definition,
( spl6_11
<=> sK1 = f(g(sK1)) ),
introduced(definition,[new_symbols(definition,[spl6_11])],[avatar_definition]) ).
fof(f66,plain,
( sK1 = f(g(sK1))
| ~ spl6_11 ),
inference(avatar_component_clause,[],[f64]) ).
fof(f67,plain,
( spl6_4
| spl6_11
| spl6_6
| spl6_7 ),
inference(avatar_split_clause,[],[f14,f42,f39,f64,f32]) ).
fof(f68,plain,
( spl6_4
| spl6_11
| spl6_6
| spl6_8 ),
inference(avatar_split_clause,[],[f15,f47,f39,f64,f32]) ).
fof(f69,plain,
( spl6_4
| spl6_11
| spl6_6
| ~ spl6_9 ),
inference(avatar_split_clause,[],[f16,f52,f39,f64,f32]) ).
fof(f71,definition,
( spl6_12
<=> sK5 = g(f(sK5)) ),
introduced(definition,[new_symbols(definition,[spl6_12])],[avatar_definition]) ).
fof(f73,plain,
( sK5 = g(f(sK5))
| ~ spl6_12 ),
inference(avatar_component_clause,[],[f71]) ).
fof(f74,plain,
( spl6_3
| spl6_12 ),
inference(avatar_split_clause,[],[f17,f71,f28]) ).
fof(f75,plain,
( spl6_1
| spl6_12 ),
inference(avatar_split_clause,[],[f18,f71,f20]) ).
fof(f76,plain,
( f(sK5) != f(sK5)
| ~ spl6_4
| ~ spl6_12 ),
inference(superposition,[],[f33,f73]) ).
fof(f77,plain,
( $false
| ~ spl6_4
| ~ spl6_12 ),
inference(trivial_inequality_removal,[],[f76]) ).
fof(f78,plain,
( ~ spl6_4
| ~ spl6_12 ),
inference(avatar_contradiction_clause,[],[f77]) ).
fof(f79,plain,
( sK5 != sK5
| ~ spl6_6
| ~ spl6_12 ),
inference(superposition,[],[f40,f73]) ).
fof(f80,plain,
( $false
| ~ spl6_6
| ~ spl6_12 ),
inference(trivial_inequality_removal,[],[f79]) ).
fof(f81,plain,
( ~ spl6_6
| ~ spl6_12 ),
inference(avatar_contradiction_clause,[],[f80]) ).
fof(f82,plain,
( ! [X0] :
( sK5 != sK5
| g(f(X0)) != X0
| sK5 = X0 )
| ~ spl6_2
| ~ spl6_12 ),
inference(superposition,[],[f25,f73]) ).
fof(f87,plain,
( ! [X0] :
( sK3 != sK3
| g(f(X0)) != X0
| sK3 = X0 )
| ~ spl6_2
| ~ spl6_8 ),
inference(superposition,[],[f25,f49]) ).
fof(f88,plain,
( ! [X0] :
( g(f(X0)) != X0
| sK3 = X0 )
| ~ spl6_2
| ~ spl6_8 ),
inference(trivial_inequality_removal,[],[f87]) ).
fof(f95,plain,
( sK4 != sK4
| sK3 = sK4
| ~ spl6_2
| ~ spl6_7
| ~ spl6_8 ),
inference(superposition,[],[f88,f44]) ).
fof(f96,plain,
( sK3 = sK4
| ~ spl6_2
| ~ spl6_7
| ~ spl6_8 ),
inference(trivial_inequality_removal,[],[f95]) ).
fof(f98,plain,
( $false
| ~ spl6_2
| ~ spl6_7
| ~ spl6_8
| spl6_9 ),
inference(forward_subsumption_resolution,[],[f96,f54]) ).
fof(f99,plain,
( ~ spl6_2
| ~ spl6_7
| ~ spl6_8
| spl6_9 ),
inference(avatar_contradiction_clause,[],[f98]) ).
fof(f107,plain,
( ! [X0] :
( sK2 != sK2
| f(g(X0)) != X0
| sK2 = X0 )
| ~ spl6_1
| ~ spl6_3 ),
inference(superposition,[],[f29,f22]) ).
fof(f108,plain,
( ! [X0] :
( f(g(X0)) != X0
| sK2 = X0 )
| ~ spl6_1
| ~ spl6_3 ),
inference(trivial_inequality_removal,[],[f107]) ).
fof(f117,plain,
( f(sK4) != f(sK4)
| sK2 = f(sK4)
| ~ spl6_1
| ~ spl6_3
| ~ spl6_7 ),
inference(superposition,[],[f108,f44]) ).
fof(f118,plain,
( f(sK3) != f(sK3)
| sK2 = f(sK3)
| ~ spl6_1
| ~ spl6_3
| ~ spl6_8 ),
inference(superposition,[],[f108,f49]) ).
fof(f119,plain,
( sK2 = f(sK3)
| ~ spl6_1
| ~ spl6_3
| ~ spl6_8 ),
inference(trivial_inequality_removal,[],[f118]) ).
fof(f120,plain,
( sK2 = f(sK4)
| ~ spl6_1
| ~ spl6_3
| ~ spl6_7 ),
inference(trivial_inequality_removal,[],[f117]) ).
fof(f122,plain,
( sK3 = g(sK2)
| ~ spl6_1
| ~ spl6_3
| ~ spl6_8 ),
inference(superposition,[],[f49,f119]) ).
fof(f131,plain,
( sK4 = g(sK2)
| ~ spl6_1
| ~ spl6_3
| ~ spl6_7 ),
inference(superposition,[],[f44,f120]) ).
fof(f132,plain,
( sK3 = sK4
| ~ spl6_1
| ~ spl6_3
| ~ spl6_7
| ~ spl6_8 ),
inference(forward_demodulation,[],[f131,f122]) ).
fof(f133,plain,
( $false
| ~ spl6_1
| ~ spl6_3
| ~ spl6_7
| ~ spl6_8
| spl6_9 ),
inference(forward_subsumption_resolution,[],[f132,f54]) ).
fof(f134,plain,
( ~ spl6_1
| ~ spl6_3
| ~ spl6_7
| ~ spl6_8
| spl6_9 ),
inference(avatar_contradiction_clause,[],[f133]) ).
fof(f140,plain,
( ! [X0] :
( sK0 != sK0
| f(g(X0)) != X0
| sK0 = X0 )
| ~ spl6_3
| ~ spl6_10 ),
inference(superposition,[],[f29,f59]) ).
fof(f141,plain,
( ! [X0] :
( f(g(X0)) != X0
| sK0 = X0 )
| ~ spl6_3
| ~ spl6_10 ),
inference(trivial_inequality_removal,[],[f140]) ).
fof(f161,plain,
( g(sK2) != g(sK2)
| ~ spl6_1
| ~ spl6_6 ),
inference(superposition,[],[f40,f22]) ).
fof(f172,plain,
( $false
| ~ spl6_1
| ~ spl6_6 ),
inference(trivial_inequality_removal,[],[f161]) ).
fof(f173,plain,
( ~ spl6_1
| ~ spl6_6 ),
inference(avatar_contradiction_clause,[],[f172]) ).
fof(f180,plain,
( sK2 != sK2
| ~ spl6_1
| ~ spl6_4 ),
inference(superposition,[],[f33,f22]) ).
fof(f187,plain,
( $false
| ~ spl6_1
| ~ spl6_4 ),
inference(trivial_inequality_removal,[],[f180]) ).
fof(f188,plain,
( ~ spl6_1
| ~ spl6_4 ),
inference(avatar_contradiction_clause,[],[f187]) ).
fof(f191,plain,
( ! [X0] :
( g(f(X0)) != X0
| sK5 = X0 )
| ~ spl6_2
| ~ spl6_12 ),
inference(trivial_inequality_removal,[],[f82]) ).
fof(f198,plain,
( sK1 != sK1
| sK0 = sK1
| ~ spl6_3
| ~ spl6_10
| ~ spl6_11 ),
inference(superposition,[],[f141,f66]) ).
fof(f199,plain,
( sK0 = sK1
| ~ spl6_3
| ~ spl6_10
| ~ spl6_11 ),
inference(trivial_inequality_removal,[],[f198]) ).
fof(f201,plain,
( $false
| ~ spl6_3
| spl6_5
| ~ spl6_10
| ~ spl6_11 ),
inference(forward_subsumption_resolution,[],[f199,f37]) ).
fof(f202,plain,
( ~ spl6_3
| spl6_5
| ~ spl6_10
| ~ spl6_11 ),
inference(avatar_contradiction_clause,[],[f201]) ).
fof(f215,plain,
( g(sK1) != g(sK1)
| sK5 = g(sK1)
| ~ spl6_2
| ~ spl6_11
| ~ spl6_12 ),
inference(superposition,[],[f191,f66]) ).
fof(f216,plain,
( g(sK0) != g(sK0)
| sK5 = g(sK0)
| ~ spl6_2
| ~ spl6_10
| ~ spl6_12 ),
inference(superposition,[],[f191,f59]) ).
fof(f217,plain,
( sK5 = g(sK0)
| ~ spl6_2
| ~ spl6_10
| ~ spl6_12 ),
inference(trivial_inequality_removal,[],[f216]) ).
fof(f218,plain,
( sK5 = g(sK1)
| ~ spl6_2
| ~ spl6_11
| ~ spl6_12 ),
inference(trivial_inequality_removal,[],[f215]) ).
fof(f224,plain,
( sK0 = f(sK5)
| ~ spl6_2
| ~ spl6_10
| ~ spl6_12 ),
inference(superposition,[],[f59,f217]) ).
fof(f230,plain,
( sK1 = f(sK5)
| ~ spl6_2
| ~ spl6_11
| ~ spl6_12 ),
inference(superposition,[],[f66,f218]) ).
fof(f231,plain,
( sK0 = sK1
| ~ spl6_2
| ~ spl6_10
| ~ spl6_11
| ~ spl6_12 ),
inference(forward_demodulation,[],[f230,f224]) ).
fof(f232,plain,
( $false
| ~ spl6_2
| spl6_5
| ~ spl6_10
| ~ spl6_11
| ~ spl6_12 ),
inference(forward_subsumption_resolution,[],[f231,f37]) ).
fof(f233,plain,
( ~ spl6_2
| spl6_5
| ~ spl6_10
| ~ spl6_11
| ~ spl6_12 ),
inference(avatar_contradiction_clause,[],[f232]) ).
cnf(s1,plain,
( spl6_1
| spl6_2 ),
inference(sat_conversion,[],[f26]) ).
cnf(s2,plain,
( spl6_2
| spl6_3 ),
inference(sat_conversion,[],[f30]) ).
cnf(s3,plain,
( spl6_4
| ~ spl6_5
| spl6_6
| spl6_7 ),
inference(sat_conversion,[],[f45]) ).
cnf(s4,plain,
( spl6_4
| ~ spl6_5
| spl6_6
| spl6_8 ),
inference(sat_conversion,[],[f50]) ).
cnf(s5,plain,
( spl6_4
| ~ spl6_5
| spl6_6
| ~ spl6_9 ),
inference(sat_conversion,[],[f55]) ).
cnf(s6,plain,
( spl6_4
| spl6_6
| spl6_7
| spl6_10 ),
inference(sat_conversion,[],[f60]) ).
cnf(s7,plain,
( spl6_4
| spl6_6
| spl6_8
| spl6_10 ),
inference(sat_conversion,[],[f61]) ).
cnf(s8,plain,
( spl6_4
| spl6_6
| ~ spl6_9
| spl6_10 ),
inference(sat_conversion,[],[f62]) ).
cnf(s9,plain,
( spl6_4
| spl6_6
| spl6_7
| spl6_11 ),
inference(sat_conversion,[],[f67]) ).
cnf(s10,plain,
( spl6_4
| spl6_6
| spl6_8
| spl6_11 ),
inference(sat_conversion,[],[f68]) ).
cnf(s11,plain,
( spl6_4
| spl6_6
| ~ spl6_9
| spl6_11 ),
inference(sat_conversion,[],[f69]) ).
cnf(s12,plain,
( spl6_3
| spl6_12 ),
inference(sat_conversion,[],[f74]) ).
cnf(s13,plain,
( spl6_1
| spl6_12 ),
inference(sat_conversion,[],[f75]) ).
cnf(s14,plain,
( ~ spl6_4
| ~ spl6_12 ),
inference(sat_conversion,[],[f78]) ).
cnf(s15,plain,
( ~ spl6_6
| ~ spl6_12 ),
inference(sat_conversion,[],[f81]) ).
cnf(s16,plain,
( ~ spl6_2
| ~ spl6_7
| ~ spl6_8
| spl6_9 ),
inference(sat_conversion,[],[f99]) ).
cnf(s17,plain,
( ~ spl6_1
| ~ spl6_3
| ~ spl6_7
| ~ spl6_8
| spl6_9 ),
inference(sat_conversion,[],[f134]) ).
cnf(s23,plain,
( ~ spl6_1
| ~ spl6_6 ),
inference(sat_conversion,[],[f173]) ).
cnf(s27,plain,
( ~ spl6_1
| ~ spl6_4 ),
inference(sat_conversion,[],[f188]) ).
cnf(s29,plain,
( ~ spl6_3
| spl6_5
| ~ spl6_10
| ~ spl6_11 ),
inference(sat_conversion,[],[f202]) ).
cnf(s30,plain,
( ~ spl6_2
| spl6_5
| ~ spl6_10
| ~ spl6_11
| ~ spl6_12 ),
inference(sat_conversion,[],[f233]) ).
cnf(s31,plain,
( spl6_7
| spl6_5
| spl6_1 ),
inference(rat,[],[s30,s6,s9,s1,s15,s14,s13]) ).
cnf(s32,plain,
( spl6_11
| ~ spl6_7
| spl6_1 ),
inference(rat,[],[s16,s10,s11,s1,s15,s14,s13]) ).
cnf(s33,plain,
( spl6_5
| spl6_1 ),
inference(rat,[],[s16,s7,s8,s30,s32,s31,s1,s15,s14,s13]) ).
cnf(s34,plain,
spl6_1,
inference(rat,[],[s16,s3,s4,s5,s33,s14,s15,s1,s13]) ).
cnf(s35,plain,
~ spl6_4,
inference(rat,[],[s27,s34]) ).
cnf(s36,plain,
~ spl6_6,
inference(rat,[],[s23,s34]) ).
cnf(s37,plain,
( spl6_11
| ~ spl6_7
| ~ spl6_2 ),
inference(rat,[],[s16,s10,s11,s35,s36]) ).
cnf(s38,plain,
( ~ spl6_11
| ~ spl6_10
| ~ spl6_2
| spl6_5 ),
inference(rat,[],[s12,s29,s30]) ).
cnf(s39,plain,
( ~ spl6_7
| spl6_5
| ~ spl6_2 ),
inference(rat,[],[s16,s7,s8,s38,s37,s35,s36]) ).
cnf(s40,plain,
( spl6_5
| ~ spl6_2 ),
inference(rat,[],[s38,s6,s9,s39,s36,s35]) ).
cnf(s41,plain,
~ spl6_2,
inference(rat,[],[s16,s3,s4,s5,s40,s36,s35]) ).
cnf(s42,plain,
spl6_3,
inference(rat,[],[s2,s41]) ).
cnf(s43,plain,
( spl6_11
| ~ spl6_7 ),
inference(rat,[],[s17,s10,s11,s34,s42,s35,s36]) ).
cnf(s44,plain,
( spl6_10
| ~ spl6_7 ),
inference(rat,[],[s17,s7,s8,s34,s42,s35,s36]) ).
cnf(s45,plain,
~ spl6_7,
inference(rat,[],[s17,s4,s5,s29,s44,s43,s34,s42,s36,s35]) ).
cnf(s46,plain,
spl6_11,
inference(rat,[],[s9,s36,s35,s45]) ).
cnf(s47,plain,
spl6_10,
inference(rat,[],[s6,s36,s35,s45]) ).
cnf(s48,plain,
~ spl6_5,
inference(rat,[],[s3,s35,s36,s45]) ).
cnf(s49,plain,
$false,
inference(rat,[],[s29,s42,s46,s48,s47]) ).
fof(f234,plain,
$false,
inference(avatar_sat_refutation,[],[s49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN551+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20 % Computer : n010.cluster.edu
% 0.08/0.20 % Model : x86_64 x86_64
% 0.08/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20 % Memory : 8046.5625MB
% 0.08/0.20 % OS : Linux 6.8.0-71-generic
% 0.08/0.20 % CPULimit : 300
% 0.08/0.20 % WCLimit : 300
% 0.08/0.20 % DateTime : Mon Sep 28 16:28:32 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23 Running first-order model finding
% 0.08/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.19/0.29 % (2057081)Will run a generic schedule for satisfiability detection.
% 0.19/0.29 % (2057090)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1021052380:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.29 % (2057090) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2057081-2057090"...
% 0.19/0.29 % (2057087)% WARNING: option uhcvi not known.
% 0.19/0.29 % (2057090)...printing done.
% 0.19/0.29 % (2057090)Refutation found. Thanks to Tanya!
% 0.19/0.29 % SZS status Theorem for theBenchmark
% 0.19/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.29 % (2057090)------------------------------
% 0.19/0.29 % (2057090)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.29 % (2057090)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.29 % (2057090)CaDiCaL version: 2.1.3
% 0.19/0.29 % (2057090)Termination reason: Refutation
% 0.19/0.29 % (2057090)Time elapsed: 0.004 s
% 0.19/0.29 % (2057090)Peak memory usage: 12 MB
% 0.19/0.29 % (2057090)Instructions burned: 9 (million)
% 0.19/0.29 % (2057081)Success in time 0.043 s
% 0.19/0.29 % Vampire exiting
%------------------------------------------------------------------------------