%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC204+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 : n013.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:05 PM UTC 2026
% Result : Theorem 0.14s 0.49s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 19
% Syntax : Number of formulae : 129 ( 21 unt; 10 def)
% Number of atoms : 415 ( 85 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 488 ( 202 ~; 213 |; 40 &)
% ( 12 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 11 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 68 ( 0 sgn 56 !; 12 ?)
% 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(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f18,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) != X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(f22,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssItem(hd(X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(f24,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssList(tl(X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(f78,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> cons(hd(X0),tl(X0)) = X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( ( ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& X3 != X4
& ? [X5] :
( ssList(X5)
& tl(X3) = X5
& app(X2,X5) = X4
& neq(nil,X3) ) )
| neq(X0,nil) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
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
| ( ( ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& X3 != X4
& ? [X5] :
( ssList(X5)
& tl(X3) = X5
& app(X2,X5) = X4
& neq(nil,X3) ) )
| neq(X0,nil) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
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(f120,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f18]) ).
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(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(f132,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f134,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f192,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f78]) ).
fof(f193,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f192]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| X3 = X4
| ! [X5] :
( ~ ssList(X5)
| tl(X3) != X5
| app(X2,X5) != X4
| ~ neq(nil,X3) ) )
& ~ neq(X0,nil) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| X3 = X4
| ! [X5] :
( ~ ssList(X5)
| tl(X3) != X5
| app(X2,X5) != X4
| ~ neq(nil,X3) ) )
& ~ neq(X0,nil) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f273,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f296,plain,
( sK54 = sK56
& sK53 = sK55
& ( ( neq(sK54,nil)
& ! [X4] :
( ~ ssList(X4)
| sK56 = X4
| ! [X5] :
( ~ ssList(X5)
| tl(sK56) != X5
| app(sK55,X5) != X4
| ~ neq(nil,sK56) ) )
& ~ neq(sK53,nil) )
| ( neq(sK54,nil)
& ~ neq(sK56,nil) ) )
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56)],[f222]) ).
fof(f386,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f273]) ).
fof(f387,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f273]) ).
fof(f389,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f390,plain,
! [X0,X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f397,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f127]) ).
fof(f399,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f401,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f403,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f134]) ).
fof(f474,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| cons(hd(X0),tl(X0)) = X0 ),
inference(cnf_transformation,[],[f193]) ).
fof(f498,plain,
ssList(sK55),
inference(cnf_transformation,[],[f296]) ).
fof(f499,plain,
ssList(sK56),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
( ~ neq(sK53,nil)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
! [X4,X5] :
( ~ ssList(X4)
| sK56 = X4
| ~ ssList(X5)
| tl(sK56) != X5
| app(sK55,X5) != X4
| ~ neq(nil,sK56)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
( neq(sK54,nil)
| neq(sK54,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f508,plain,
( neq(sK56,nil)
| neq(sK56,nil) ),
inference(definition_unfolding,[],[f505,f507,f507]) ).
fof(f512,plain,
( ~ neq(sK55,nil)
| ~ neq(sK56,nil) ),
inference(definition_unfolding,[],[f500,f506]) ).
fof(f529,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f386]) ).
fof(f544,plain,
! [X4] :
( ~ ssList(X4)
| sK56 = X4
| ~ ssList(tl(sK56))
| app(sK55,tl(sK56)) != X4
| ~ neq(nil,sK56)
| ~ neq(sK56,nil) ),
inference(equality_resolution,[],[f502]) ).
fof(f545,plain,
( ~ ssList(app(sK55,tl(sK56)))
| sK56 = app(sK55,tl(sK56))
| ~ ssList(tl(sK56))
| ~ neq(nil,sK56)
| ~ neq(sK56,nil) ),
inference(equality_resolution,[],[f544]) ).
fof(f546,plain,
neq(sK56,nil),
inference(duplicate_literal_removal,[],[f508]) ).
fof(f551,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f529]) ).
fof(f555,definition,
( spl57_1
<=> neq(sK56,nil) ),
introduced(definition,[new_symbols(definition,[spl57_1])],[avatar_definition]) ).
fof(f556,plain,
( neq(sK56,nil)
| ~ spl57_1 ),
inference(avatar_component_clause,[],[f555]) ).
fof(f559,definition,
( spl57_2
<=> neq(sK55,nil) ),
introduced(definition,[new_symbols(definition,[spl57_2])],[avatar_definition]) ).
fof(f561,plain,
( ~ neq(sK55,nil)
| spl57_2 ),
inference(avatar_component_clause,[],[f559]) ).
fof(f562,plain,
( ~ spl57_1
| ~ spl57_2 ),
inference(avatar_split_clause,[],[f512,f559,f555]) ).
fof(f565,definition,
( spl57_3
<=> neq(nil,sK56) ),
introduced(definition,[new_symbols(definition,[spl57_3])],[avatar_definition]) ).
fof(f567,plain,
( ~ neq(nil,sK56)
| spl57_3 ),
inference(avatar_component_clause,[],[f565]) ).
fof(f569,definition,
( spl57_4
<=> ssList(tl(sK56)) ),
introduced(definition,[new_symbols(definition,[spl57_4])],[avatar_definition]) ).
fof(f570,plain,
( ssList(tl(sK56))
| ~ spl57_4 ),
inference(avatar_component_clause,[],[f569]) ).
fof(f571,plain,
( ~ ssList(tl(sK56))
| spl57_4 ),
inference(avatar_component_clause,[],[f569]) ).
fof(f573,definition,
( spl57_5
<=> sK56 = app(sK55,tl(sK56)) ),
introduced(definition,[new_symbols(definition,[spl57_5])],[avatar_definition]) ).
fof(f575,plain,
( sK56 = app(sK55,tl(sK56))
| ~ spl57_5 ),
inference(avatar_component_clause,[],[f573]) ).
fof(f577,definition,
( spl57_6
<=> ssList(app(sK55,tl(sK56))) ),
introduced(definition,[new_symbols(definition,[spl57_6])],[avatar_definition]) ).
fof(f579,plain,
( ~ ssList(app(sK55,tl(sK56)))
| spl57_6 ),
inference(avatar_component_clause,[],[f577]) ).
fof(f580,plain,
( ~ spl57_1
| ~ spl57_3
| ~ spl57_4
| spl57_5
| ~ spl57_6 ),
inference(avatar_split_clause,[],[f545,f577,f573,f569,f565,f555]) ).
fof(f582,plain,
spl57_1,
inference(avatar_split_clause,[],[f546,f555]) ).
fof(f584,definition,
( spl57_7
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl57_7])],[avatar_definition]) ).
fof(f585,plain,
( ssList(nil)
| ~ spl57_7 ),
inference(avatar_component_clause,[],[f584]) ).
fof(f617,plain,
spl57_7,
inference(avatar_split_clause,[],[f389,f584]) ).
fof(f998,definition,
( spl57_32
<=> nil = sK56 ),
introduced(definition,[new_symbols(definition,[spl57_32])],[avatar_definition]) ).
fof(f999,plain,
( nil != sK56
| spl57_32 ),
inference(avatar_component_clause,[],[f998]) ).
fof(f1000,plain,
( nil = sK56
| ~ spl57_32 ),
inference(avatar_component_clause,[],[f998]) ).
fof(f1007,definition,
( spl57_34
<=> nil = sK55 ),
introduced(definition,[new_symbols(definition,[spl57_34])],[avatar_definition]) ).
fof(f1009,plain,
( nil = sK55
| ~ spl57_34 ),
inference(avatar_component_clause,[],[f1007]) ).
fof(f1013,plain,
( nil = sK55
| ~ ssList(nil)
| ~ ssList(sK55)
| spl57_2 ),
inference(resolution,[],[f387,f561]) ).
fof(f1014,plain,
( nil = sK56
| ~ ssList(sK56)
| ~ ssList(nil)
| spl57_3 ),
inference(resolution,[],[f387,f567]) ).
fof(f1019,plain,
( nil = sK56
| ~ ssList(nil)
| spl57_3 ),
inference(forward_subsumption_resolution,[],[f1014,f499]) ).
fof(f1020,plain,
( nil = sK55
| ~ ssList(sK55)
| spl57_2
| ~ spl57_7 ),
inference(forward_subsumption_resolution,[],[f1013,f585]) ).
fof(f1021,plain,
( nil = sK56
| spl57_3
| ~ spl57_7 ),
inference(forward_subsumption_resolution,[],[f1019,f585]) ).
fof(f1022,plain,
( nil = sK55
| spl57_2
| ~ spl57_7 ),
inference(forward_subsumption_resolution,[],[f1020,f498]) ).
fof(f1023,plain,
( spl57_32
| spl57_3
| ~ spl57_7 ),
inference(avatar_split_clause,[],[f1021,f584,f565,f998]) ).
fof(f1024,plain,
( spl57_34
| spl57_2
| ~ spl57_7 ),
inference(avatar_split_clause,[],[f1022,f584,f559,f1007]) ).
fof(f1026,plain,
( neq(nil,nil)
| ~ spl57_1
| ~ spl57_32 ),
inference(superposition,[],[f556,f1000]) ).
fof(f1153,plain,
( ~ ssList(nil)
| ~ spl57_1
| ~ spl57_32 ),
inference(resolution,[],[f1026,f551]) ).
fof(f1154,plain,
( $false
| ~ spl57_1
| ~ spl57_7
| ~ spl57_32 ),
inference(forward_subsumption_resolution,[],[f1153,f585]) ).
fof(f1155,plain,
( ~ spl57_1
| ~ spl57_7
| ~ spl57_32 ),
inference(avatar_contradiction_clause,[],[f1154]) ).
fof(f1157,plain,
( nil = sK56
| ~ ssList(sK56)
| spl57_4 ),
inference(resolution,[],[f571,f399]) ).
fof(f1158,plain,
( nil = sK56
| spl57_4 ),
inference(forward_subsumption_resolution,[],[f1157,f499]) ).
fof(f1159,plain,
( spl57_32
| spl57_4 ),
inference(avatar_split_clause,[],[f1158,f569,f998]) ).
fof(f1160,plain,
( ~ ssList(app(nil,tl(sK56)))
| spl57_6
| ~ spl57_34 ),
inference(forward_demodulation,[],[f579,f1009]) ).
fof(f1167,plain,
( tl(sK56) = app(nil,tl(sK56))
| ~ spl57_4 ),
inference(resolution,[],[f570,f403]) ).
fof(f1178,plain,
( ~ ssList(tl(sK56))
| ~ ssList(nil)
| spl57_6
| ~ spl57_34 ),
inference(resolution,[],[f1160,f401]) ).
fof(f1179,plain,
( ~ ssList(nil)
| ~ spl57_4
| spl57_6
| ~ spl57_34 ),
inference(forward_subsumption_resolution,[],[f1178,f570]) ).
fof(f1180,plain,
( $false
| ~ spl57_4
| spl57_6
| ~ spl57_7
| ~ spl57_34 ),
inference(forward_subsumption_resolution,[],[f1179,f585]) ).
fof(f1181,plain,
( ~ spl57_4
| spl57_6
| ~ spl57_7
| ~ spl57_34 ),
inference(avatar_contradiction_clause,[],[f1180]) ).
fof(f1182,plain,
( sK56 = app(nil,tl(sK56))
| ~ spl57_5
| ~ spl57_34 ),
inference(forward_demodulation,[],[f575,f1009]) ).
fof(f1510,plain,
( nil = sK56
| sK56 = cons(hd(sK56),tl(sK56)) ),
inference(resolution,[],[f474,f499]) ).
fof(f1511,plain,
( sK56 = cons(hd(sK56),tl(sK56))
| spl57_32 ),
inference(forward_subsumption_resolution,[],[f1510,f999]) ).
fof(f1547,plain,
( sK56 = tl(sK56)
| ~ spl57_4
| ~ spl57_5
| ~ spl57_34 ),
inference(forward_demodulation,[],[f1167,f1182]) ).
fof(f2112,plain,
( sK56 = cons(hd(sK56),sK56)
| ~ spl57_4
| ~ spl57_5
| spl57_32
| ~ spl57_34 ),
inference(forward_demodulation,[],[f1511,f1547]) ).
fof(f2154,plain,
( sK56 != sK56
| ~ ssItem(hd(sK56))
| ~ ssList(sK56)
| ~ spl57_4
| ~ spl57_5
| spl57_32
| ~ spl57_34 ),
inference(superposition,[],[f390,f2112]) ).
fof(f2162,plain,
( ~ ssItem(hd(sK56))
| ~ ssList(sK56)
| ~ spl57_4
| ~ spl57_5
| spl57_32
| ~ spl57_34 ),
inference(trivial_inequality_removal,[],[f2154]) ).
fof(f2164,plain,
( ~ ssItem(hd(sK56))
| ~ spl57_4
| ~ spl57_5
| spl57_32
| ~ spl57_34 ),
inference(forward_subsumption_resolution,[],[f2162,f499]) ).
fof(f2166,definition,
( spl57_71
<=> ssItem(hd(sK56)) ),
introduced(definition,[new_symbols(definition,[spl57_71])],[avatar_definition]) ).
fof(f2168,plain,
( ~ ssItem(hd(sK56))
| spl57_71 ),
inference(avatar_component_clause,[],[f2166]) ).
fof(f2174,plain,
( ~ spl57_71
| ~ spl57_4
| ~ spl57_5
| spl57_32
| ~ spl57_34 ),
inference(avatar_split_clause,[],[f2164,f1007,f998,f573,f569,f2166]) ).
fof(f2202,plain,
( nil = sK56
| ~ ssList(sK56)
| spl57_71 ),
inference(resolution,[],[f2168,f397]) ).
fof(f2203,plain,
( ~ ssList(sK56)
| spl57_32
| spl57_71 ),
inference(forward_subsumption_resolution,[],[f2202,f999]) ).
fof(f2204,plain,
( $false
| spl57_32
| spl57_71 ),
inference(forward_subsumption_resolution,[],[f2203,f499]) ).
fof(f2205,plain,
( spl57_32
| spl57_71 ),
inference(avatar_contradiction_clause,[],[f2204]) ).
cnf(s1,plain,
( ~ spl57_1
| ~ spl57_2 ),
inference(sat_conversion,[],[f562]) ).
cnf(s3,plain,
( ~ spl57_1
| ~ spl57_3
| ~ spl57_4
| spl57_5
| ~ spl57_6 ),
inference(sat_conversion,[],[f580]) ).
cnf(s5,plain,
spl57_1,
inference(sat_conversion,[],[f582]) ).
cnf(s14,plain,
spl57_7,
inference(sat_conversion,[],[f617]) ).
cnf(s31,plain,
( spl57_3
| ~ spl57_7
| spl57_32 ),
inference(sat_conversion,[],[f1023]) ).
cnf(s32,plain,
( spl57_2
| ~ spl57_7
| spl57_34 ),
inference(sat_conversion,[],[f1024]) ).
cnf(s45,plain,
( ~ spl57_1
| ~ spl57_7
| ~ spl57_32 ),
inference(sat_conversion,[],[f1155]) ).
cnf(s47,plain,
( spl57_4
| spl57_32 ),
inference(sat_conversion,[],[f1159]) ).
cnf(s49,plain,
( ~ spl57_4
| spl57_6
| ~ spl57_7
| ~ spl57_34 ),
inference(sat_conversion,[],[f1181]) ).
cnf(s100,plain,
( ~ spl57_4
| ~ spl57_5
| spl57_32
| ~ spl57_34
| ~ spl57_71 ),
inference(sat_conversion,[],[f2174]) ).
cnf(s103,plain,
( spl57_32
| spl57_71 ),
inference(sat_conversion,[],[f2205]) ).
cnf(s108,plain,
~ spl57_32,
inference(rat,[],[s45,s14,s5]) ).
cnf(s109,plain,
spl57_71,
inference(rat,[],[s103,s108]) ).
cnf(s112,plain,
spl57_4,
inference(rat,[],[s47,s108]) ).
cnf(s113,plain,
spl57_3,
inference(rat,[],[s31,s14,s108]) ).
cnf(s116,plain,
( spl57_5
| ~ spl57_6 ),
inference(rat,[],[s3,s112,s113,s5]) ).
cnf(s117,plain,
~ spl57_2,
inference(rat,[],[s1,s5]) ).
cnf(s118,plain,
spl57_34,
inference(rat,[],[s32,s14,s117]) ).
cnf(s125,plain,
~ spl57_5,
inference(rat,[],[s100,s109,s112,s108,s118]) ).
cnf(s126,plain,
spl57_6,
inference(rat,[],[s49,s112,s14,s118]) ).
cnf(s127,plain,
$false,
inference(rat,[],[s116,s126,s125]) ).
fof(f2206,plain,
$false,
inference(avatar_sat_refutation,[],[s127]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC204+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.09/0.37 % Computer : n013.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 28 08:26:37 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.40 Running first-order model finding
% 0.09/0.40 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
% 0.14/0.49 % (1022341)Will run a generic schedule for satisfiability detection.
% 0.14/0.49 % (1022348)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2529962378:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.14/0.49 % (1022347)% WARNING: option uhcvi not known.
% 0.14/0.49 % (1022347)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3076451195:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.14/0.49 % (1022346)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=61676167_2999 on theBenchmark for (2999ds/0Mi)
% 0.14/0.49 % (1022350)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1349750898:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.14/0.49 % (1022349)dis+10_1_sil=32000:sp=arity:random_seed=1945870296:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.14/0.49 % (1022351)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3958408427:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.14/0.49 % (1022352)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4274252216:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.14/0.49 % TRYING [1]
% 0.14/0.49 % TRYING [2]
% 0.14/0.49 % TRYING [3]
% 0.14/0.49 % (1022349) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1022341-1022349"...
% 0.14/0.49 % TRYING [4]
% 0.14/0.49 % (1022349)...printing done.
% 0.14/0.49 % (1022349)Refutation found. Thanks to Tanya!
% 0.14/0.49 % SZS status Theorem for theBenchmark
% 0.14/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.49 % (1022349)------------------------------
% 0.14/0.49 % (1022349)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.14/0.49 % (1022349)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.14/0.49 % (1022349)CaDiCaL version: 2.1.3
% 0.14/0.49 % (1022349)Termination reason: Refutation
% 0.14/0.49 % (1022349)Time elapsed: 0.038 s
% 0.14/0.49 % (1022349)Peak memory usage: 13 MB
% 0.14/0.49 % (1022349)Instructions burned: 61 (million)
% 0.14/0.49 % (1022341)Success in time 0.079 s
% 0.14/0.49 % Vampire exiting
%------------------------------------------------------------------------------