%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN015-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n026.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:06:27 PM UTC 2026
% Result : Unsatisfiable 0.07s 0.25s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 30
% Syntax : Number of formulae : 161 ( 7 unt; 14 def)
% Number of atoms : 517 ( 164 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 576 ( 220 ~; 342 |; 0 &)
% ( 14 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 17 ( 15 usr; 15 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 49 ( 0 sgn 49 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
m != n,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_1) ).
fof(f2,negated_conjecture,
! [X0] :
( X0 = j
| X0 != k
| element(X0,j) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_2) ).
fof(f3,plain,
! [X0] :
( j = X0
| k != X0
| element(X0,j) ),
inference(reorient_equations,[],[f2]) ).
fof(f4,negated_conjecture,
! [X0] :
( X0 = j
| X0 = k
| ~ element(X0,j) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_3) ).
fof(f5,plain,
! [X0] :
( ~ element(X0,j)
| k = X0
| j = X0 ),
inference(reorient_equations,[],[f4]) ).
fof(f6,negated_conjecture,
! [X0] :
( X0 = m
| ~ element(X0,m)
| f(X0) != m ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_4) ).
fof(f7,plain,
! [X0] :
( m != f(X0)
| ~ element(X0,m)
| m = X0 ),
inference(reorient_equations,[],[f6]) ).
fof(f8,negated_conjecture,
! [X0] :
( X0 = m
| ~ element(X0,m)
| f(X0) != X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_5) ).
fof(f9,plain,
! [X0] :
( f(X0) != X0
| ~ element(X0,m)
| m = X0 ),
inference(reorient_equations,[],[f8]) ).
fof(f10,negated_conjecture,
! [X0] :
( X0 = m
| ~ element(X0,m)
| element(X0,f(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_6) ).
fof(f11,plain,
! [X0] :
( element(X0,f(X0))
| ~ element(X0,m)
| m = X0 ),
inference(reorient_equations,[],[f10]) ).
fof(f12,negated_conjecture,
! [X0] :
( X0 = m
| ~ element(X0,m)
| element(f(X0),X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_7) ).
fof(f13,plain,
! [X0] :
( element(f(X0),X0)
| ~ element(X0,m)
| m = X0 ),
inference(reorient_equations,[],[f12]) ).
fof(f14,negated_conjecture,
! [X0,X1] :
( X0 = m
| element(X0,m)
| X1 = m
| X1 = X0
| ~ element(X0,X1)
| ~ element(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_8) ).
fof(f15,plain,
! [X0,X1] :
( ~ element(X1,X0)
| element(X0,m)
| m = X1
| X0 = X1
| ~ element(X0,X1)
| m = X0 ),
inference(reorient_equations,[],[f14]) ).
fof(f16,negated_conjecture,
! [X0] :
( X0 = n
| element(X0,n)
| g(X0) != n ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_9) ).
fof(f17,plain,
! [X0] :
( n != g(X0)
| element(X0,n)
| n = X0 ),
inference(reorient_equations,[],[f16]) ).
fof(f18,negated_conjecture,
! [X0] :
( X0 = n
| element(X0,n)
| g(X0) != X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_10) ).
fof(f19,plain,
! [X0] :
( g(X0) != X0
| element(X0,n)
| n = X0 ),
inference(reorient_equations,[],[f18]) ).
fof(f20,negated_conjecture,
! [X0] :
( X0 = n
| element(X0,n)
| element(X0,g(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_11) ).
fof(f21,plain,
! [X0] :
( element(X0,g(X0))
| element(X0,n)
| n = X0 ),
inference(reorient_equations,[],[f20]) ).
fof(f22,negated_conjecture,
! [X0] :
( X0 = n
| element(X0,n)
| element(g(X0),X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_12) ).
fof(f23,plain,
! [X0] :
( element(g(X0),X0)
| element(X0,n)
| n = X0 ),
inference(reorient_equations,[],[f22]) ).
fof(f24,negated_conjecture,
! [X0,X1] :
( X0 = n
| ~ element(X0,n)
| X1 = n
| X1 = X0
| ~ element(X0,X1)
| ~ element(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_13) ).
fof(f25,plain,
! [X0,X1] :
( ~ element(X1,X0)
| ~ element(X0,n)
| n = X1
| X0 = X1
| ~ element(X0,X1)
| n = X0 ),
inference(reorient_equations,[],[f24]) ).
fof(f26,negated_conjecture,
! [X0] :
( X0 = k
| X0 != m
| element(X0,k) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_14) ).
fof(f27,plain,
! [X0] :
( k = X0
| m != X0
| element(X0,k) ),
inference(reorient_equations,[],[f26]) ).
fof(f28,negated_conjecture,
! [X0] :
( X0 = k
| X0 != n
| element(X0,k) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_15) ).
fof(f29,plain,
! [X0] :
( k = X0
| n != X0
| element(X0,k) ),
inference(reorient_equations,[],[f28]) ).
fof(f30,negated_conjecture,
! [X0] :
( X0 = k
| X0 = m
| X0 = n
| ~ element(X0,k) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_16) ).
fof(f31,plain,
! [X0] :
( ~ element(X0,k)
| m = X0
| n = X0
| k = X0 ),
inference(reorient_equations,[],[f30]) ).
fof(f32,plain,
( j = k
| element(k,j) ),
inference(equality_resolution,[],[f3]) ).
fof(f33,plain,
( m = k
| element(m,k) ),
inference(equality_resolution,[],[f27]) ).
fof(f34,plain,
( n = k
| element(n,k) ),
inference(equality_resolution,[],[f29]) ).
fof(f36,definition,
( spl0_1
<=> element(n,k) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f38,plain,
( element(n,k)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f36]) ).
fof(f40,definition,
( spl0_2
<=> n = k ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f42,plain,
( n = k
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f40]) ).
fof(f43,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f34,f40,f36]) ).
fof(f45,definition,
( spl0_3
<=> element(m,k) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f47,plain,
( element(m,k)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f45]) ).
fof(f49,definition,
( spl0_4
<=> m = k ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f50,plain,
( m != k
| spl0_4 ),
inference(avatar_component_clause,[],[f49]) ).
fof(f51,plain,
( m = k
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f49]) ).
fof(f52,plain,
( spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f33,f49,f45]) ).
fof(f54,definition,
( spl0_5
<=> element(k,j) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f56,plain,
( element(k,j)
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f54]) ).
fof(f58,definition,
( spl0_6
<=> j = k ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f60,plain,
( j = k
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f58]) ).
fof(f61,plain,
( spl0_5
| spl0_6 ),
inference(avatar_split_clause,[],[f32,f58,f54]) ).
fof(f62,plain,
( element(m,n)
| ~ spl0_2
| ~ spl0_3 ),
inference(forward_demodulation,[],[f47,f42]) ).
fof(f64,plain,
( ! [X0] :
( ~ element(X0,j)
| j = X0
| n = X0 )
| ~ spl0_2 ),
inference(forward_demodulation,[],[f5,f42]) ).
fof(f73,definition,
( spl0_8
<=> m = j ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f75,plain,
( m = j
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f73]) ).
fof(f81,plain,
( element(j,n)
| n = j
| j = g(j)
| n = g(j)
| ~ spl0_2 ),
inference(resolution,[],[f23,f64]) ).
fof(f82,plain,
( element(j,n)
| n = j
| n = g(j)
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f81,f19]) ).
fof(f83,plain,
( element(j,n)
| n = j
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f82,f17]) ).
fof(f85,definition,
( spl0_10
<=> n = j ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
fof(f87,plain,
( n = j
| ~ spl0_10 ),
inference(avatar_component_clause,[],[f85]) ).
fof(f89,definition,
( spl0_11
<=> element(j,n) ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f91,plain,
( element(j,n)
| ~ spl0_11 ),
inference(avatar_component_clause,[],[f89]) ).
fof(f92,plain,
( spl0_10
| spl0_11
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f83,f40,f89,f85]) ).
fof(f102,plain,
( ! [X0] :
( ~ element(X0,n)
| k = X0
| n = X0 )
| ~ spl0_10 ),
inference(superposition,[],[f5,f87]) ).
fof(f107,plain,
( m = f(k)
| n = f(k)
| k = f(k)
| ~ element(k,m)
| m = k ),
inference(resolution,[],[f31,f13]) ).
fof(f108,plain,
( m = g(k)
| n = g(k)
| k = g(k)
| element(k,n)
| n = k ),
inference(resolution,[],[f31,f23]) ).
fof(f109,plain,
( m = g(k)
| k = g(k)
| element(k,n)
| n = k ),
inference(forward_subsumption_resolution,[],[f108,f17]) ).
fof(f110,plain,
( n = f(k)
| k = f(k)
| ~ element(k,m)
| m = k ),
inference(forward_subsumption_resolution,[],[f107,f7]) ).
fof(f111,plain,
( m = g(k)
| element(k,n)
| n = k ),
inference(forward_subsumption_resolution,[],[f109,f19]) ).
fof(f112,plain,
( n = f(k)
| ~ element(k,m)
| m = k ),
inference(forward_subsumption_resolution,[],[f110,f9]) ).
fof(f115,definition,
( spl0_13
<=> element(k,m) ),
introduced(definition,[new_symbols(definition,[spl0_13])],[avatar_definition]) ).
fof(f119,definition,
( spl0_14
<=> n = f(k) ),
introduced(definition,[new_symbols(definition,[spl0_14])],[avatar_definition]) ).
fof(f121,plain,
( n = f(k)
| ~ spl0_14 ),
inference(avatar_component_clause,[],[f119]) ).
fof(f122,plain,
( spl0_4
| ~ spl0_13
| spl0_14 ),
inference(avatar_split_clause,[],[f112,f119,f115,f49]) ).
fof(f124,definition,
( spl0_15
<=> element(k,n) ),
introduced(definition,[new_symbols(definition,[spl0_15])],[avatar_definition]) ).
fof(f125,plain,
( ~ element(k,n)
| spl0_15 ),
inference(avatar_component_clause,[],[f124]) ).
fof(f128,definition,
( spl0_16
<=> m = g(k) ),
introduced(definition,[new_symbols(definition,[spl0_16])],[avatar_definition]) ).
fof(f130,plain,
( m = g(k)
| ~ spl0_16 ),
inference(avatar_component_clause,[],[f128]) ).
fof(f133,plain,
( spl0_2
| spl0_15
| spl0_16 ),
inference(avatar_split_clause,[],[f111,f128,f124,f40]) ).
fof(f134,plain,
( ! [X0] :
( ~ element(X0,n)
| m = X0
| n = X0
| n = X0 )
| ~ spl0_2 ),
inference(superposition,[],[f31,f42]) ).
fof(f138,plain,
( ! [X0] :
( ~ element(X0,n)
| m = X0
| n = X0 )
| ~ spl0_2 ),
inference(duplicate_literal_removal,[],[f134]) ).
fof(f140,plain,
! [X0] :
( element(f(X0),m)
| m = X0
| f(X0) = X0
| ~ element(f(X0),X0)
| m = f(X0)
| ~ element(X0,m)
| m = X0 ),
inference(resolution,[],[f15,f11]) ).
fof(f144,plain,
( element(k,m)
| m = n
| n = k
| ~ element(k,n)
| m = k
| ~ spl0_1 ),
inference(resolution,[],[f15,f38]) ).
fof(f153,plain,
! [X0] :
( element(f(X0),m)
| m = X0
| f(X0) = X0
| ~ element(f(X0),X0)
| m = f(X0)
| ~ element(X0,m) ),
inference(duplicate_literal_removal,[],[f140]) ).
fof(f157,plain,
! [X0] :
( element(f(X0),m)
| m = X0
| f(X0) = X0
| m = f(X0)
| ~ element(X0,m) ),
inference(forward_subsumption_resolution,[],[f153,f13]) ).
fof(f161,plain,
! [X0] :
( element(f(X0),m)
| m = X0
| m = f(X0)
| ~ element(X0,m) ),
inference(forward_subsumption_resolution,[],[f157,f9]) ).
fof(f163,plain,
! [X0] :
( element(f(X0),m)
| m = X0
| ~ element(X0,m) ),
inference(forward_subsumption_resolution,[],[f161,f7]) ).
fof(f198,plain,
( ! [X0] :
( n = X0
| ~ element(X0,n)
| n = X0 )
| ~ spl0_2
| ~ spl0_10 ),
inference(forward_demodulation,[],[f102,f42]) ).
fof(f199,plain,
( ! [X0] :
( ~ element(X0,n)
| n = X0 )
| ~ spl0_2
| ~ spl0_10 ),
inference(duplicate_literal_removal,[],[f198]) ).
fof(f202,plain,
( m = n
| ~ spl0_2
| ~ spl0_3
| ~ spl0_10 ),
inference(resolution,[],[f199,f62]) ).
fof(f206,plain,
( $false
| ~ spl0_2
| ~ spl0_3
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f202,f1]) ).
fof(f207,plain,
( ~ spl0_2
| ~ spl0_3
| ~ spl0_10 ),
inference(avatar_contradiction_clause,[],[f206]) ).
fof(f213,plain,
( m = j
| n = j
| ~ spl0_2
| ~ spl0_11 ),
inference(resolution,[],[f91,f138]) ).
fof(f226,plain,
( spl0_10
| spl0_8
| ~ spl0_2
| ~ spl0_11 ),
inference(avatar_split_clause,[],[f213,f89,f40,f73,f85]) ).
fof(f240,plain,
( m = n
| ~ spl0_2
| ~ spl0_4 ),
inference(superposition,[],[f51,f42]) ).
fof(f244,plain,
( element(n,m)
| ~ spl0_1
| ~ spl0_4 ),
inference(superposition,[],[f38,f51]) ).
fof(f250,plain,
( $false
| ~ spl0_2
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f240,f1]) ).
fof(f251,plain,
( ~ spl0_2
| ~ spl0_4 ),
inference(avatar_contradiction_clause,[],[f250]) ).
fof(f265,definition,
( spl0_20
<=> element(n,m) ),
introduced(definition,[new_symbols(definition,[spl0_20])],[avatar_definition]) ).
fof(f267,plain,
( element(n,m)
| ~ spl0_20 ),
inference(avatar_component_clause,[],[f265]) ).
fof(f281,plain,
( spl0_20
| ~ spl0_1
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f244,f49,f36,f265]) ).
fof(f322,plain,
( element(k,m)
| n = k
| ~ element(k,n)
| m = k
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f144,f1]) ).
fof(f326,plain,
( spl0_4
| ~ spl0_15
| spl0_2
| spl0_13
| ~ spl0_1 ),
inference(avatar_split_clause,[],[f322,f36,f115,f40,f124,f49]) ).
fof(f331,plain,
( ~ element(k,n)
| m = n
| m = k
| ~ element(k,m)
| n = k
| ~ spl0_3 ),
inference(resolution,[],[f47,f25]) ).
fof(f334,plain,
( ~ element(k,n)
| m = k
| ~ element(k,m)
| n = k
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f331,f1]) ).
fof(f351,plain,
( m != j
| spl0_4
| ~ spl0_6 ),
inference(superposition,[],[f50,f60]) ).
fof(f353,plain,
( ~ spl0_8
| spl0_4
| ~ spl0_6 ),
inference(avatar_split_clause,[],[f351,f58,f49,f73]) ).
fof(f414,plain,
( element(k,n)
| ~ element(k,m)
| m = k
| ~ spl0_14 ),
inference(superposition,[],[f11,f121]) ).
fof(f415,plain,
( n != k
| ~ element(k,m)
| m = k
| ~ spl0_14 ),
inference(superposition,[],[f9,f121]) ).
fof(f417,plain,
( ~ element(k,m)
| m = k
| ~ spl0_14
| spl0_15 ),
inference(forward_subsumption_resolution,[],[f414,f125]) ).
fof(f421,plain,
( ~ element(k,m)
| spl0_4
| ~ spl0_14
| spl0_15 ),
inference(forward_subsumption_resolution,[],[f417,f50]) ).
fof(f422,plain,
( ~ spl0_13
| spl0_4
| ~ spl0_14
| spl0_15 ),
inference(avatar_split_clause,[],[f421,f124,f119,f49,f115]) ).
fof(f425,plain,
( element(k,m)
| element(k,n)
| n = k
| ~ spl0_16 ),
inference(superposition,[],[f21,f130]) ).
fof(f467,plain,
( element(k,m)
| ~ spl0_5
| ~ spl0_8 ),
inference(superposition,[],[f56,f75]) ).
fof(f479,plain,
( ~ element(k,m)
| m = k
| ~ spl0_2
| ~ spl0_14 ),
inference(forward_subsumption_resolution,[],[f415,f42]) ).
fof(f481,plain,
( element(n,m)
| ~ spl0_2
| ~ spl0_5
| ~ spl0_8 ),
inference(forward_demodulation,[],[f467,f42]) ).
fof(f485,plain,
( ~ element(k,m)
| ~ spl0_2
| spl0_4
| ~ spl0_14 ),
inference(forward_subsumption_resolution,[],[f479,f50]) ).
fof(f487,plain,
( spl0_20
| ~ spl0_2
| ~ spl0_5
| ~ spl0_8 ),
inference(avatar_split_clause,[],[f481,f73,f54,f40,f265]) ).
fof(f490,plain,
( ~ element(n,m)
| ~ spl0_2
| spl0_4
| ~ spl0_14 ),
inference(forward_demodulation,[],[f485,f42]) ).
fof(f497,plain,
( ~ spl0_20
| ~ spl0_2
| spl0_4
| ~ spl0_14 ),
inference(avatar_split_clause,[],[f490,f119,f49,f40,f265]) ).
fof(f501,plain,
( spl0_2
| ~ spl0_13
| spl0_4
| ~ spl0_15
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f334,f45,f124,f49,f115,f40]) ).
fof(f503,plain,
( spl0_2
| spl0_15
| spl0_13
| ~ spl0_16 ),
inference(avatar_split_clause,[],[f425,f128,f115,f124,f40]) ).
fof(f504,plain,
( spl0_13
| ~ spl0_5
| ~ spl0_8 ),
inference(avatar_split_clause,[],[f467,f73,f54,f115]) ).
fof(f516,plain,
( ! [X0] :
( ~ element(X0,m)
| m = X0
| n = X0
| m = X0 )
| ~ spl0_4 ),
inference(superposition,[],[f31,f51]) ).
fof(f523,plain,
( ! [X0] :
( ~ element(X0,m)
| m = X0
| n = X0 )
| ~ spl0_4 ),
inference(duplicate_literal_removal,[],[f516]) ).
fof(f577,plain,
( ! [X0] :
( m = f(X0)
| n = f(X0)
| m = X0
| ~ element(X0,m) )
| ~ spl0_4 ),
inference(resolution,[],[f523,f163]) ).
fof(f580,plain,
( ! [X0] :
( ~ element(X0,m)
| m = X0
| n = f(X0) )
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f577,f7]) ).
fof(f594,plain,
( m = n
| n = f(n)
| ~ spl0_4
| ~ spl0_20 ),
inference(resolution,[],[f580,f267]) ).
fof(f599,plain,
( n = f(n)
| ~ spl0_4
| ~ spl0_20 ),
inference(forward_subsumption_resolution,[],[f594,f1]) ).
fof(f604,plain,
( n != n
| ~ element(n,m)
| m = n
| ~ spl0_4
| ~ spl0_20 ),
inference(superposition,[],[f9,f599]) ).
fof(f606,plain,
( ~ element(n,m)
| m = n
| ~ spl0_4
| ~ spl0_20 ),
inference(trivial_inequality_removal,[],[f604]) ).
fof(f607,plain,
( m = n
| ~ spl0_4
| ~ spl0_20 ),
inference(forward_subsumption_resolution,[],[f606,f267]) ).
fof(f610,plain,
( $false
| ~ spl0_4
| ~ spl0_20 ),
inference(forward_subsumption_resolution,[],[f607,f1]) ).
fof(f611,plain,
( ~ spl0_4
| ~ spl0_20 ),
inference(avatar_contradiction_clause,[],[f610]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f43]) ).
cnf(s2,plain,
( spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f52]) ).
cnf(s3,plain,
( spl0_5
| spl0_6 ),
inference(sat_conversion,[],[f61]) ).
cnf(s5,plain,
( ~ spl0_2
| spl0_10
| spl0_11 ),
inference(sat_conversion,[],[f92]) ).
cnf(s7,plain,
( spl0_4
| ~ spl0_13
| spl0_14 ),
inference(sat_conversion,[],[f122]) ).
cnf(s9,plain,
( spl0_2
| spl0_15
| spl0_16 ),
inference(sat_conversion,[],[f133]) ).
cnf(s10,plain,
( ~ spl0_2
| ~ spl0_3
| ~ spl0_10 ),
inference(sat_conversion,[],[f207]) ).
cnf(s13,plain,
( ~ spl0_2
| spl0_8
| spl0_10
| ~ spl0_11 ),
inference(sat_conversion,[],[f226]) ).
cnf(s18,plain,
( ~ spl0_2
| ~ spl0_4 ),
inference(sat_conversion,[],[f251]) ).
cnf(s24,plain,
( ~ spl0_1
| ~ spl0_4
| spl0_20 ),
inference(sat_conversion,[],[f281]) ).
cnf(s31,plain,
( ~ spl0_1
| spl0_2
| spl0_4
| spl0_13
| ~ spl0_15 ),
inference(sat_conversion,[],[f326]) ).
cnf(s36,plain,
( spl0_4
| ~ spl0_6
| ~ spl0_8 ),
inference(sat_conversion,[],[f353]) ).
cnf(s48,plain,
( spl0_4
| ~ spl0_13
| ~ spl0_14
| spl0_15 ),
inference(sat_conversion,[],[f422]) ).
cnf(s69,plain,
( ~ spl0_2
| ~ spl0_5
| ~ spl0_8
| spl0_20 ),
inference(sat_conversion,[],[f487]) ).
cnf(s72,plain,
( ~ spl0_2
| spl0_4
| ~ spl0_14
| ~ spl0_20 ),
inference(sat_conversion,[],[f497]) ).
cnf(s75,plain,
( spl0_2
| ~ spl0_3
| spl0_4
| ~ spl0_13
| ~ spl0_15 ),
inference(sat_conversion,[],[f501]) ).
cnf(s77,plain,
( spl0_2
| spl0_13
| spl0_15
| ~ spl0_16 ),
inference(sat_conversion,[],[f503]) ).
cnf(s78,plain,
( ~ spl0_5
| ~ spl0_8
| spl0_13 ),
inference(sat_conversion,[],[f504]) ).
cnf(s93,plain,
( ~ spl0_4
| ~ spl0_20 ),
inference(sat_conversion,[],[f611]) ).
cnf(s96,plain,
~ spl0_2,
inference(rat,[],[s7,s72,s78,s69,s3,s36,s13,s5,s10,s2,s18]) ).
cnf(s97,plain,
spl0_1,
inference(rat,[],[s1,s96]) ).
cnf(s98,plain,
( ~ spl0_13
| spl0_4
| ~ spl0_3 ),
inference(rat,[],[s48,s75,s7,s96]) ).
cnf(s99,plain,
( spl0_13
| spl0_4 ),
inference(rat,[],[s77,s9,s31,s97,s96]) ).
cnf(s100,plain,
( spl0_4
| ~ spl0_3 ),
inference(rat,[],[s99,s98]) ).
cnf(s101,plain,
~ spl0_4,
inference(rat,[],[s24,s93,s97]) ).
cnf(s102,plain,
spl0_3,
inference(rat,[],[s2,s101]) ).
cnf(s104,plain,
$false,
inference(rat,[],[s100,s102,s101]) ).
fof(f615,plain,
$false,
inference(avatar_sat_refutation,[],[s104]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN015-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.17 % Computer : n026.cluster.edu
% 0.07/0.17 % Model : x86_64 x86_64
% 0.07/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17 % Memory : 8046.5625MB
% 0.07/0.17 % OS : Linux 6.8.0-71-generic
% 0.07/0.17 % CPULimit : 300
% 0.07/0.17 % WCLimit : 300
% 0.07/0.17 % DateTime : Mon Sep 28 15:22:57 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21 Running first-order model finding
% 0.07/0.21 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.07/0.25 % (3936450)Will run a generic schedule for satisfiability detection.
% 0.07/0.25 % (3936458)dis+10_1_sil=32000:sp=arity:random_seed=242153455:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.07/0.25 % (3936456)% WARNING: option uhcvi not known.
% 0.07/0.25 % (3936458) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3936450-3936458"...
% 0.07/0.25 % (3936459)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1459542120:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.07/0.25 % (3936455)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2648012688_2999 on theBenchmark for (2999ds/0Mi)
% 0.07/0.25 % (3936457)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1003960088:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.07/0.25 % (3936460)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=666097189:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.07/0.25 % (3936461)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3197822200:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.07/0.25 % (3936458)...printing done.
% 0.07/0.25 % (3936456)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=985652301:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.07/0.25 % TRYING [1]
% 0.07/0.25 % TRYING [2]
% 0.07/0.25 % TRYING [3]
% 0.07/0.25 % TRYING [4]
% 0.07/0.25 % TRYING [5]
% 0.07/0.25 % (3936458)Refutation found. Thanks to Tanya!
% 0.07/0.25 % SZS status Unsatisfiable for theBenchmark
% 0.07/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.25 % (3936458)------------------------------
% 0.07/0.25 % (3936458)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.25 % (3936458)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.25 % (3936458)CaDiCaL version: 2.1.3
% 0.07/0.25 % (3936458)Termination reason: Refutation
% 0.07/0.25 % (3936458)Time elapsed: 0.008 s
% 0.07/0.25 % (3936458)Peak memory usage: 12 MB
% 0.07/0.25 % (3936458)Instructions burned: 18 (million)
% 0.07/0.25 % (3936450)Success in time 0.037 s
% 0.07/0.25 % Vampire exiting
%------------------------------------------------------------------------------