%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC214-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 : n016.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:08 PM UTC 2026
% Result : Unsatisfiable 1.54s 0.74s
% Output : Refutation 1.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 39
% Syntax : Number of formulae : 181 ( 40 unt; 15 def)
% Number of atoms : 506 ( 47 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 508 ( 183 ~; 310 |; 0 &)
% ( 15 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 24 ( 22 usr; 16 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 110 ( 0 sgn 110 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f12,axiom,
! [X0] : ssItem(skaf83(X0)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause12) ).
fof(f13,axiom,
! [X0] : ssList(skaf82(X0)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause13) ).
fof(f56,axiom,
! [X0] :
( ~ ssList(X0)
| segmentP(X0,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause56) ).
fof(f60,axiom,
! [X0] :
( ~ ssList(X0)
| frontsegP(X0,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause60) ).
fof(f66,axiom,
! [X0] :
( ~ ssItem(X0)
| strictorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause66) ).
fof(f72,axiom,
! [X0,X1] :
( ~ ssList(X0)
| duplicatefreeP(X0)
| ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
fof(f75,axiom,
! [X0] :
( ~ ssList(X0)
| ssList(tl(X0))
| nil = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause75) ).
fof(f76,axiom,
! [X0] :
( ~ ssList(X0)
| ssItem(hd(X0))
| nil = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause76) ).
fof(f85,axiom,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X1,X0)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
fof(f86,axiom,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ssList(cons(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
fof(f98,axiom,
! [X0,X1] :
( cons(X0,X1) != nil
| ~ ssItem(X0)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
fof(f99,plain,
! [X0,X1] :
( nil != cons(X0,X1)
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(reorient_equations,[],[f98]) ).
fof(f101,axiom,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| neq(X1,X0)
| X1 = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
fof(f102,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| neq(X1,X0)
| X0 = X1 ),
inference(reorient_equations,[],[f101]) ).
fof(f107,axiom,
! [X0] :
( ~ ssList(X0)
| cons(hd(X0),tl(X0)) = X0
| nil = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause104) ).
fof(f112,axiom,
! [X0] :
( ~ ssList(X0)
| cons(skaf83(X0),skaf82(X0)) = X0
| nil = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause109) ).
fof(f192,axiom,
! [X2,X3,X0,X1] :
( ~ frontsegP(X0,X1)
| X2 != X3
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssItem(X3)
| ~ ssItem(X2)
| frontsegP(cons(X2,X0),cons(X3,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause178) ).
fof(f193,axiom,
! [X2,X3,X0,X1,X4] :
( app(app(X0,cons(X1,X2)),cons(X1,X3)) != X4
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X1)
| ~ duplicatefreeP(X4)
| ~ ssList(X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause179) ).
fof(f200,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
fof(f201,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
fof(f204,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f209,negated_conjecture,
! [X0] :
( ~ ssList(X0)
| ~ neq(sk3,X0)
| ~ frontsegP(sk4,X0)
| ~ segmentP(X0,sk3)
| ~ strictorderedP(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
fof(f210,negated_conjecture,
~ neq(sk1,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f211,plain,
ssList(sk3),
inference(definition_unfolding,[],[f200,f205]) ).
fof(f212,plain,
ssList(sk4),
inference(definition_unfolding,[],[f201,f204]) ).
fof(f213,plain,
neq(sk4,nil),
inference(definition_unfolding,[],[f206,f204]) ).
fof(f214,plain,
~ neq(sk3,nil),
inference(definition_unfolding,[],[f210,f205]) ).
fof(f231,plain,
! [X3,X0,X1] :
( ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssItem(X3)
| ~ ssItem(X3)
| frontsegP(cons(X3,X0),cons(X3,X1)) ),
inference(equality_resolution,[],[f192]) ).
fof(f232,plain,
! [X2,X3,X0,X1] :
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X1)
| ~ duplicatefreeP(app(app(X0,cons(X1,X2)),cons(X1,X3)))
| ~ ssList(app(app(X0,cons(X1,X2)),cons(X1,X3))) ),
inference(equality_resolution,[],[f193]) ).
fof(f240,plain,
~ ssList(nil),
inference(consistent_polarity_flipping,[],[f8]) ).
fof(f243,plain,
! [X0] : ~ ssItem(skaf83(X0)),
inference(consistent_polarity_flipping,[],[f12]) ).
fof(f244,plain,
! [X0] : ~ ssList(skaf82(X0)),
inference(consistent_polarity_flipping,[],[f13]) ).
fof(f286,plain,
! [X0] :
( ~ segmentP(X0,nil)
| ssList(X0) ),
inference(consistent_polarity_flipping,[],[f56]) ).
fof(f290,plain,
! [X0] :
( frontsegP(X0,nil)
| ssList(X0) ),
inference(consistent_polarity_flipping,[],[f60]) ).
fof(f296,plain,
! [X0] :
( ssItem(X0)
| strictorderedP(cons(X0,nil)) ),
inference(consistent_polarity_flipping,[],[f66]) ).
fof(f302,plain,
! [X0,X1] :
( ssList(X0)
| duplicatefreeP(X0)
| ~ ssItem(X1) ),
inference(consistent_polarity_flipping,[],[f72]) ).
fof(f305,plain,
! [X0] :
( ~ ssList(tl(X0))
| ssList(X0)
| nil = X0 ),
inference(consistent_polarity_flipping,[],[f75]) ).
fof(f306,plain,
! [X0] :
( ~ ssItem(hd(X0))
| ssList(X0)
| nil = X0 ),
inference(consistent_polarity_flipping,[],[f76]) ).
fof(f315,plain,
! [X0,X1] :
( ~ ssList(app(X1,X0))
| ssList(X1)
| ssList(X0) ),
inference(consistent_polarity_flipping,[],[f85]) ).
fof(f316,plain,
! [X0,X1] :
( ~ ssList(cons(X0,X1))
| ssList(X1)
| ssItem(X0) ),
inference(consistent_polarity_flipping,[],[f86]) ).
fof(f328,plain,
! [X0,X1] :
( nil != cons(X0,X1)
| ssItem(X0)
| ssList(X1) ),
inference(consistent_polarity_flipping,[],[f99]) ).
fof(f330,plain,
! [X0,X1] :
( ~ neq(X1,X0)
| ssList(X1)
| ssList(X0)
| X0 = X1 ),
inference(consistent_polarity_flipping,[],[f102]) ).
fof(f334,plain,
! [X0] :
( ssList(X0)
| cons(hd(X0),tl(X0)) = X0
| nil = X0 ),
inference(consistent_polarity_flipping,[],[f107]) ).
fof(f339,plain,
! [X0] :
( ssList(X0)
| cons(skaf83(X0),skaf82(X0)) = X0
| nil = X0 ),
inference(consistent_polarity_flipping,[],[f112]) ).
fof(f408,plain,
! [X3,X0,X1] :
( ~ frontsegP(X0,X1)
| ssList(X1)
| ssList(X0)
| ssItem(X3)
| ssItem(X3)
| frontsegP(cons(X3,X0),cons(X3,X1)) ),
inference(consistent_polarity_flipping,[],[f231]) ).
fof(f409,plain,
! [X2,X3,X0,X1] :
( ssList(X3)
| ssList(X2)
| ssList(X0)
| ssItem(X1)
| ~ duplicatefreeP(app(app(X0,cons(X1,X2)),cons(X1,X3)))
| ssList(app(app(X0,cons(X1,X2)),cons(X1,X3))) ),
inference(consistent_polarity_flipping,[],[f232]) ).
fof(f416,plain,
~ ssList(sk3),
inference(consistent_polarity_flipping,[],[f211]) ).
fof(f417,plain,
~ ssList(sk4),
inference(consistent_polarity_flipping,[],[f212]) ).
fof(f420,plain,
~ neq(sk4,nil),
inference(consistent_polarity_flipping,[],[f213]) ).
fof(f421,plain,
! [X0] :
( ~ frontsegP(sk4,X0)
| neq(sk3,X0)
| ssList(X0)
| segmentP(X0,sk3)
| ~ strictorderedP(X0) ),
inference(consistent_polarity_flipping,[],[f209]) ).
fof(f422,plain,
neq(sk3,nil),
inference(consistent_polarity_flipping,[],[f214]) ).
fof(f423,plain,
! [X3,X0,X1] :
( ~ frontsegP(X0,X1)
| ssList(X1)
| ssList(X0)
| ssItem(X3)
| frontsegP(cons(X3,X0),cons(X3,X1)) ),
inference(duplicate_literal_removal,[],[f408]) ).
fof(f434,definition,
( spl0_2
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f435,plain,
( ~ ssList(nil)
| spl0_2 ),
inference(avatar_component_clause,[],[f434]) ).
fof(f443,definition,
( spl0_4
<=> ! [X1] :
( ssItem(X1)
| strictorderedP(cons(X1,nil)) ) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f444,plain,
( ! [X1] :
( strictorderedP(cons(X1,nil))
| ssItem(X1) )
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f443]) ).
fof(f462,definition,
( spl0_8
<=> ! [X1] : ~ ssItem(X1) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f463,plain,
( ! [X1] : ~ ssItem(X1)
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f462]) ).
fof(f465,definition,
( spl0_9
<=> ! [X0] :
( ssList(X0)
| duplicatefreeP(X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f466,plain,
( ! [X0] :
( duplicatefreeP(X0)
| ssList(X0) )
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f465]) ).
fof(f467,plain,
( spl0_8
| spl0_9 ),
inference(avatar_split_clause,[],[f302,f465,f462]) ).
fof(f469,plain,
spl0_4,
inference(avatar_split_clause,[],[f296,f443]) ).
fof(f470,plain,
~ spl0_2,
inference(avatar_split_clause,[],[f240,f434]) ).
fof(f688,plain,
( ssList(sk3)
| ssList(nil)
| nil = sk3 ),
inference(resolution,[],[f330,f422]) ).
fof(f695,plain,
( ssList(nil)
| nil = sk3 ),
inference(forward_subsumption_resolution,[],[f688,f416]) ).
fof(f696,plain,
( nil = sk3
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f695,f435]) ).
fof(f700,plain,
( neq(nil,nil)
| spl0_2 ),
inference(superposition,[],[f422,f696]) ).
fof(f751,plain,
( sk4 = cons(hd(sk4),tl(sk4))
| nil = sk4 ),
inference(resolution,[],[f334,f417]) ).
fof(f753,definition,
( spl0_15
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_15])],[avatar_definition]) ).
fof(f754,plain,
( nil != sk4
| spl0_15 ),
inference(avatar_component_clause,[],[f753]) ).
fof(f755,plain,
( nil = sk4
| ~ spl0_15 ),
inference(avatar_component_clause,[],[f753]) ).
fof(f757,definition,
( spl0_16
<=> sk4 = cons(hd(sk4),tl(sk4)) ),
introduced(definition,[new_symbols(definition,[spl0_16])],[avatar_definition]) ).
fof(f759,plain,
( sk4 = cons(hd(sk4),tl(sk4))
| ~ spl0_16 ),
inference(avatar_component_clause,[],[f757]) ).
fof(f760,plain,
( spl0_15
| spl0_16 ),
inference(avatar_split_clause,[],[f751,f757,f753]) ).
fof(f810,definition,
( spl0_17
<=> sk4 = cons(skaf83(sk4),skaf82(sk4)) ),
introduced(definition,[new_symbols(definition,[spl0_17])],[avatar_definition]) ).
fof(f812,plain,
( sk4 = cons(skaf83(sk4),skaf82(sk4))
| ~ spl0_17 ),
inference(avatar_component_clause,[],[f810]) ).
fof(f828,plain,
( ~ neq(nil,nil)
| ~ spl0_15 ),
inference(superposition,[],[f420,f755]) ).
fof(f1084,definition,
( spl0_19
<=> ssList(tl(sk4)) ),
introduced(definition,[new_symbols(definition,[spl0_19])],[avatar_definition]) ).
fof(f1085,plain,
( ~ ssList(tl(sk4))
| spl0_19 ),
inference(avatar_component_clause,[],[f1084]) ).
fof(f1086,plain,
( ssList(tl(sk4))
| ~ spl0_19 ),
inference(avatar_component_clause,[],[f1084]) ).
fof(f1088,definition,
( spl0_20
<=> ssItem(hd(sk4)) ),
introduced(definition,[new_symbols(definition,[spl0_20])],[avatar_definition]) ).
fof(f1089,plain,
( ~ ssItem(hd(sk4))
| spl0_20 ),
inference(avatar_component_clause,[],[f1088]) ).
fof(f1090,plain,
( ssItem(hd(sk4))
| ~ spl0_20 ),
inference(avatar_component_clause,[],[f1088]) ).
fof(f1167,plain,
( ssList(sk4)
| nil = sk4
| ~ spl0_20 ),
inference(resolution,[],[f1090,f306]) ).
fof(f1168,plain,
( nil = sk4
| ~ spl0_20 ),
inference(forward_subsumption_resolution,[],[f1167,f417]) ).
fof(f1169,plain,
( $false
| spl0_15
| ~ spl0_20 ),
inference(forward_subsumption_resolution,[],[f1168,f754]) ).
fof(f1170,plain,
( spl0_15
| ~ spl0_20 ),
inference(avatar_contradiction_clause,[],[f1169]) ).
fof(f1450,plain,
! [X0,X1] :
( ssList(nil)
| ssList(X0)
| ssItem(X1)
| frontsegP(cons(X1,X0),cons(X1,nil))
| ssList(X0) ),
inference(resolution,[],[f423,f290]) ).
fof(f1460,plain,
! [X0,X1] :
( ssList(nil)
| ssList(X0)
| ssItem(X1)
| frontsegP(cons(X1,X0),cons(X1,nil)) ),
inference(duplicate_literal_removal,[],[f1450]) ).
fof(f1466,plain,
( ! [X0,X1] :
( frontsegP(cons(X1,X0),cons(X1,nil))
| ssItem(X1)
| ssList(X0) )
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f1460,f435]) ).
fof(f1893,plain,
( ssList(sk4)
| nil = sk4
| ~ spl0_19 ),
inference(resolution,[],[f1086,f305]) ).
fof(f1894,plain,
( nil = sk4
| ~ spl0_19 ),
inference(forward_subsumption_resolution,[],[f1893,f417]) ).
fof(f1895,plain,
( $false
| spl0_15
| ~ spl0_19 ),
inference(forward_subsumption_resolution,[],[f1894,f754]) ).
fof(f1896,plain,
( spl0_15
| ~ spl0_19 ),
inference(avatar_contradiction_clause,[],[f1895]) ).
fof(f1980,plain,
( ! [X2,X3,X0,X1] :
( ssList(app(app(X0,cons(X1,X2)),cons(X1,X3)))
| ssList(X2)
| ssList(X0)
| ssItem(X1)
| ssList(X3) )
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f409,f466]) ).
fof(f2038,plain,
( ! [X2,X3,X0,X1] :
( ssList(X0)
| ssList(X1)
| ssItem(X2)
| ssList(X3)
| ssList(app(X1,cons(X2,X0)))
| ssList(cons(X2,X3)) )
| ~ spl0_9 ),
inference(resolution,[],[f1980,f315]) ).
fof(f2047,plain,
( ! [X2,X3,X0,X1] :
( ssList(X0)
| ssList(X1)
| ssItem(X2)
| ssList(X3)
| ssList(app(X1,cons(X2,X0))) )
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f2038,f316]) ).
fof(f2053,definition,
( spl0_44
<=> ! [X3] : ssList(X3) ),
introduced(definition,[new_symbols(definition,[spl0_44])],[avatar_definition]) ).
fof(f2054,plain,
( ! [X3] : ssList(X3)
| ~ spl0_44 ),
inference(avatar_component_clause,[],[f2053]) ).
fof(f2056,definition,
( spl0_45
<=> ! [X2,X0,X1] :
( ssList(X0)
| ssList(X1)
| ssList(app(X1,cons(X2,X0)))
| ssItem(X2) ) ),
introduced(definition,[new_symbols(definition,[spl0_45])],[avatar_definition]) ).
fof(f2057,plain,
( ! [X2,X0,X1] :
( ssList(app(X1,cons(X2,X0)))
| ssList(X1)
| ssList(X0)
| ssItem(X2) )
| ~ spl0_45 ),
inference(avatar_component_clause,[],[f2056]) ).
fof(f2869,plain,
( $false
| ~ spl0_44 ),
inference(backward_subsumption_resolution,[],[f417,f2054]) ).
fof(f2900,plain,
~ spl0_44,
inference(avatar_contradiction_clause,[],[f2869]) ).
fof(f2905,plain,
( sk4 = cons(skaf83(sk4),skaf82(sk4))
| nil = sk4 ),
inference(resolution,[],[f417,f339]) ).
fof(f5394,definition,
( spl0_70
<=> nil = cons(hd(sk4),nil) ),
introduced(definition,[new_symbols(definition,[spl0_70])],[avatar_definition]) ).
fof(f5396,plain,
( nil = cons(hd(sk4),nil)
| ~ spl0_70 ),
inference(avatar_component_clause,[],[f5394]) ).
fof(f5398,definition,
( spl0_71
<=> ssList(cons(hd(sk4),nil)) ),
introduced(definition,[new_symbols(definition,[spl0_71])],[avatar_definition]) ).
fof(f5399,plain,
( ~ ssList(cons(hd(sk4),nil))
| spl0_71 ),
inference(avatar_component_clause,[],[f5398]) ).
fof(f5400,plain,
( ssList(cons(hd(sk4),nil))
| ~ spl0_71 ),
inference(avatar_component_clause,[],[f5398]) ).
fof(f10069,plain,
( frontsegP(sk4,cons(hd(sk4),nil))
| ssItem(hd(sk4))
| ssList(tl(sk4))
| spl0_2
| ~ spl0_16 ),
inference(superposition,[],[f1466,f759]) ).
fof(f10074,plain,
( frontsegP(sk4,cons(hd(sk4),nil))
| ssList(tl(sk4))
| spl0_2
| ~ spl0_16
| spl0_20 ),
inference(forward_subsumption_resolution,[],[f10069,f1089]) ).
fof(f10081,plain,
( frontsegP(sk4,cons(hd(sk4),nil))
| spl0_2
| ~ spl0_16
| spl0_19
| spl0_20 ),
inference(forward_subsumption_resolution,[],[f10074,f1085]) ).
fof(f10693,plain,
( ! [X0] :
( ssList(app(X0,sk4))
| ssList(X0)
| ssList(skaf82(sk4))
| ssItem(skaf83(sk4)) )
| ~ spl0_17
| ~ spl0_45 ),
inference(superposition,[],[f2057,f812]) ).
fof(f10695,plain,
( ! [X0] :
( ssList(app(X0,sk4))
| ssList(X0)
| ssItem(skaf83(sk4)) )
| ~ spl0_17
| ~ spl0_45 ),
inference(forward_subsumption_resolution,[],[f10693,f244]) ).
fof(f10698,plain,
( ! [X0] :
( ssList(app(X0,sk4))
| ssList(X0) )
| ~ spl0_17
| ~ spl0_45 ),
inference(forward_subsumption_resolution,[],[f10695,f243]) ).
fof(f11071,plain,
( neq(sk3,cons(hd(sk4),nil))
| ssList(cons(hd(sk4),nil))
| segmentP(cons(hd(sk4),nil),sk3)
| ~ strictorderedP(cons(hd(sk4),nil))
| spl0_2
| ~ spl0_16
| spl0_19
| spl0_20 ),
inference(resolution,[],[f10081,f421]) ).
fof(f11082,plain,
( neq(nil,cons(hd(sk4),nil))
| ssList(cons(hd(sk4),nil))
| segmentP(cons(hd(sk4),nil),sk3)
| ~ strictorderedP(cons(hd(sk4),nil))
| spl0_2
| ~ spl0_16
| spl0_19
| spl0_20 ),
inference(forward_demodulation,[],[f11071,f696]) ).
fof(f11109,plain,
( segmentP(cons(hd(sk4),nil),nil)
| neq(nil,cons(hd(sk4),nil))
| ssList(cons(hd(sk4),nil))
| ~ strictorderedP(cons(hd(sk4),nil))
| spl0_2
| ~ spl0_16
| spl0_19
| spl0_20 ),
inference(forward_demodulation,[],[f11082,f696]) ).
fof(f11110,plain,
( neq(nil,cons(hd(sk4),nil))
| ssList(cons(hd(sk4),nil))
| ~ strictorderedP(cons(hd(sk4),nil))
| spl0_2
| ~ spl0_16
| spl0_19
| spl0_20 ),
inference(forward_subsumption_resolution,[],[f11109,f286]) ).
fof(f11112,definition,
( spl0_212
<=> strictorderedP(cons(hd(sk4),nil)) ),
introduced(definition,[new_symbols(definition,[spl0_212])],[avatar_definition]) ).
fof(f11114,plain,
( ~ strictorderedP(cons(hd(sk4),nil))
| spl0_212 ),
inference(avatar_component_clause,[],[f11112]) ).
fof(f11116,definition,
( spl0_213
<=> neq(nil,cons(hd(sk4),nil)) ),
introduced(definition,[new_symbols(definition,[spl0_213])],[avatar_definition]) ).
fof(f11118,plain,
( neq(nil,cons(hd(sk4),nil))
| ~ spl0_213 ),
inference(avatar_component_clause,[],[f11116]) ).
fof(f11119,plain,
( ~ spl0_212
| spl0_71
| spl0_213
| spl0_2
| ~ spl0_16
| spl0_19
| spl0_20 ),
inference(avatar_split_clause,[],[f11110,f1088,f1084,f757,f434,f11116,f5398,f11112]) ).
fof(f11179,plain,
( ssList(nil)
| ssItem(hd(sk4))
| ~ spl0_71 ),
inference(resolution,[],[f5400,f316]) ).
fof(f11180,plain,
( ssItem(hd(sk4))
| spl0_2
| ~ spl0_71 ),
inference(forward_subsumption_resolution,[],[f11179,f435]) ).
fof(f11181,plain,
( $false
| spl0_2
| spl0_20
| ~ spl0_71 ),
inference(forward_subsumption_resolution,[],[f11180,f1089]) ).
fof(f11182,plain,
( spl0_2
| spl0_20
| ~ spl0_71 ),
inference(avatar_contradiction_clause,[],[f11181]) ).
fof(f11429,plain,
( ssItem(hd(sk4))
| ~ spl0_4
| spl0_212 ),
inference(resolution,[],[f11114,f444]) ).
fof(f11436,plain,
( $false
| ~ spl0_4
| spl0_20
| spl0_212 ),
inference(forward_subsumption_resolution,[],[f11429,f1089]) ).
fof(f11437,plain,
( ~ spl0_4
| spl0_20
| spl0_212 ),
inference(avatar_contradiction_clause,[],[f11436]) ).
fof(f11875,plain,
( ! [X0] :
( ssList(X0)
| ssList(X0)
| ssList(sk4) )
| ~ spl0_17
| ~ spl0_45 ),
inference(resolution,[],[f10698,f315]) ).
fof(f11881,plain,
( ! [X0] :
( ssList(X0)
| ssList(sk4) )
| ~ spl0_17
| ~ spl0_45 ),
inference(duplicate_literal_removal,[],[f11875]) ).
fof(f11889,plain,
( ! [X0] : ssList(X0)
| ~ spl0_17
| ~ spl0_45 ),
inference(forward_subsumption_resolution,[],[f11881,f417]) ).
fof(f11896,plain,
( spl0_44
| ~ spl0_17
| ~ spl0_45 ),
inference(avatar_split_clause,[],[f11889,f2056,f810,f2053]) ).
fof(f11910,plain,
( ! [X0,X1] :
( nil != cons(X0,X1)
| ssList(X1) )
| ~ spl0_8 ),
inference(backward_subsumption_resolution,[],[f328,f463]) ).
fof(f12156,plain,
( ssList(nil)
| ssList(cons(hd(sk4),nil))
| nil = cons(hd(sk4),nil)
| ~ spl0_213 ),
inference(resolution,[],[f11118,f330]) ).
fof(f12157,plain,
( ssList(cons(hd(sk4),nil))
| nil = cons(hd(sk4),nil)
| spl0_2
| ~ spl0_213 ),
inference(forward_subsumption_resolution,[],[f12156,f435]) ).
fof(f12158,plain,
( nil = cons(hd(sk4),nil)
| spl0_2
| spl0_71
| ~ spl0_213 ),
inference(forward_subsumption_resolution,[],[f12157,f5399]) ).
fof(f12159,plain,
( spl0_70
| spl0_2
| spl0_71
| ~ spl0_213 ),
inference(avatar_split_clause,[],[f12158,f11116,f5398,f434,f5394]) ).
fof(f12205,plain,
( nil != nil
| ssList(nil)
| ~ spl0_8
| ~ spl0_70 ),
inference(superposition,[],[f11910,f5396]) ).
fof(f12209,plain,
( ssList(nil)
| ~ spl0_8
| ~ spl0_70 ),
inference(trivial_inequality_removal,[],[f12205]) ).
fof(f12212,plain,
( $false
| spl0_2
| ~ spl0_8
| ~ spl0_70 ),
inference(forward_subsumption_resolution,[],[f12209,f435]) ).
fof(f12213,plain,
( spl0_2
| ~ spl0_8
| ~ spl0_70 ),
inference(avatar_contradiction_clause,[],[f12212]) ).
fof(f12219,plain,
( spl0_44
| spl0_45
| ~ spl0_9 ),
inference(avatar_split_clause,[],[f2047,f465,f2056,f2053]) ).
fof(f12227,plain,
( $false
| spl0_2
| ~ spl0_15 ),
inference(forward_subsumption_resolution,[],[f828,f700]) ).
fof(f12228,plain,
( spl0_2
| ~ spl0_15 ),
inference(avatar_contradiction_clause,[],[f12227]) ).
fof(f12237,plain,
( spl0_15
| spl0_17 ),
inference(avatar_split_clause,[],[f2905,f810,f753]) ).
cnf(s7,plain,
( spl0_8
| spl0_9 ),
inference(sat_conversion,[],[f467]) ).
cnf(s9,plain,
spl0_4,
inference(sat_conversion,[],[f469]) ).
cnf(s10,plain,
~ spl0_2,
inference(sat_conversion,[],[f470]) ).
cnf(s14,plain,
( spl0_15
| spl0_16 ),
inference(sat_conversion,[],[f760]) ).
cnf(s23,plain,
( spl0_15
| ~ spl0_20 ),
inference(sat_conversion,[],[f1170]) ).
cnf(s34,plain,
( spl0_15
| ~ spl0_19 ),
inference(sat_conversion,[],[f1896]) ).
cnf(s77,plain,
~ spl0_44,
inference(sat_conversion,[],[f2900]) ).
cnf(s267,plain,
( spl0_2
| ~ spl0_16
| spl0_19
| spl0_20
| spl0_71
| ~ spl0_212
| spl0_213 ),
inference(sat_conversion,[],[f11119]) ).
cnf(s268,plain,
( spl0_2
| spl0_20
| ~ spl0_71 ),
inference(sat_conversion,[],[f11182]) ).
cnf(s270,plain,
( ~ spl0_4
| spl0_20
| spl0_212 ),
inference(sat_conversion,[],[f11437]) ).
cnf(s285,plain,
( ~ spl0_17
| spl0_44
| ~ spl0_45 ),
inference(sat_conversion,[],[f11896]) ).
cnf(s287,plain,
( spl0_2
| spl0_70
| spl0_71
| ~ spl0_213 ),
inference(sat_conversion,[],[f12159]) ).
cnf(s290,plain,
( spl0_2
| ~ spl0_8
| ~ spl0_70 ),
inference(sat_conversion,[],[f12213]) ).
cnf(s291,plain,
( ~ spl0_9
| spl0_44
| spl0_45 ),
inference(sat_conversion,[],[f12219]) ).
cnf(s293,plain,
( spl0_2
| ~ spl0_15 ),
inference(sat_conversion,[],[f12228]) ).
cnf(s297,plain,
( spl0_15
| spl0_17 ),
inference(sat_conversion,[],[f12237]) ).
cnf(s337,plain,
~ spl0_15,
inference(rat,[],[s293,s10]) ).
cnf(s350,plain,
spl0_17,
inference(rat,[],[s297,s337]) ).
cnf(s353,plain,
~ spl0_19,
inference(rat,[],[s34,s337]) ).
cnf(s354,plain,
~ spl0_20,
inference(rat,[],[s23,s337]) ).
cnf(s356,plain,
spl0_16,
inference(rat,[],[s14,s337]) ).
cnf(s379,plain,
~ spl0_45,
inference(rat,[],[s285,s77,s350]) ).
cnf(s396,plain,
~ spl0_71,
inference(rat,[],[s268,s10,s354]) ).
cnf(s407,plain,
~ spl0_9,
inference(rat,[],[s291,s77,s379]) ).
cnf(s428,plain,
spl0_212,
inference(rat,[],[s270,s354,s9]) ).
cnf(s430,plain,
spl0_213,
inference(rat,[],[s267,s396,s356,s353,s354,s10,s428]) ).
cnf(s432,plain,
spl0_70,
inference(rat,[],[s287,s396,s10,s430]) ).
cnf(s434,plain,
~ spl0_8,
inference(rat,[],[s290,s10,s432]) ).
cnf(s435,plain,
$false,
inference(rat,[],[s7,s407,s434]) ).
fof(f12318,plain,
$false,
inference(avatar_sat_refutation,[],[s435]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC214-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.39 % Computer : n016.cluster.edu
% 0.10/0.39 % Model : x86_64 x86_64
% 0.10/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.39 % Memory : 8046.5625MB
% 0.10/0.39 % OS : Linux 6.8.0-71-generic
% 0.10/0.39 % CPULimit : 300
% 0.10/0.39 % WCLimit : 300
% 0.10/0.39 % DateTime : Mon Sep 28 08:36:38 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.42 Running first-order model finding
% 0.10/0.43 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
% 1.54/0.74 % (3476912)Will run a generic schedule for satisfiability detection.
% 1.54/0.74 % (3476922)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4066305063:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.54/0.74 % (3476918)% WARNING: option uhcvi not known.
% 1.54/0.74 % (3476917)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2098079203_2999 on theBenchmark for (2999ds/0Mi)
% 1.54/0.74 % (3476918)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=940137050:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.54/0.74 % (3476919)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1045851586:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.54/0.74 % (3476920)dis+10_1_sil=32000:sp=arity:random_seed=216371662:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.54/0.74 % (3476921)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2618255030:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.54/0.74 % (3476923)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2171380723:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.54/0.74 % TRYING [1]
% 1.54/0.74 % TRYING [2]
% 1.54/0.74 % TRYING [3]
% 1.54/0.74 % (3476922)Instruction limit reached!
% 1.54/0.74 % (3476922)------------------------------
% 1.54/0.74 % (3476922)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.54/0.74 % (3476922)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.54/0.74 % (3476922)CaDiCaL version: 2.1.3
% 1.54/0.74 % (3476922)Termination reason: Instruction limit
% 1.54/0.74 % (3476922)Termination phase: Saturation
% 1.54/0.74 % (3476922)Time elapsed: 0.037 s
% 1.54/0.74 % (3476922)Peak memory usage: 14 MB
% 1.54/0.74 % (3476922)Instructions burned: 132 (million)
% 1.54/0.74 % TRYING [4]
% 1.54/0.74 % (3476931)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2570765628:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.54/0.74 % TRYING [1]
% 1.54/0.74 % TRYING [2]
% 1.54/0.74 % TRYING [3]
% 1.54/0.74 % (3476920)Instruction limit reached!
% 1.54/0.74 % (3476920)------------------------------
% 1.54/0.74 % (3476920)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.54/0.74 % (3476920)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.54/0.74 % (3476920)CaDiCaL version: 2.1.3
% 1.54/0.74 % (3476920)Termination reason: Instruction limit
% 1.54/0.74 % (3476920)Termination phase: Saturation
% 1.54/0.74 % (3476920)Time elapsed: 0.060 s
% 1.54/0.74 % (3476920)Peak memory usage: 13 MB
% 1.54/0.74 % (3476920)Instructions burned: 104 (million)
% 1.54/0.74 % (3476921)Instruction limit reached!
% 1.54/0.74 % (3476921)------------------------------
% 1.54/0.74 % (3476921)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.54/0.74 % (3476921)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.54/0.74 % (3476921)CaDiCaL version: 2.1.3
% 1.54/0.74 % (3476921)Termination reason: Instruction limit
% 1.54/0.74 % (3476921)Termination phase: Saturation
% 1.54/0.74 % (3476921)Time elapsed: 0.061 s
% 1.54/0.74 % (3476921)Peak memory usage: 13 MB
% 1.54/0.74 % (3476921)Instructions burned: 117 (million)
% 1.54/0.74 % TRYING [4]
% 1.54/0.74 % (3476933)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1141519807:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.54/0.74 % (3476934)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=1443860922:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.54/0.74 % (3476923)Instruction limit reached!
% 1.54/0.74 % (3476923)------------------------------
% 1.54/0.74 % (3476923)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.54/0.74 % (3476923)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.54/0.74 % (3476923)CaDiCaL version: 2.1.3
% 1.54/0.74 % (3476923)Termination reason: Instruction limit
% 1.54/0.74 % (3476923)Termination phase: Saturation
% 1.54/0.74 % (3476923)Time elapsed: 0.095 s
% 1.54/0.74 % (3476923)Peak memory usage: 14 MB
% 1.54/0.74 % (3476923)Instructions burned: 160 (million)
% 1.54/0.74 % TRYING [5]
% 1.54/0.74 % TRYING [5]
% 1.54/0.74 % (3476937)ott-21_1_sil=16000:fs=off:random_seed=3671474945:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.54/0.74 % (3476933)Instruction limit reached!
% 1.54/0.74 % (3476933)------------------------------
% 1.54/0.74 % (3476933)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.54/0.74 % (3476933)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.54/0.74 % (3476933)CaDiCaL version: 2.1.3
% 1.54/0.74 % (3476933)Termination reason: Instruction limit
% 1.54/0.74 % (3476933)Termination phase: Saturation
% 1.54/0.74 % (3476933)Time elapsed: 0.067 s
% 1.54/0.74 % (3476933)Peak memory usage: 13 MB
% 1.54/0.74 % (3476933)Instructions burned: 131 (million)
% 1.54/0.74 % (3476939)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3269502763:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 1.54/0.74 % TRYING [6]
% 1.54/0.74 % (3476931)Instruction limit reached!
% 1.54/0.74 % (3476931)------------------------------
% 1.54/0.74 % (3476931)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.54/0.74 % (3476931)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.54/0.74 % (3476931)CaDiCaL version: 2.1.3
% 1.54/0.74 % (3476931)Termination reason: Instruction limit
% 1.54/0.74 % (3476931)Termination phase: Finite model building constraint generation
% 1.54/0.74 % (3476931)Time elapsed: 0.151 s
% 1.54/0.74 % (3476931)Peak memory usage: 36 MB
% 1.54/0.74 % (3476931)Instructions burned: 719 (million)
% 1.54/0.74 % (3476937)Instruction limit reached!
% 1.54/0.74 % (3476937)------------------------------
% 1.54/0.74 % (3476937)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.54/0.74 % (3476937)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.54/0.74 % (3476937)CaDiCaL version: 2.1.3
% 1.54/0.74 % (3476937)Termination reason: Instruction limit
% 1.54/0.74 % (3476937)Termination phase: Saturation
% 1.54/0.74 % (3476937)Time elapsed: 0.086 s
% 1.54/0.74 % (3476937)Peak memory usage: 13 MB
% 1.54/0.74 % (3476937)Instructions burned: 182 (million)
% 1.54/0.74 % (3476941)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2434207984:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 1.54/0.74 % TRYING [1]
% 1.54/0.74 % TRYING [2]
% 1.54/0.74 % TRYING [3]
% 1.54/0.74 % (3476942)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2271552649:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 1.54/0.74 % TRYING [4]
% 1.54/0.74 % (3476918) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3476912-3476918"...
% 1.54/0.74 % (3476918)...printing done.
% 1.54/0.74 % (3476918)Refutation found. Thanks to Tanya!
% 1.54/0.74 % SZS status Unsatisfiable for theBenchmark
% 1.54/0.74 % SZS output start Proof for theBenchmark
% See solution above
% 1.54/0.74 % (3476918)------------------------------
% 1.54/0.74 % (3476918)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.54/0.74 % (3476918)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.54/0.74 % (3476918)CaDiCaL version: 2.1.3
% 1.54/0.74 % (3476918)Termination reason: Refutation
% 1.54/0.74 % (3476918)Time elapsed: 0.253 s
% 1.54/0.74 % (3476918)Peak memory usage: 17 MB
% 1.54/0.74 % (3476918)Instructions burned: 441 (million)
% 1.54/0.74 % (3476912)Success in time 0.305 s
% 1.54/0.74 % Vampire exiting
%------------------------------------------------------------------------------