%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC310+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n003.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 01:05:29 PM UTC 2026
% Result : Theorem 2.92s 0.65s
% Output : Refutation 2.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 18
% Syntax : Number of formulae : 146 ( 16 unt; 9 def)
% Number of atoms : 523 ( 138 equ)
% Maximal formula atoms : 27 ( 3 avg)
% Number of connectives : 646 ( 269 ~; 291 |; 53 &)
% ( 11 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 10 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 95 ( 0 sgn 81 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f22,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssItem(hd(X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(f23,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> hd(cons(X1,X0)) = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax23) ).
fof(f24,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssList(tl(X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(f25,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> tl(cons(X1,X0)) = X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax25) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X1 != X3
| X0 != X2
| ( nil != X2
& nil = X3 )
| ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ~ ssList(X5)
| app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) != X2 ) )
& neq(X3,nil) )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X6] :
( ssList(X6)
& X0 = X6
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& tl(X1) = X7
& app(X7,X8) = X6
& ? [X9] :
( ssItem(X9)
& cons(X9,nil) = X8
& hd(X1) = X9
& neq(nil,X1) )
& neq(nil,X1) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X1 != X3
| X0 != X2
| ( nil != X2
& nil = X3 )
| ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ~ ssList(X5)
| app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) != X2 ) )
& neq(X3,nil) )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X6] :
( ssList(X6)
& X0 = X6
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& tl(X1) = X7
& app(X7,X8) = X6
& ? [X9] :
( ssItem(X9)
& cons(X9,nil) = X8
& hd(X1) = X9
& neq(nil,X1) )
& neq(nil,X1) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f126,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f127,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f126]) ).
fof(f128,plain,
! [X0] :
( ! [X1] :
( hd(cons(X1,X0)) = X1
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f23]) ).
fof(f129,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f130,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f129]) ).
fof(f131,plain,
! [X0] :
( ! [X1] :
( tl(cons(X1,X0)) = X0
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f25]) ).
fof(f198,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& X0 = X2
& ( nil = X2
| nil != X3 )
& ( ? [X4] :
( ? [X5] :
( ssList(X5)
& app(cons(X4,nil),X5) = X3
& app(X5,cons(X4,nil)) = X2 )
& ssItem(X4) )
| ~ neq(X3,nil) )
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X6] :
( ~ ssList(X6)
| X0 != X6
| ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( ~ ssList(X8)
| tl(X1) != X7
| app(X7,X8) != X6
| ! [X9] :
( ~ ssItem(X9)
| cons(X9,nil) != X8
| hd(X1) != X9
| ~ neq(nil,X1) )
| ~ neq(nil,X1) ) ) ) ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f272,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f295,plain,
( ssList(sK56)
& sK54 = sK56
& sK53 = sK55
& ( nil = sK55
| nil != sK56 )
& ( ( ssList(sK58)
& sK56 = app(cons(sK57,nil),sK58)
& sK55 = app(sK58,cons(sK57,nil))
& ssItem(sK57) )
| ~ neq(sK56,nil) )
& ( ( nil = sK54
& nil != sK53 )
| ( neq(sK54,nil)
& ! [X6] :
( ~ ssList(X6)
| sK53 != X6
| ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( ~ ssList(X8)
| tl(sK54) != X7
| app(X7,X8) != X6
| ! [X9] :
( ~ ssItem(X9)
| cons(X9,nil) != X8
| hd(sK54) != X9
| ~ neq(nil,sK54) )
| ~ neq(nil,sK54) ) ) ) ) )
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57,sK58]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X4,sK57),skolemize(X5,sK58)],[f221]) ).
fof(f385,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f272]) ).
fof(f386,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f272]) ).
fof(f387,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f388,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f396,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f127]) ).
fof(f397,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| hd(cons(X1,X0)) = X1 ),
inference(cnf_transformation,[],[f128]) ).
fof(f398,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f399,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| tl(cons(X1,X0)) = X0 ),
inference(cnf_transformation,[],[f131]) ).
fof(f476,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| cons(X1,X0) = app(cons(X1,nil),X0) ),
inference(cnf_transformation,[],[f198]) ).
fof(f497,plain,
ssList(sK55),
inference(cnf_transformation,[],[f295]) ).
fof(f499,plain,
( nil != sK53
| neq(sK54,nil) ),
inference(cnf_transformation,[],[f295]) ).
fof(f500,plain,
! [X8,X6,X9,X7] :
( nil = sK54
| ~ ssList(X6)
| sK53 != X6
| ~ ssList(X7)
| ~ ssList(X8)
| tl(sK54) != X7
| app(X7,X8) != X6
| ~ ssItem(X9)
| cons(X9,nil) != X8
| hd(sK54) != X9
| ~ neq(nil,sK54)
| ~ neq(nil,sK54) ),
inference(cnf_transformation,[],[f295]) ).
fof(f501,plain,
( nil = sK54
| neq(sK54,nil) ),
inference(cnf_transformation,[],[f295]) ).
fof(f502,plain,
( ssItem(sK57)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f295]) ).
fof(f503,plain,
( sK55 = app(sK58,cons(sK57,nil))
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f295]) ).
fof(f504,plain,
( sK56 = app(cons(sK57,nil),sK58)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f295]) ).
fof(f505,plain,
( ssList(sK58)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f295]) ).
fof(f506,plain,
( nil = sK55
| nil != sK56 ),
inference(cnf_transformation,[],[f295]) ).
fof(f507,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f295]) ).
fof(f508,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f295]) ).
fof(f509,plain,
ssList(sK56),
inference(cnf_transformation,[],[f295]) ).
fof(f510,plain,
( nil = sK56
| neq(sK56,nil) ),
inference(definition_unfolding,[],[f501,f508,f508]) ).
fof(f511,plain,
! [X8,X6,X9,X7] :
( nil = sK56
| ~ ssList(X6)
| sK55 != X6
| ~ ssList(X7)
| ~ ssList(X8)
| tl(sK56) != X7
| app(X7,X8) != X6
| ~ ssItem(X9)
| cons(X9,nil) != X8
| hd(sK56) != X9
| ~ neq(nil,sK56)
| ~ neq(nil,sK56) ),
inference(definition_unfolding,[],[f500,f508,f507,f508,f508,f508,f508]) ).
fof(f512,plain,
( nil != sK55
| neq(sK56,nil) ),
inference(definition_unfolding,[],[f499,f507,f508]) ).
fof(f530,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f385]) ).
fof(f543,plain,
! [X8,X9,X7] :
( nil = sK56
| ~ ssList(sK55)
| ~ ssList(X7)
| ~ ssList(X8)
| tl(sK56) != X7
| app(X7,X8) != sK55
| ~ ssItem(X9)
| cons(X9,nil) != X8
| hd(sK56) != X9
| ~ neq(nil,sK56)
| ~ neq(nil,sK56) ),
inference(equality_resolution,[],[f511]) ).
fof(f544,plain,
! [X8,X9] :
( nil = sK56
| ~ ssList(sK55)
| ~ ssList(tl(sK56))
| ~ ssList(X8)
| sK55 != app(tl(sK56),X8)
| ~ ssItem(X9)
| cons(X9,nil) != X8
| hd(sK56) != X9
| ~ neq(nil,sK56)
| ~ neq(nil,sK56) ),
inference(equality_resolution,[],[f543]) ).
fof(f545,plain,
! [X9] :
( nil = sK56
| ~ ssList(sK55)
| ~ ssList(tl(sK56))
| ~ ssList(cons(X9,nil))
| sK55 != app(tl(sK56),cons(X9,nil))
| ~ ssItem(X9)
| hd(sK56) != X9
| ~ neq(nil,sK56)
| ~ neq(nil,sK56) ),
inference(equality_resolution,[],[f544]) ).
fof(f546,plain,
( nil = sK56
| ~ ssList(sK55)
| ~ ssList(tl(sK56))
| ~ ssList(cons(hd(sK56),nil))
| sK55 != app(tl(sK56),cons(hd(sK56),nil))
| ~ ssItem(hd(sK56))
| ~ neq(nil,sK56)
| ~ neq(nil,sK56) ),
inference(equality_resolution,[],[f545]) ).
fof(f552,plain,
( nil = sK56
| ~ ssList(sK55)
| ~ ssList(tl(sK56))
| ~ ssList(cons(hd(sK56),nil))
| sK55 != app(tl(sK56),cons(hd(sK56),nil))
| ~ ssItem(hd(sK56))
| ~ neq(nil,sK56) ),
inference(duplicate_literal_removal,[],[f546]) ).
fof(f557,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f530]) ).
fof(f561,definition,
( spl59_1
<=> neq(sK56,nil) ),
introduced(definition,[new_symbols(definition,[spl59_1])],[avatar_definition]) ).
fof(f562,plain,
( neq(sK56,nil)
| ~ spl59_1 ),
inference(avatar_component_clause,[],[f561]) ).
fof(f563,plain,
( ~ neq(sK56,nil)
| spl59_1 ),
inference(avatar_component_clause,[],[f561]) ).
fof(f565,definition,
( spl59_2
<=> ssItem(sK57) ),
introduced(definition,[new_symbols(definition,[spl59_2])],[avatar_definition]) ).
fof(f567,plain,
( ssItem(sK57)
| ~ spl59_2 ),
inference(avatar_component_clause,[],[f565]) ).
fof(f568,plain,
( ~ spl59_1
| spl59_2 ),
inference(avatar_split_clause,[],[f502,f565,f561]) ).
fof(f570,definition,
( spl59_3
<=> nil = sK56 ),
introduced(definition,[new_symbols(definition,[spl59_3])],[avatar_definition]) ).
fof(f571,plain,
( nil = sK56
| ~ spl59_3 ),
inference(avatar_component_clause,[],[f570]) ).
fof(f572,plain,
( nil != sK56
| spl59_3 ),
inference(avatar_component_clause,[],[f570]) ).
fof(f574,definition,
( spl59_4
<=> nil = sK55 ),
introduced(definition,[new_symbols(definition,[spl59_4])],[avatar_definition]) ).
fof(f576,plain,
( nil = sK55
| ~ spl59_4 ),
inference(avatar_component_clause,[],[f574]) ).
fof(f577,plain,
( ~ spl59_3
| spl59_4 ),
inference(avatar_split_clause,[],[f506,f574,f570]) ).
fof(f578,plain,
( neq(sK56,nil)
| spl59_3 ),
inference(forward_subsumption_resolution,[],[f510,f572]) ).
fof(f579,plain,
( $false
| spl59_1
| spl59_3 ),
inference(forward_subsumption_resolution,[],[f578,f563]) ).
fof(f580,plain,
( spl59_1
| spl59_3 ),
inference(avatar_contradiction_clause,[],[f579]) ).
fof(f581,plain,
( ssList(sK58)
| ~ spl59_1 ),
inference(forward_subsumption_resolution,[],[f505,f562]) ).
fof(f586,definition,
( spl59_5
<=> neq(nil,sK56) ),
introduced(definition,[new_symbols(definition,[spl59_5])],[avatar_definition]) ).
fof(f588,plain,
( ~ neq(nil,sK56)
| spl59_5 ),
inference(avatar_component_clause,[],[f586]) ).
fof(f590,definition,
( spl59_6
<=> ssItem(hd(sK56)) ),
introduced(definition,[new_symbols(definition,[spl59_6])],[avatar_definition]) ).
fof(f591,plain,
( ssItem(hd(sK56))
| ~ spl59_6 ),
inference(avatar_component_clause,[],[f590]) ).
fof(f592,plain,
( ~ ssItem(hd(sK56))
| spl59_6 ),
inference(avatar_component_clause,[],[f590]) ).
fof(f594,definition,
( spl59_7
<=> sK55 = app(tl(sK56),cons(hd(sK56),nil)) ),
introduced(definition,[new_symbols(definition,[spl59_7])],[avatar_definition]) ).
fof(f596,plain,
( sK55 != app(tl(sK56),cons(hd(sK56),nil))
| spl59_7 ),
inference(avatar_component_clause,[],[f594]) ).
fof(f598,definition,
( spl59_8
<=> ssList(cons(hd(sK56),nil)) ),
introduced(definition,[new_symbols(definition,[spl59_8])],[avatar_definition]) ).
fof(f600,plain,
( ~ ssList(cons(hd(sK56),nil))
| spl59_8 ),
inference(avatar_component_clause,[],[f598]) ).
fof(f602,definition,
( spl59_9
<=> ssList(tl(sK56)) ),
introduced(definition,[new_symbols(definition,[spl59_9])],[avatar_definition]) ).
fof(f604,plain,
( ~ ssList(tl(sK56))
| spl59_9 ),
inference(avatar_component_clause,[],[f602]) ).
fof(f606,plain,
( ~ ssList(sK55)
| ~ ssList(tl(sK56))
| ~ ssList(cons(hd(sK56),nil))
| sK55 != app(tl(sK56),cons(hd(sK56),nil))
| ~ ssItem(hd(sK56))
| ~ neq(nil,sK56)
| spl59_3 ),
inference(forward_subsumption_resolution,[],[f552,f572]) ).
fof(f607,plain,
( ~ ssList(tl(sK56))
| ~ ssList(cons(hd(sK56),nil))
| sK55 != app(tl(sK56),cons(hd(sK56),nil))
| ~ ssItem(hd(sK56))
| ~ neq(nil,sK56)
| spl59_3 ),
inference(forward_subsumption_resolution,[],[f606,f497]) ).
fof(f608,plain,
( ~ spl59_5
| ~ spl59_6
| ~ spl59_7
| ~ spl59_8
| ~ spl59_9
| spl59_3 ),
inference(avatar_split_clause,[],[f607,f570,f602,f598,f594,f590,f586]) ).
fof(f1403,plain,
( ~ ssItem(hd(sK56))
| ~ ssList(nil)
| spl59_8 ),
inference(resolution,[],[f387,f600]) ).
fof(f1407,plain,
( ~ ssList(nil)
| ~ spl59_6
| spl59_8 ),
inference(forward_subsumption_resolution,[],[f1403,f591]) ).
fof(f1408,plain,
( $false
| ~ spl59_6
| spl59_8 ),
inference(forward_subsumption_resolution,[],[f1407,f388]) ).
fof(f1409,plain,
( ~ spl59_6
| spl59_8 ),
inference(avatar_contradiction_clause,[],[f1408]) ).
fof(f2150,plain,
( nil = sK56
| ~ ssList(sK56)
| spl59_6 ),
inference(resolution,[],[f396,f592]) ).
fof(f2151,plain,
( ~ ssList(sK56)
| spl59_3
| spl59_6 ),
inference(forward_subsumption_resolution,[],[f2150,f572]) ).
fof(f2152,plain,
( $false
| spl59_3
| spl59_6 ),
inference(forward_subsumption_resolution,[],[f2151,f509]) ).
fof(f2153,plain,
( spl59_3
| spl59_6 ),
inference(avatar_contradiction_clause,[],[f2152]) ).
fof(f2388,plain,
( neq(nil,nil)
| ~ spl59_1
| ~ spl59_3 ),
inference(backward_demodulation,[],[f562,f571]) ).
fof(f2418,plain,
( ~ neq(nil,nil)
| spl59_1
| ~ spl59_3 ),
inference(forward_demodulation,[],[f563,f571]) ).
fof(f2420,plain,
( neq(sK56,nil)
| ~ spl59_4 ),
inference(forward_subsumption_resolution,[],[f512,f576]) ).
fof(f2423,plain,
( neq(nil,nil)
| ~ spl59_3
| ~ spl59_4 ),
inference(forward_demodulation,[],[f2420,f571]) ).
fof(f2429,plain,
( $false
| spl59_1
| ~ spl59_3
| ~ spl59_4 ),
inference(forward_subsumption_resolution,[],[f2423,f2418]) ).
fof(f2430,plain,
( spl59_1
| ~ spl59_3
| ~ spl59_4 ),
inference(avatar_contradiction_clause,[],[f2429]) ).
fof(f2462,plain,
( ~ ssList(nil)
| ~ spl59_1
| ~ spl59_3 ),
inference(resolution,[],[f557,f2388]) ).
fof(f2463,plain,
( $false
| ~ spl59_1
| ~ spl59_3 ),
inference(forward_subsumption_resolution,[],[f2462,f388]) ).
fof(f2464,plain,
( ~ spl59_1
| ~ spl59_3 ),
inference(avatar_contradiction_clause,[],[f2463]) ).
fof(f2466,plain,
( sK56 = app(cons(sK57,nil),sK58)
| ~ spl59_1 ),
inference(forward_subsumption_resolution,[],[f504,f562]) ).
fof(f2469,plain,
( nil = sK56
| ~ ssList(sK56)
| spl59_9 ),
inference(resolution,[],[f398,f604]) ).
fof(f2470,plain,
( ~ ssList(sK56)
| spl59_3
| spl59_9 ),
inference(forward_subsumption_resolution,[],[f2469,f572]) ).
fof(f2471,plain,
( $false
| spl59_3
| spl59_9 ),
inference(forward_subsumption_resolution,[],[f2470,f509]) ).
fof(f2472,plain,
( spl59_3
| spl59_9 ),
inference(avatar_contradiction_clause,[],[f2471]) ).
fof(f2503,plain,
( ! [X0] :
( ~ ssItem(X0)
| hd(cons(X0,sK58)) = X0 )
| ~ spl59_1 ),
inference(resolution,[],[f397,f581]) ).
fof(f2545,plain,
( sK57 = hd(cons(sK57,sK58))
| ~ spl59_1
| ~ spl59_2 ),
inference(resolution,[],[f2503,f567]) ).
fof(f2559,plain,
( ! [X0] :
( ~ ssItem(X0)
| sK58 = tl(cons(X0,sK58)) )
| ~ spl59_1 ),
inference(resolution,[],[f399,f581]) ).
fof(f2646,plain,
( sK58 = tl(cons(sK57,sK58))
| ~ spl59_1
| ~ spl59_2 ),
inference(resolution,[],[f2559,f567]) ).
fof(f4516,plain,
( sK55 = app(sK58,cons(sK57,nil))
| ~ spl59_1 ),
inference(forward_subsumption_resolution,[],[f503,f562]) ).
fof(f5657,plain,
( ! [X0] :
( ~ ssItem(X0)
| app(cons(X0,nil),sK58) = cons(X0,sK58) )
| ~ spl59_1 ),
inference(resolution,[],[f476,f581]) ).
fof(f5936,plain,
( app(cons(sK57,nil),sK58) = cons(sK57,sK58)
| ~ spl59_1
| ~ spl59_2 ),
inference(resolution,[],[f5657,f567]) ).
fof(f5937,plain,
( sK56 = cons(sK57,sK58)
| ~ spl59_1
| ~ spl59_2 ),
inference(forward_demodulation,[],[f5936,f2466]) ).
fof(f6056,plain,
( sK58 = tl(sK56)
| ~ spl59_1
| ~ spl59_2 ),
inference(forward_demodulation,[],[f2646,f5937]) ).
fof(f6140,plain,
( sK55 != app(sK58,cons(hd(sK56),nil))
| ~ spl59_1
| ~ spl59_2
| spl59_7 ),
inference(forward_demodulation,[],[f596,f6056]) ).
fof(f6171,plain,
( sK57 = hd(sK56)
| ~ spl59_1
| ~ spl59_2 ),
inference(forward_demodulation,[],[f2545,f5937]) ).
fof(f6214,plain,
( sK55 != app(sK58,cons(sK57,nil))
| ~ spl59_1
| ~ spl59_2
| spl59_7 ),
inference(forward_demodulation,[],[f6140,f6171]) ).
fof(f6215,plain,
( $false
| ~ spl59_1
| ~ spl59_2
| spl59_7 ),
inference(forward_subsumption_resolution,[],[f6214,f4516]) ).
fof(f6216,plain,
( ~ spl59_1
| ~ spl59_2
| spl59_7 ),
inference(avatar_contradiction_clause,[],[f6215]) ).
fof(f6224,plain,
( nil = sK56
| ~ ssList(sK56)
| ~ ssList(nil)
| spl59_5 ),
inference(resolution,[],[f588,f386]) ).
fof(f6225,plain,
( ~ ssList(sK56)
| ~ ssList(nil)
| spl59_3
| spl59_5 ),
inference(forward_subsumption_resolution,[],[f6224,f572]) ).
fof(f6226,plain,
( ~ ssList(nil)
| spl59_3
| spl59_5 ),
inference(forward_subsumption_resolution,[],[f6225,f509]) ).
fof(f6227,plain,
( $false
| spl59_3
| spl59_5 ),
inference(forward_subsumption_resolution,[],[f6226,f388]) ).
fof(f6228,plain,
( spl59_3
| spl59_5 ),
inference(avatar_contradiction_clause,[],[f6227]) ).
cnf(s1,plain,
( ~ spl59_1
| spl59_2 ),
inference(sat_conversion,[],[f568]) ).
cnf(s2,plain,
( ~ spl59_3
| spl59_4 ),
inference(sat_conversion,[],[f577]) ).
cnf(s3,plain,
( spl59_1
| spl59_3 ),
inference(sat_conversion,[],[f580]) ).
cnf(s5,plain,
( spl59_3
| ~ spl59_5
| ~ spl59_6
| ~ spl59_7
| ~ spl59_8
| ~ spl59_9 ),
inference(sat_conversion,[],[f608]) ).
cnf(s82,plain,
( ~ spl59_6
| spl59_8 ),
inference(sat_conversion,[],[f1409]) ).
cnf(s170,plain,
( spl59_3
| spl59_6 ),
inference(sat_conversion,[],[f2153]) ).
cnf(s209,plain,
( spl59_1
| ~ spl59_3
| ~ spl59_4 ),
inference(sat_conversion,[],[f2430]) ).
cnf(s213,plain,
( ~ spl59_1
| ~ spl59_3 ),
inference(sat_conversion,[],[f2464]) ).
cnf(s214,plain,
( spl59_3
| spl59_9 ),
inference(sat_conversion,[],[f2472]) ).
cnf(s427,plain,
( ~ spl59_1
| ~ spl59_2
| spl59_7 ),
inference(sat_conversion,[],[f6216]) ).
cnf(s428,plain,
( spl59_3
| spl59_5 ),
inference(sat_conversion,[],[f6228]) ).
cnf(s431,plain,
( ~ spl59_3
| spl59_1 ),
inference(rat,[],[s2,s209]) ).
cnf(s432,plain,
spl59_1,
inference(rat,[],[s431,s3]) ).
cnf(s435,plain,
~ spl59_3,
inference(rat,[],[s213,s432]) ).
cnf(s436,plain,
spl59_2,
inference(rat,[],[s1,s432]) ).
cnf(s437,plain,
spl59_5,
inference(rat,[],[s428,s435]) ).
cnf(s440,plain,
spl59_9,
inference(rat,[],[s214,s435]) ).
cnf(s442,plain,
spl59_6,
inference(rat,[],[s170,s435]) ).
cnf(s444,plain,
spl59_7,
inference(rat,[],[s427,s432,s436]) ).
cnf(s450,plain,
spl59_8,
inference(rat,[],[s82,s442]) ).
cnf(s451,plain,
$false,
inference(rat,[],[s5,s440,s437,s435,s442,s450,s444]) ).
fof(f6229,plain,
$false,
inference(avatar_sat_refutation,[],[s451]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC310+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18 % Computer : n003.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Mon Sep 28 09:02:27 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/0.21 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.92/0.65 % (1446614)Will run a generic schedule for satisfiability detection.
% 2.92/0.65 % (1446619)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=300213768_2999 on theBenchmark for (2999ds/0Mi)
% 2.92/0.65 % (1446620)% WARNING: option uhcvi not known.
% 2.92/0.65 % (1446623)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4004037748:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.92/0.65 % (1446620)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3419487817:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.92/0.65 % (1446621)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3322344073:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.92/0.65 % (1446622)dis+10_1_sil=32000:sp=arity:random_seed=208330414:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.92/0.65 % (1446624)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3037151286:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.92/0.65 % (1446625)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1429753662:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.92/0.65 % TRYING [1]
% 2.92/0.65 % TRYING [2]
% 2.92/0.65 % TRYING [3]
% 2.92/0.65 % TRYING [4]
% 2.92/0.65 % TRYING [5]
% 2.92/0.65 % (1446622)Instruction limit reached!
% 2.92/0.65 % (1446622)------------------------------
% 2.92/0.65 % (1446622)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.92/0.65 % (1446622)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/0.65 % (1446622)CaDiCaL version: 2.1.3
% 2.92/0.65 % (1446622)Termination reason: Instruction limit
% 2.92/0.65 % (1446622)Termination phase: Saturation
% 2.92/0.65 % (1446622)Time elapsed: 0.063 s
% 2.92/0.65 % (1446622)Peak memory usage: 13 MB
% 2.92/0.65 % (1446622)Instructions burned: 104 (million)
% 2.92/0.65 % (1446623)Instruction limit reached!
% 2.92/0.65 % (1446623)------------------------------
% 2.92/0.65 % (1446623)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.92/0.65 % (1446623)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/0.65 % (1446623)CaDiCaL version: 2.1.3
% 2.92/0.65 % (1446623)Termination reason: Instruction limit
% 2.92/0.65 % (1446623)Termination phase: Saturation
% 2.92/0.65 % (1446623)Time elapsed: 0.069 s
% 2.92/0.65 % (1446623)Peak memory usage: 13 MB
% 2.92/0.65 % (1446623)Instructions burned: 116 (million)
% 2.92/0.65 % (1446624)Instruction limit reached!
% 2.92/0.65 % (1446624)------------------------------
% 2.92/0.65 % (1446624)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.92/0.65 % (1446624)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/0.65 % (1446624)CaDiCaL version: 2.1.3
% 2.92/0.65 % (1446624)Termination reason: Instruction limit
% 2.92/0.65 % (1446624)Termination phase: Saturation
% 2.92/0.65 % (1446624)Time elapsed: 0.079 s
% 2.92/0.65 % (1446624)Peak memory usage: 14 MB
% 2.92/0.65 % (1446624)Instructions burned: 138 (million)
% 2.92/0.65 % (1446633)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3552011140:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.92/0.65 % (1446634)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=227192754:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.92/0.65 % TRYING [1]
% 2.92/0.65 % (1446635)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=2371289108:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.92/0.65 % TRYING [2]
% 2.92/0.65 % (1446625)Instruction limit reached!
% 2.92/0.65 % (1446625)------------------------------
% 2.92/0.65 % (1446625)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.92/0.65 % (1446625)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/0.65 % (1446625)CaDiCaL version: 2.1.3
% 2.92/0.65 % (1446625)Termination reason: Instruction limit
% 2.92/0.65 % (1446625)Termination phase: Saturation
% 2.92/0.65 % (1446625)Time elapsed: 0.102 s
% 2.92/0.65 % (1446625)Peak memory usage: 15 MB
% 2.92/0.65 % (1446625)Instructions burned: 160 (million)
% 2.92/0.65 % TRYING [3]
% 2.92/0.65 % TRYING [6]
% 2.92/0.65 % TRYING [4]
% 2.92/0.65 % (1446639)ott-21_1_sil=16000:fs=off:random_seed=2058319005:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.92/0.65 % (1446634)Instruction limit reached!
% 2.92/0.65 % (1446634)------------------------------
% 2.92/0.65 % (1446634)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.92/0.65 % (1446634)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/0.65 % (1446634)CaDiCaL version: 2.1.3
% 2.92/0.65 % (1446634)Termination reason: Instruction limit
% 2.92/0.65 % (1446634)Termination phase: Saturation
% 2.92/0.65 % (1446634)Time elapsed: 0.074 s
% 2.92/0.65 % (1446634)Peak memory usage: 14 MB
% 2.92/0.65 % (1446634)Instructions burned: 131 (million)
% 2.92/0.65 % TRYING [5]
% 2.92/0.65 % (1446641)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2205723181:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 2.92/0.65 % (1446639)Instruction limit reached!
% 2.92/0.65 % (1446639)------------------------------
% 2.92/0.65 % (1446639)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.92/0.65 % (1446639)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/0.65 % (1446639)CaDiCaL version: 2.1.3
% 2.92/0.65 % (1446639)Termination reason: Instruction limit
% 2.92/0.65 % (1446639)Termination phase: Saturation
% 2.92/0.65 % (1446639)Time elapsed: 0.091 s
% 2.92/0.65 % (1446639)Peak memory usage: 13 MB
% 2.92/0.65 % (1446639)Instructions burned: 182 (million)
% 2.92/0.65 % (1446643)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1998450005:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.92/0.65 % TRYING [1]
% 2.92/0.65 % TRYING [2]
% 2.92/0.65 % TRYING [3]
% 2.92/0.65 % TRYING [7]
% 2.92/0.65 % TRYING [4]
% 2.92/0.65 % TRYING [6]
% 2.92/0.65 % (1446641) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1446614-1446641"...
% 2.92/0.65 % (1446641)...printing done.
% 2.92/0.65 % (1446641)Refutation found. Thanks to Tanya!
% 2.92/0.65 % SZS status Theorem for theBenchmark
% 2.92/0.65 % SZS output start Proof for theBenchmark
% See solution above
% 2.92/0.65 % (1446641)------------------------------
% 2.92/0.65 % (1446641)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.92/0.65 % (1446641)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.92/0.65 % (1446641)CaDiCaL version: 2.1.3
% 2.92/0.65 % (1446641)Termination reason: Refutation
% 2.92/0.65 % (1446641)Time elapsed: 0.201 s
% 2.92/0.65 % (1446641)Peak memory usage: 14 MB
% 2.92/0.65 % (1446641)Instructions burned: 301 (million)
% 2.92/0.65 % (1446614)Success in time 0.425 s
% 2.92/0.65 % Vampire exiting
%------------------------------------------------------------------------------