↑ Up

Vampire-SAT---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : SWC169-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 : n001.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:04:56 PM UTC 2026

% Result   : Unsatisfiable 46.92s 7.13s
% Output   : Refutation 46.92s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   53
%            Number of leaves      :   54
% Syntax   : Number of formulae    :  269 (  86 unt;   6 def)
%            Number of atoms       :  686 ( 227 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :  813 ( 396   ~; 417   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   4 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   1 prp; 0-2 aty)
%            Number of functors    :   23 (  23 usr;  15 con; 0-2 aty)
%            Number of variables   :  164 ( 164   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f8,axiom,
    ssList(nil),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).

fof(f47,axiom,
    ! [X0] : ssItem(skaf44(X0)),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause47) ).

fof(f51,axiom,
    ! [X0,X1] : ssList(skaf45(X0,X1)),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause51) ).

fof(f52,axiom,
    ! [X0,X1] : ssList(skaf43(X0,X1)),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause52) ).

fof(f53,axiom,
    ! [X0,X1] : ssList(skaf42(X0,X1)),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause53) ).

fof(f71,axiom,
    ! [X0] :
      ( ~ memberP(nil,X0)
      | ~ ssItem(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause71) ).

fof(f72,axiom,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | duplicatefreeP(X0)
      | ssItem(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).

fof(f73,axiom,
    ! [X0] :
      ( ~ ssList(X0)
      | app(X0,nil) = X0 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).

fof(f74,axiom,
    ! [X0] :
      ( ~ ssList(X0)
      | app(nil,X0) = X0 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).

fof(f77,axiom,
    ! [X0] :
      ( ssList(tl(X0))
      | ~ ssList(X0)
      | nil = X0 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause77) ).

fof(f85,axiom,
    ! [X0,X1] :
      ( ssList(app(X1,X0))
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).

fof(f86,axiom,
    ! [X0,X1] :
      ( ssList(cons(X0,X1))
      | ~ ssList(X1)
      | ~ ssItem(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).

fof(f96,axiom,
    ! [X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | tl(cons(X0,X1)) = X1 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause96) ).

fof(f97,axiom,
    ! [X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | hd(cons(X0,X1)) = X0 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause97) ).

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(f103,axiom,
    ! [X0] :
      ( ~ singletonP(X0)
      | ~ ssList(X0)
      | cons(skaf44(X0),nil) = X0 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause101) ).

fof(f104,axiom,
    ! [X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssItem(X1)
      | neq(X1,X0)
      | X1 = X0 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause102) ).

fof(f105,plain,
    ! [X0,X1] :
      ( neq(X1,X0)
      | ~ ssItem(X1)
      | ~ ssItem(X0)
      | X0 = X1 ),
    inference(reorient_equations,[],[f104]) ).

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(f119,axiom,
    ! [X0,X1] :
      ( cons(X0,nil) != X1
      | ~ ssItem(X0)
      | ~ ssList(X1)
      | singletonP(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause116) ).

fof(f121,axiom,
    ! [X0,X1] :
      ( app(X0,X1) != nil
      | ~ ssList(X1)
      | ~ ssList(X0)
      | nil = X0 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).

fof(f122,plain,
    ! [X0,X1] :
      ( nil != app(X0,X1)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | nil = X0 ),
    inference(reorient_equations,[],[f121]) ).

fof(f123,axiom,
    ! [X0,X1] :
      ( app(X0,X1) != nil
      | ~ ssList(X1)
      | ~ ssList(X0)
      | nil = X1 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause119) ).

fof(f124,plain,
    ! [X0,X1] :
      ( nil != app(X0,X1)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | nil = X1 ),
    inference(reorient_equations,[],[f123]) ).

fof(f125,axiom,
    ! [X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | app(cons(X0,nil),X1) = cons(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).

fof(f126,plain,
    ! [X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | cons(X0,X1) = app(cons(X0,nil),X1) ),
    inference(reorient_equations,[],[f125]) ).

fof(f129,axiom,
    ! [X0,X1] :
      ( ~ ssList(X1)
      | ~ ssList(X0)
      | nil = X1
      | hd(app(X1,X0)) = hd(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause123) ).

fof(f134,axiom,
    ! [X0,X1] :
      ( ~ segmentP(X0,X1)
      | ~ segmentP(X1,X0)
      | ~ ssList(X0)
      | ~ ssList(X1)
      | X1 = X0 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause127) ).

fof(f135,plain,
    ! [X0,X1] :
      ( ~ segmentP(X1,X0)
      | ~ segmentP(X0,X1)
      | ~ ssList(X0)
      | ~ ssList(X1)
      | X0 = X1 ),
    inference(reorient_equations,[],[f134]) ).

fof(f143,axiom,
    ! [X0,X1] :
      ( ~ frontsegP(X0,X1)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | app(X1,skaf45(X0,X1)) = X0 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause132) ).

fof(f148,axiom,
    ! [X2,X0,X1] :
      ( frontsegP(app(X0,X2),X1)
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ frontsegP(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause137) ).

fof(f151,axiom,
    ! [X2,X0,X1] :
      ( memberP(app(X0,X2),X1)
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ ssItem(X1)
      | ~ memberP(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause140) ).

fof(f155,axiom,
    ! [X2,X0,X1] :
      ( app(X0,X1) != X2
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ ssList(X2)
      | frontsegP(X2,X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause144) ).

fof(f162,axiom,
    ! [X2,X0,X1] :
      ( app(X0,X1) != app(X0,X2)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ ssList(X2)
      | X1 = X2 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause150) ).

fof(f163,axiom,
    ! [X2,X0,X1] :
      ( app(X0,X1) != app(X2,X1)
      | ~ ssList(X0)
      | ~ ssList(X1)
      | ~ ssList(X2)
      | X0 = X2 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause151) ).

fof(f173,axiom,
    ! [X2,X0,X1] :
      ( ~ memberP(cons(X0,X1),X2)
      | ~ ssList(X1)
      | ~ ssItem(X0)
      | ~ ssItem(X2)
      | memberP(X1,X2)
      | X2 = X0 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause161) ).

fof(f174,plain,
    ! [X2,X0,X1] :
      ( ~ memberP(cons(X0,X1),X2)
      | ~ ssList(X1)
      | ~ ssItem(X0)
      | ~ ssItem(X2)
      | memberP(X1,X2)
      | X0 = X2 ),
    inference(reorient_equations,[],[f173]) ).

fof(f182,axiom,
    ! [X0,X1] :
      ( ~ memberP(X0,X1)
      | ~ ssItem(X1)
      | ~ ssList(X0)
      | app(skaf42(X0,X1),cons(X1,skaf43(X1,X0))) = X0 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause169) ).

fof(f183,axiom,
    ! [X2,X3,X0,X1] :
      ( cons(X0,X1) != cons(X2,X3)
      | ~ ssItem(X2)
      | ~ ssItem(X0)
      | ~ ssList(X3)
      | ~ ssList(X1)
      | X0 = X2 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause170) ).

fof(f187,axiom,
    ! [X2,X3,X0,X1] :
      ( app(app(X0,X1),X2) != X3
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ ssList(X1)
      | ~ ssList(X3)
      | segmentP(X3,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause173) ).

fof(f189,axiom,
    ! [X2,X3,X0,X1] :
      ( app(X0,cons(X1,X2)) != X3
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ ssItem(X1)
      | ~ ssList(X3)
      | memberP(X3,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause175) ).

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(f202,negated_conjecture,
    ssList(sk3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).

fof(f203,negated_conjecture,
    ssList(sk4),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4) ).

fof(f205,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).

fof(f206,negated_conjecture,
    ssItem(sk5),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

fof(f207,negated_conjecture,
    ssItem(sk6),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

fof(f208,negated_conjecture,
    ssList(sk7),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).

fof(f209,negated_conjecture,
    ssList(sk8),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).

fof(f210,negated_conjecture,
    app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).

fof(f211,plain,
    sk1 = app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8),
    inference(reorient_equations,[],[f210]) ).

fof(f212,negated_conjecture,
    ~ neq(sk5,sk6),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).

fof(f214,negated_conjecture,
    ( ssItem(sk9)
    | nil = sk3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).

fof(f218,negated_conjecture,
    ( cons(sk9,nil) = sk3
    | nil = sk3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).

fof(f219,plain,
    ( sk3 = cons(sk9,nil)
    | nil = sk3 ),
    inference(reorient_equations,[],[f218]) ).

fof(f220,negated_conjecture,
    ( memberP(sk4,sk9)
    | nil = sk3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).

fof(f223,plain,
    sk3 = app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8),
    inference(definition_unfolding,[],[f211,f205]) ).

fof(f231,plain,
    ! [X0] :
      ( ~ ssList(cons(X0,nil))
      | ~ ssItem(X0)
      | singletonP(cons(X0,nil)) ),
    inference(equality_resolution,[],[f119]) ).

fof(f235,plain,
    ! [X0,X1] :
      ( frontsegP(app(X0,X1),X0)
      | ~ ssList(X0)
      | ~ ssList(app(X0,X1))
      | ~ ssList(X1) ),
    inference(equality_resolution,[],[f155]) ).

fof(f238,plain,
    ! [X2,X0,X1] :
      ( segmentP(app(app(X0,X1),X2),X1)
      | ~ ssList(X0)
      | ~ ssList(X1)
      | ~ ssList(app(app(X0,X1),X2))
      | ~ ssList(X2) ),
    inference(equality_resolution,[],[f187]) ).

fof(f239,plain,
    ! [X2,X0,X1] :
      ( memberP(app(X0,cons(X1,X2)),X1)
      | ~ ssList(X0)
      | ~ ssItem(X1)
      | ~ ssList(app(X0,cons(X1,X2)))
      | ~ ssList(X2) ),
    inference(equality_resolution,[],[f189]) ).

fof(f241,plain,
    ! [X2,X3,X0,X1] :
      ( ~ ssList(app(app(X0,cons(X1,X2)),cons(X1,X3)))
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ ssItem(X1)
      | ~ duplicatefreeP(app(app(X0,cons(X1,X2)),cons(X1,X3)))
      | ~ ssList(X3) ),
    inference(equality_resolution,[],[f193]) ).

fof(f248,definition,
    sF0 = cons(sk5,nil),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

fof(f249,plain,
    cons(sk5,nil) = sF0,
    inference(reorient_equations,[],[f248]) ).

fof(f250,definition,
    sF1 = app(sk7,sF0),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f251,plain,
    app(sk7,sF0) = sF1,
    inference(reorient_equations,[],[f250]) ).

fof(f252,definition,
    sF2 = cons(sk6,nil),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

fof(f253,plain,
    cons(sk6,nil) = sF2,
    inference(reorient_equations,[],[f252]) ).

fof(f254,definition,
    sF3 = app(sF1,sF2),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f255,plain,
    app(sF1,sF2) = sF3,
    inference(reorient_equations,[],[f254]) ).

fof(f256,definition,
    sF4 = app(sF3,sk8),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

fof(f257,plain,
    app(sF3,sk8) = sF4,
    inference(reorient_equations,[],[f256]) ).

fof(f258,plain,
    sk3 = sF4,
    inference(definition_folding,[],[f223,f257,f255,f253,f251,f249]) ).

fof(f259,definition,
    sF5 = cons(sk9,nil),
    introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).

fof(f260,plain,
    cons(sk9,nil) = sF5,
    inference(reorient_equations,[],[f259]) ).

fof(f262,plain,
    ( sk3 = sF5
    | nil = sk3 ),
    inference(definition_folding,[],[f219,f260]) ).

fof(f269,plain,
    sk3 = app(sF3,sk8),
    inference(forward_demodulation,[],[f257,f258]) ).

fof(f367,plain,
    sk7 = app(sk7,nil),
    inference(resolution,[],[f73,f208]) ).

fof(f425,plain,
    ! [X2,X0,X1] :
      ( ~ ssList(X1)
      | ~ ssList(X0)
      | duplicatefreeP(app(X0,X1))
      | ssItem(X2) ),
    inference(resolution,[],[f85,f72]) ).

fof(f427,plain,
    ( ssList(sF1)
    | ~ ssList(sk7)
    | ~ ssList(sF0) ),
    inference(superposition,[],[f85,f251]) ).

fof(f429,plain,
    ( ~ ssList(sF0)
    | ssList(sF1) ),
    inference(forward_subsumption_resolution,[],[f427,f208]) ).

fof(f433,plain,
    ( ssList(sF0)
    | ~ ssList(nil)
    | ~ ssItem(sk5) ),
    inference(superposition,[],[f86,f249]) ).

fof(f434,plain,
    ( ssList(sF2)
    | ~ ssList(nil)
    | ~ ssItem(sk6) ),
    inference(superposition,[],[f86,f253]) ).

fof(f435,plain,
    ( ssList(sF5)
    | ~ ssList(nil)
    | ~ ssItem(sk9) ),
    inference(superposition,[],[f86,f260]) ).

fof(f436,plain,
    ( ~ ssItem(sk9)
    | ssList(sF5) ),
    inference(forward_subsumption_resolution,[],[f435,f8]) ).

fof(f437,plain,
    ( ssList(sF2)
    | ~ ssItem(sk6) ),
    inference(forward_subsumption_resolution,[],[f434,f8]) ).

fof(f438,plain,
    ( ssList(sF0)
    | ~ ssItem(sk5) ),
    inference(forward_subsumption_resolution,[],[f433,f8]) ).

fof(f439,plain,
    ssList(sF2),
    inference(forward_subsumption_resolution,[],[f437,f207]) ).

fof(f440,plain,
    ssList(sF0),
    inference(forward_subsumption_resolution,[],[f438,f206]) ).

fof(f453,plain,
    ssList(sF1),
    inference(resolution,[],[f429,f440]) ).

fof(f454,plain,
    sF1 = app(nil,sF1),
    inference(resolution,[],[f453,f74]) ).

fof(f455,plain,
    sF1 = app(sF1,nil),
    inference(resolution,[],[f453,f73]) ).

fof(f463,plain,
    ( nil != sF0
    | ~ ssItem(sk5)
    | ~ ssList(nil) ),
    inference(superposition,[],[f99,f249]) ).

fof(f468,plain,
    ( nil != sF0
    | ~ ssList(nil) ),
    inference(forward_subsumption_resolution,[],[f463,f206]) ).

fof(f470,plain,
    nil != sF0,
    inference(forward_subsumption_resolution,[],[f468,f8]) ).

fof(f505,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | tl(cons(sk5,X0)) = X0 ),
    inference(resolution,[],[f96,f206]) ).

fof(f507,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | tl(cons(sk9,X0)) = X0
      | nil = sk3 ),
    inference(resolution,[],[f96,f214]) ).

fof(f530,plain,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | skaf44(X1) = hd(cons(skaf44(X1),X0)) ),
    inference(resolution,[],[f97,f47]) ).

fof(f544,plain,
    ( ~ ssItem(sk5)
    | ~ ssItem(sk6)
    | sk5 = sk6 ),
    inference(resolution,[],[f105,f212]) ).

fof(f549,plain,
    ( ~ ssItem(sk6)
    | sk5 = sk6 ),
    inference(forward_subsumption_resolution,[],[f544,f206]) ).

fof(f550,plain,
    sk5 = sk6,
    inference(forward_subsumption_resolution,[],[f549,f207]) ).

fof(f552,plain,
    cons(sk5,nil) = sF2,
    inference(superposition,[],[f253,f550]) ).

fof(f555,plain,
    sF0 = sF2,
    inference(forward_demodulation,[],[f552,f249]) ).

fof(f560,plain,
    sF3 = app(sF1,sF0),
    inference(superposition,[],[f255,f555]) ).

fof(f592,plain,
    ( ~ ssList(sF5)
    | ~ ssItem(sk9)
    | singletonP(sF5) ),
    inference(superposition,[],[f231,f260]) ).

fof(f594,plain,
    ( ~ ssItem(sk9)
    | singletonP(sF5) ),
    inference(forward_subsumption_resolution,[],[f592,f436]) ).

fof(f633,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | nil = tl(X0)
      | tl(X0) = cons(hd(tl(X0)),tl(tl(X0)))
      | nil = X0 ),
    inference(resolution,[],[f107,f77]) ).

fof(f688,plain,
    ( ssList(sF3)
    | ~ ssList(sF1)
    | ~ ssList(sF0) ),
    inference(superposition,[],[f85,f560]) ).

fof(f689,plain,
    ( ssList(sF3)
    | ~ ssList(sF0) ),
    inference(forward_subsumption_resolution,[],[f688,f453]) ).

fof(f690,plain,
    ssList(sF3),
    inference(forward_subsumption_resolution,[],[f689,f440]) ).

fof(f712,plain,
    sF3 = app(nil,sF3),
    inference(resolution,[],[f690,f74]) ).

fof(f722,plain,
    ( nil != sF1
    | ~ ssList(sF0)
    | ~ ssList(sk7)
    | nil = sF0 ),
    inference(superposition,[],[f124,f251]) ).

fof(f729,plain,
    ( nil != sF1
    | ~ ssList(sk7)
    | nil = sF0 ),
    inference(forward_subsumption_resolution,[],[f722,f440]) ).

fof(f733,plain,
    ( nil != sF1
    | nil = sF0 ),
    inference(forward_subsumption_resolution,[],[f729,f208]) ).

fof(f736,plain,
    nil != sF1,
    inference(forward_subsumption_resolution,[],[f733,f470]) ).

fof(f760,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | cons(sk5,X0) = app(cons(sk5,nil),X0) ),
    inference(resolution,[],[f126,f206]) ).

fof(f762,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | cons(sk9,X0) = app(cons(sk9,nil),X0)
      | nil = sk3 ),
    inference(resolution,[],[f126,f214]) ).

fof(f765,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | cons(sk9,X0) = app(sF5,X0)
      | nil = sk3 ),
    inference(forward_demodulation,[],[f762,f260]) ).

fof(f767,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | cons(sk5,X0) = app(sF0,X0) ),
    inference(forward_demodulation,[],[f760,f249]) ).

fof(f911,plain,
    ( frontsegP(sF3,sF1)
    | ~ ssList(sF1)
    | ~ ssList(sF3)
    | ~ ssList(sF0) ),
    inference(superposition,[],[f235,f560]) ).

fof(f913,plain,
    ( frontsegP(sk3,sF3)
    | ~ ssList(sF3)
    | ~ ssList(sk3)
    | ~ ssList(sk8) ),
    inference(superposition,[],[f235,f269]) ).

fof(f932,plain,
    ( frontsegP(sk3,sF3)
    | ~ ssList(sk3)
    | ~ ssList(sk8) ),
    inference(forward_subsumption_resolution,[],[f913,f690]) ).

fof(f933,plain,
    ( frontsegP(sF3,sF1)
    | ~ ssList(sF3)
    | ~ ssList(sF0) ),
    inference(forward_subsumption_resolution,[],[f911,f453]) ).

fof(f937,plain,
    ( frontsegP(sk3,sF3)
    | ~ ssList(sk8) ),
    inference(forward_subsumption_resolution,[],[f932,f202]) ).

fof(f938,plain,
    ( frontsegP(sF3,sF1)
    | ~ ssList(sF0) ),
    inference(forward_subsumption_resolution,[],[f933,f690]) ).

fof(f941,plain,
    frontsegP(sk3,sF3),
    inference(forward_subsumption_resolution,[],[f937,f209]) ).

fof(f942,plain,
    frontsegP(sF3,sF1),
    inference(forward_subsumption_resolution,[],[f938,f440]) ).

fof(f979,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | nil = sk3
      | hd(sk3) = hd(app(sk3,X0)) ),
    inference(resolution,[],[f129,f202]) ).

fof(f1022,plain,
    ( ~ ssList(sF3)
    | ~ ssList(sk3)
    | sk3 = app(sF3,skaf45(sk3,sF3)) ),
    inference(resolution,[],[f143,f941]) ).

fof(f1029,plain,
    ( ~ ssList(sk3)
    | sk3 = app(sF3,skaf45(sk3,sF3)) ),
    inference(forward_subsumption_resolution,[],[f1022,f690]) ).

fof(f1034,plain,
    sk3 = app(sF3,skaf45(sk3,sF3)),
    inference(forward_subsumption_resolution,[],[f1029,f202]) ).

fof(f1121,plain,
    ! [X0] :
      ( frontsegP(sk3,X0)
      | ~ ssList(sk8)
      | ~ ssList(X0)
      | ~ ssList(sF3)
      | ~ frontsegP(sF3,X0) ),
    inference(superposition,[],[f148,f269]) ).

fof(f1125,plain,
    ! [X0] :
      ( frontsegP(sk3,X0)
      | ~ ssList(X0)
      | ~ ssList(sF3)
      | ~ frontsegP(sF3,X0) ),
    inference(forward_subsumption_resolution,[],[f1121,f209]) ).

fof(f1139,plain,
    ! [X0] :
      ( ~ frontsegP(sF3,X0)
      | ~ ssList(X0)
      | frontsegP(sk3,X0) ),
    inference(forward_subsumption_resolution,[],[f1125,f690]) ).

fof(f1174,plain,
    ! [X0] :
      ( memberP(sk3,X0)
      | ~ ssList(sk8)
      | ~ ssList(sF3)
      | ~ ssItem(X0)
      | ~ memberP(sF3,X0) ),
    inference(superposition,[],[f151,f269]) ).

fof(f1176,plain,
    ! [X0] :
      ( memberP(sk3,X0)
      | ~ ssList(sF3)
      | ~ ssItem(X0)
      | ~ memberP(sF3,X0) ),
    inference(forward_subsumption_resolution,[],[f1174,f209]) ).

fof(f1180,plain,
    ! [X0] :
      ( ~ memberP(sF3,X0)
      | ~ ssItem(X0)
      | memberP(sk3,X0) ),
    inference(forward_subsumption_resolution,[],[f1176,f690]) ).

fof(f1441,plain,
    ! [X0] :
      ( sF1 != app(sk7,X0)
      | ~ ssList(X0)
      | ~ ssList(sk7)
      | ~ ssList(sF0)
      | sF0 = X0 ),
    inference(superposition,[],[f162,f251]) ).

fof(f1462,plain,
    ! [X0] :
      ( sF1 != app(sk7,X0)
      | ~ ssList(X0)
      | ~ ssList(sF0)
      | sF0 = X0 ),
    inference(forward_subsumption_resolution,[],[f1441,f208]) ).

fof(f1506,plain,
    ! [X0] :
      ( sF1 != app(sk7,X0)
      | ~ ssList(X0)
      | sF0 = X0 ),
    inference(forward_subsumption_resolution,[],[f1462,f440]) ).

fof(f1592,plain,
    ! [X0] :
      ( sF1 != app(X0,sF0)
      | ~ ssList(X0)
      | ~ ssList(sF0)
      | ~ ssList(sk7)
      | sk7 = X0 ),
    inference(superposition,[],[f163,f251]) ).

fof(f1613,plain,
    ! [X0] :
      ( sF1 != app(X0,sF0)
      | ~ ssList(X0)
      | ~ ssList(sk7)
      | sk7 = X0 ),
    inference(forward_subsumption_resolution,[],[f1592,f440]) ).

fof(f1657,plain,
    ! [X0] :
      ( sF1 != app(X0,sF0)
      | ~ ssList(X0)
      | sk7 = X0 ),
    inference(forward_subsumption_resolution,[],[f1613,f208]) ).

fof(f1999,plain,
    ! [X0] :
      ( ~ memberP(sF5,X0)
      | ~ ssList(nil)
      | ~ ssItem(sk9)
      | ~ ssItem(X0)
      | memberP(nil,X0)
      | sk9 = X0 ),
    inference(superposition,[],[f174,f260]) ).

fof(f2005,plain,
    ! [X0] :
      ( ~ memberP(sF5,X0)
      | ~ ssItem(sk9)
      | ~ ssItem(X0)
      | memberP(nil,X0)
      | sk9 = X0 ),
    inference(forward_subsumption_resolution,[],[f1999,f8]) ).

fof(f2010,plain,
    ! [X0] :
      ( ~ memberP(sF5,X0)
      | ~ ssItem(sk9)
      | ~ ssItem(X0)
      | sk9 = X0 ),
    inference(forward_subsumption_resolution,[],[f2005,f71]) ).

fof(f2073,plain,
    ( ~ ssItem(sk9)
    | ~ ssList(sk4)
    | sk4 = app(skaf42(sk4,sk9),cons(sk9,skaf43(sk9,sk4)))
    | nil = sk3 ),
    inference(resolution,[],[f182,f220]) ).

fof(f2090,plain,
    ( ~ ssList(sk4)
    | sk4 = app(skaf42(sk4,sk9),cons(sk9,skaf43(sk9,sk4)))
    | nil = sk3 ),
    inference(forward_subsumption_resolution,[],[f2073,f214]) ).

fof(f2101,plain,
    ( sk4 = app(skaf42(sk4,sk9),cons(sk9,skaf43(sk9,sk4)))
    | nil = sk3 ),
    inference(forward_subsumption_resolution,[],[f2090,f203]) ).

fof(f2143,plain,
    ! [X0,X1] :
      ( cons(X0,X1) != sF5
      | ~ ssItem(sk9)
      | ~ ssItem(X0)
      | ~ ssList(nil)
      | ~ ssList(X1)
      | sk9 = X0 ),
    inference(superposition,[],[f183,f260]) ).

fof(f2149,plain,
    ! [X0,X1] :
      ( cons(X0,X1) != sF5
      | ~ ssItem(sk9)
      | ~ ssItem(X0)
      | ~ ssList(X1)
      | sk9 = X0 ),
    inference(forward_subsumption_resolution,[],[f2143,f8]) ).

fof(f2244,plain,
    sk3 = tl(cons(sk5,sk3)),
    inference(resolution,[],[f505,f202]) ).

fof(f2431,plain,
    ! [X0] :
      ( segmentP(app(sF1,X0),sF1)
      | ~ ssList(nil)
      | ~ ssList(sF1)
      | ~ ssList(app(sF1,X0))
      | ~ ssList(X0) ),
    inference(superposition,[],[f238,f454]) ).

fof(f2433,plain,
    ! [X0] :
      ( segmentP(app(sF3,X0),sF3)
      | ~ ssList(nil)
      | ~ ssList(sF3)
      | ~ ssList(app(sF3,X0))
      | ~ ssList(X0) ),
    inference(superposition,[],[f238,f712]) ).

fof(f2439,plain,
    ! [X0] :
      ( segmentP(app(sF1,X0),sF0)
      | ~ ssList(sk7)
      | ~ ssList(sF0)
      | ~ ssList(app(sF1,X0))
      | ~ ssList(X0) ),
    inference(superposition,[],[f238,f251]) ).

fof(f2467,plain,
    ! [X0] :
      ( segmentP(app(sF1,X0),sF0)
      | ~ ssList(sF0)
      | ~ ssList(app(sF1,X0))
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f2439,f208]) ).

fof(f2473,plain,
    ! [X0] :
      ( segmentP(app(sF3,X0),sF3)
      | ~ ssList(nil)
      | ~ ssList(sF3)
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f2433,f85]) ).

fof(f2475,plain,
    ! [X0] :
      ( segmentP(app(sF1,X0),sF1)
      | ~ ssList(nil)
      | ~ ssList(sF1)
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f2431,f85]) ).

fof(f2493,plain,
    ! [X0] :
      ( segmentP(app(sF1,X0),sF0)
      | ~ ssList(app(sF1,X0))
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f2467,f440]) ).

fof(f2499,plain,
    ! [X0] :
      ( segmentP(app(sF3,X0),sF3)
      | ~ ssList(sF3)
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f2473,f8]) ).

fof(f2501,plain,
    ! [X0] :
      ( segmentP(app(sF1,X0),sF1)
      | ~ ssList(sF1)
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f2475,f8]) ).

fof(f2516,plain,
    ! [X0] :
      ( segmentP(app(sF3,X0),sF3)
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f2499,f690]) ).

fof(f2518,plain,
    ! [X0] :
      ( segmentP(app(sF1,X0),sF1)
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f2501,f453]) ).

fof(f2530,plain,
    ! [X0] :
      ( memberP(app(X0,sF0),sk5)
      | ~ ssList(X0)
      | ~ ssItem(sk5)
      | ~ ssList(app(X0,sF0))
      | ~ ssList(nil) ),
    inference(superposition,[],[f239,f249]) ).

fof(f2541,plain,
    ! [X0] :
      ( memberP(app(X0,sF0),sk5)
      | ~ ssList(X0)
      | ~ ssList(app(X0,sF0))
      | ~ ssList(nil) ),
    inference(forward_subsumption_resolution,[],[f2530,f206]) ).

fof(f2547,plain,
    ! [X0] :
      ( memberP(app(X0,sF0),sk5)
      | ~ ssList(X0)
      | ~ ssList(app(X0,sF0)) ),
    inference(forward_subsumption_resolution,[],[f2541,f8]) ).

fof(f2893,plain,
    ! [X0,X1] :
      ( ~ ssList(app(app(X0,cons(sk9,X1)),sF5))
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ ssItem(sk9)
      | ~ duplicatefreeP(app(app(X0,cons(sk9,X1)),sF5))
      | ~ ssList(nil) ),
    inference(superposition,[],[f241,f260]) ).

fof(f2898,plain,
    ! [X0,X1] :
      ( ~ ssList(app(app(X0,cons(sk9,X1)),sF5))
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ ssItem(sk9)
      | ~ duplicatefreeP(app(app(X0,cons(sk9,X1)),sF5)) ),
    inference(forward_subsumption_resolution,[],[f2893,f8]) ).

fof(f3465,plain,
    ( ~ ssList(sF1)
    | frontsegP(sk3,sF1) ),
    inference(resolution,[],[f1139,f942]) ).

fof(f3472,plain,
    frontsegP(sk3,sF1),
    inference(forward_subsumption_resolution,[],[f3465,f453]) ).

fof(f3492,plain,
    ( ~ ssList(sF1)
    | ~ ssList(sk3)
    | sk3 = app(sF1,skaf45(sk3,sF1)) ),
    inference(resolution,[],[f3472,f143]) ).

fof(f3495,plain,
    ( ~ ssList(sk3)
    | sk3 = app(sF1,skaf45(sk3,sF1)) ),
    inference(forward_subsumption_resolution,[],[f3492,f453]) ).

fof(f3498,plain,
    sk3 = app(sF1,skaf45(sk3,sF1)),
    inference(forward_subsumption_resolution,[],[f3495,f202]) ).

fof(f3551,plain,
    cons(sk5,sk3) = app(sF0,sk3),
    inference(resolution,[],[f767,f202]) ).

fof(f4141,plain,
    ( sk7 != sF1
    | ~ ssList(nil)
    | nil = sF0 ),
    inference(superposition,[],[f1506,f367]) ).

fof(f4145,plain,
    ( sk7 != sF1
    | nil = sF0 ),
    inference(forward_subsumption_resolution,[],[f4141,f8]) ).

fof(f4146,plain,
    sk7 != sF1,
    inference(forward_subsumption_resolution,[],[f4145,f470]) ).

fof(f4156,plain,
    ( sF1 != sF3
    | ~ ssList(sF1)
    | sk7 = sF1 ),
    inference(superposition,[],[f1657,f560]) ).

fof(f4158,plain,
    ( sF1 != sF3
    | sk7 = sF1 ),
    inference(forward_subsumption_resolution,[],[f4156,f453]) ).

fof(f4162,plain,
    sF1 != sF3,
    inference(forward_subsumption_resolution,[],[f4158,f4146]) ).

fof(f4174,plain,
    ( nil = tl(cons(sk9,nil))
    | nil = sk3 ),
    inference(resolution,[],[f507,f8]) ).

fof(f4214,plain,
    ( nil = tl(sF5)
    | nil = sk3 ),
    inference(forward_demodulation,[],[f4174,f260]) ).

fof(f4393,plain,
    ( segmentP(sF1,sF0)
    | ~ ssList(sF1)
    | ~ ssList(nil) ),
    inference(superposition,[],[f2493,f455]) ).

fof(f4403,plain,
    ( segmentP(sF1,sF0)
    | ~ ssList(nil) ),
    inference(forward_subsumption_resolution,[],[f4393,f453]) ).

fof(f4410,plain,
    segmentP(sF1,sF0),
    inference(forward_subsumption_resolution,[],[f4403,f8]) ).

fof(f4426,plain,
    ( memberP(sF3,sk5)
    | ~ ssList(sF1)
    | ~ ssList(sF3) ),
    inference(superposition,[],[f2547,f560]) ).

fof(f4429,plain,
    ( memberP(sF3,sk5)
    | ~ ssList(sF3) ),
    inference(forward_subsumption_resolution,[],[f4426,f453]) ).

fof(f4433,plain,
    memberP(sF3,sk5),
    inference(forward_subsumption_resolution,[],[f4429,f690]) ).

fof(f4478,plain,
    ( ~ segmentP(sF0,sF1)
    | ~ ssList(sF0)
    | ~ ssList(sF1)
    | sF0 = sF1 ),
    inference(resolution,[],[f4410,f135]) ).

fof(f4479,plain,
    ( ~ segmentP(sF0,sF1)
    | ~ ssList(sF1)
    | sF0 = sF1 ),
    inference(forward_subsumption_resolution,[],[f4478,f440]) ).

fof(f4482,plain,
    ( ~ segmentP(sF0,sF1)
    | sF0 = sF1 ),
    inference(forward_subsumption_resolution,[],[f4479,f453]) ).

fof(f4516,plain,
    ( cons(sk9,sk3) = app(sF5,sk3)
    | nil = sk3 ),
    inference(resolution,[],[f765,f202]) ).

fof(f4526,plain,
    ( ~ ssItem(sk5)
    | memberP(sk3,sk5) ),
    inference(resolution,[],[f4433,f1180]) ).

fof(f4529,plain,
    memberP(sk3,sk5),
    inference(forward_subsumption_resolution,[],[f4526,f206]) ).

fof(f4562,plain,
    ( hd(sk3) = hd(app(sk3,sk3))
    | nil = sk3 ),
    inference(resolution,[],[f979,f202]) ).

fof(f5693,plain,
    ( ssList(cons(sk5,sk3))
    | ~ ssList(sF0)
    | ~ ssList(sk3) ),
    inference(superposition,[],[f85,f3551]) ).

fof(f5694,plain,
    ( nil != cons(sk5,sk3)
    | ~ ssList(sk3)
    | ~ ssList(sF0)
    | nil = sF0 ),
    inference(superposition,[],[f122,f3551]) ).

fof(f5722,plain,
    ( nil != cons(sk5,sk3)
    | ~ ssList(sF0)
    | nil = sF0 ),
    inference(forward_subsumption_resolution,[],[f5694,f202]) ).

fof(f5723,plain,
    ( ssList(cons(sk5,sk3))
    | ~ ssList(sk3) ),
    inference(forward_subsumption_resolution,[],[f5693,f440]) ).

fof(f5737,plain,
    ( nil != cons(sk5,sk3)
    | nil = sF0 ),
    inference(forward_subsumption_resolution,[],[f5722,f440]) ).

fof(f5738,plain,
    ssList(cons(sk5,sk3)),
    inference(forward_subsumption_resolution,[],[f5723,f202]) ).

fof(f5739,plain,
    nil != cons(sk5,sk3),
    inference(forward_subsumption_resolution,[],[f5737,f470]) ).

fof(f7179,plain,
    ( nil = tl(sk3)
    | nil = sk3
    | nil = sk3 ),
    inference(superposition,[],[f4214,f262]) ).

fof(f7182,plain,
    ( nil = tl(sk3)
    | nil = sk3 ),
    inference(duplicate_literal_removal,[],[f7179]) ).

fof(f8442,plain,
    ( segmentP(sF3,sF1)
    | ~ ssList(sF2) ),
    inference(superposition,[],[f2518,f255]) ).

fof(f8443,plain,
    segmentP(sF3,sF1),
    inference(forward_subsumption_resolution,[],[f8442,f439]) ).

fof(f8487,plain,
    ( ~ segmentP(sF1,sF3)
    | ~ ssList(sF1)
    | ~ ssList(sF3)
    | sF1 = sF3 ),
    inference(resolution,[],[f8443,f135]) ).

fof(f8488,plain,
    ( ~ segmentP(sF1,sF3)
    | ~ ssList(sF3)
    | sF1 = sF3 ),
    inference(forward_subsumption_resolution,[],[f8487,f453]) ).

fof(f8491,plain,
    ( ~ segmentP(sF1,sF3)
    | sF1 = sF3 ),
    inference(forward_subsumption_resolution,[],[f8488,f690]) ).

fof(f8494,plain,
    ~ segmentP(sF1,sF3),
    inference(forward_subsumption_resolution,[],[f8491,f4162]) ).

fof(f9002,plain,
    ( segmentP(sk3,sF3)
    | ~ ssList(skaf45(sk3,sF3)) ),
    inference(superposition,[],[f2516,f1034]) ).

fof(f9003,plain,
    segmentP(sk3,sF3),
    inference(forward_subsumption_resolution,[],[f9002,f51]) ).

fof(f11019,plain,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | duplicatefreeP(app(X0,sk3))
      | ssItem(X1) ),
    inference(resolution,[],[f425,f202]) ).

fof(f11842,plain,
    ! [X0] : skaf44(X0) = hd(cons(skaf44(X0),sk3)),
    inference(resolution,[],[f530,f202]) ).

fof(f22400,plain,
    ( segmentP(sk3,sF1)
    | ~ ssList(skaf45(sk3,sF1)) ),
    inference(superposition,[],[f2518,f3498]) ).

fof(f22405,plain,
    ( nil != sk3
    | ~ ssList(skaf45(sk3,sF1))
    | ~ ssList(sF1)
    | nil = sF1 ),
    inference(superposition,[],[f122,f3498]) ).

fof(f22439,plain,
    ( nil != sk3
    | ~ ssList(sF1)
    | nil = sF1 ),
    inference(forward_subsumption_resolution,[],[f22405,f51]) ).

fof(f22442,plain,
    segmentP(sk3,sF1),
    inference(forward_subsumption_resolution,[],[f22400,f51]) ).

fof(f22458,plain,
    ( nil != sk3
    | nil = sF1 ),
    inference(forward_subsumption_resolution,[],[f22439,f453]) ).

fof(f22461,plain,
    nil != sk3,
    inference(forward_subsumption_resolution,[],[f22458,f736]) ).

fof(f26080,plain,
    ( nil = tl(cons(sk5,sk3))
    | tl(cons(sk5,sk3)) = cons(hd(tl(cons(sk5,sk3))),tl(tl(cons(sk5,sk3))))
    | nil = cons(sk5,sk3) ),
    inference(resolution,[],[f633,f5738]) ).

fof(f26108,plain,
    ( nil = tl(cons(sk5,sk3))
    | tl(cons(sk5,sk3)) = cons(hd(tl(cons(sk5,sk3))),tl(tl(cons(sk5,sk3)))) ),
    inference(forward_subsumption_resolution,[],[f26080,f5739]) ).

fof(f26117,plain,
    ( nil = sk3
    | tl(cons(sk5,sk3)) = cons(hd(tl(cons(sk5,sk3))),tl(tl(cons(sk5,sk3)))) ),
    inference(forward_demodulation,[],[f26108,f2244]) ).

fof(f26124,plain,
    tl(cons(sk5,sk3)) = cons(hd(tl(cons(sk5,sk3))),tl(tl(cons(sk5,sk3)))),
    inference(forward_subsumption_resolution,[],[f26117,f22461]) ).

fof(f26128,plain,
    sk3 = cons(hd(sk3),tl(sk3)),
    inference(forward_demodulation,[],[f26124,f2244]) ).

fof(f29740,plain,
    ( ~ ssList(app(sk4,sF5))
    | ~ ssList(skaf43(sk9,sk4))
    | ~ ssList(skaf42(sk4,sk9))
    | ~ ssItem(sk9)
    | ~ duplicatefreeP(app(sk4,sF5))
    | nil = sk3 ),
    inference(superposition,[],[f2898,f2101]) ).

fof(f29747,plain,
    ( ~ ssList(app(sk4,sF5))
    | ~ ssList(skaf43(sk9,sk4))
    | ~ ssList(skaf42(sk4,sk9))
    | ~ duplicatefreeP(app(sk4,sF5))
    | nil = sk3 ),
    inference(forward_subsumption_resolution,[],[f29740,f214]) ).

fof(f29752,plain,
    ( ~ ssList(app(sk4,sF5))
    | ~ ssList(skaf42(sk4,sk9))
    | ~ duplicatefreeP(app(sk4,sF5))
    | nil = sk3 ),
    inference(forward_subsumption_resolution,[],[f29747,f52]) ).

fof(f29754,plain,
    ( ~ ssList(app(sk4,sF5))
    | ~ duplicatefreeP(app(sk4,sF5))
    | nil = sk3 ),
    inference(forward_subsumption_resolution,[],[f29752,f53]) ).

fof(f29755,plain,
    ( ~ ssList(app(sk4,sF5))
    | ~ duplicatefreeP(app(sk4,sF5)) ),
    inference(forward_subsumption_resolution,[],[f29754,f22461]) ).

fof(f31522,plain,
    ! [X0] :
      ( duplicatefreeP(app(sk4,sk3))
      | ssItem(X0) ),
    inference(resolution,[],[f11019,f203]) ).

fof(f43562,plain,
    ( ~ duplicatefreeP(app(sk4,sF5))
    | ~ ssList(sk4)
    | ~ ssList(sF5) ),
    inference(resolution,[],[f29755,f85]) ).

fof(f43566,plain,
    ( ~ duplicatefreeP(app(sk4,sF5))
    | ~ ssList(sF5) ),
    inference(forward_subsumption_resolution,[],[f43562,f203]) ).

fof(f43568,plain,
    ( ~ duplicatefreeP(app(sk4,sk3))
    | ~ ssList(sk3)
    | nil = sk3 ),
    inference(superposition,[],[f43566,f262]) ).

fof(f43572,plain,
    ( ~ duplicatefreeP(app(sk4,sk3))
    | nil = sk3 ),
    inference(forward_subsumption_resolution,[],[f43568,f202]) ).

fof(f43574,plain,
    ~ duplicatefreeP(app(sk4,sk3)),
    inference(forward_subsumption_resolution,[],[f43572,f22461]) ).

fof(f43587,plain,
    ! [X0] : ssItem(X0),
    inference(resolution,[],[f43574,f31522]) ).

fof(f43751,plain,
    ssList(sF5),
    inference(resolution,[],[f43587,f436]) ).

fof(f43752,plain,
    singletonP(sF5),
    inference(resolution,[],[f43587,f594]) ).

fof(f45039,plain,
    ( ~ ssList(sF5)
    | sF5 = cons(skaf44(sF5),nil) ),
    inference(resolution,[],[f43752,f103]) ).

fof(f45042,plain,
    sF5 = cons(skaf44(sF5),nil),
    inference(forward_subsumption_resolution,[],[f45039,f43751]) ).

fof(f55152,plain,
    ( sF5 != sF5
    | ~ ssItem(sk9)
    | ~ ssItem(skaf44(sF5))
    | ~ ssList(nil)
    | sk9 = skaf44(sF5) ),
    inference(superposition,[],[f2149,f45042]) ).

fof(f55200,plain,
    ( ~ ssItem(sk9)
    | ~ ssItem(skaf44(sF5))
    | ~ ssList(nil)
    | sk9 = skaf44(sF5) ),
    inference(trivial_inequality_removal,[],[f55152]) ).

fof(f55234,plain,
    ( ~ ssItem(sk9)
    | ~ ssList(nil)
    | sk9 = skaf44(sF5) ),
    inference(forward_subsumption_resolution,[],[f55200,f43587]) ).

fof(f55298,plain,
    ( ~ ssList(nil)
    | sk9 = skaf44(sF5) ),
    inference(forward_subsumption_resolution,[],[f55234,f43587]) ).

fof(f55346,plain,
    sk9 = skaf44(sF5),
    inference(forward_subsumption_resolution,[],[f55298,f8]) ).

fof(f55448,plain,
    sk9 = hd(cons(sk9,sk3)),
    inference(superposition,[],[f11842,f55346]) ).

fof(f56132,plain,
    ( cons(sk9,sk3) = app(sk3,sk3)
    | nil = sk3
    | nil = sk3 ),
    inference(superposition,[],[f4516,f262]) ).

fof(f56176,plain,
    ( cons(sk9,sk3) = app(sk3,sk3)
    | nil = sk3 ),
    inference(duplicate_literal_removal,[],[f56132]) ).

fof(f56214,plain,
    cons(sk9,sk3) = app(sk3,sk3),
    inference(forward_subsumption_resolution,[],[f56176,f22461]) ).

fof(f60268,plain,
    ( hd(sk3) = hd(cons(sk9,sk3))
    | nil = sk3 ),
    inference(superposition,[],[f4562,f56214]) ).

fof(f60367,plain,
    hd(sk3) = hd(cons(sk9,sk3)),
    inference(forward_subsumption_resolution,[],[f60268,f22461]) ).

fof(f60372,plain,
    sk9 = hd(sk3),
    inference(forward_demodulation,[],[f60367,f55448]) ).

fof(f60376,plain,
    sk3 = cons(sk9,tl(sk3)),
    inference(superposition,[],[f26128,f60372]) ).

fof(f60569,plain,
    ( sk3 = cons(sk9,nil)
    | nil = sk3 ),
    inference(superposition,[],[f60376,f7182]) ).

fof(f60731,plain,
    sk3 = cons(sk9,nil),
    inference(forward_subsumption_resolution,[],[f60569,f22461]) ).

fof(f60848,plain,
    sk3 = sF5,
    inference(superposition,[],[f260,f60731]) ).

fof(f61536,plain,
    ! [X0] :
      ( ~ memberP(sk3,X0)
      | ~ ssItem(sk9)
      | ~ ssItem(X0)
      | sk9 = X0 ),
    inference(superposition,[],[f2010,f60848]) ).

fof(f61633,plain,
    ! [X0] :
      ( ~ memberP(sk3,X0)
      | ~ ssItem(sk9)
      | sk9 = X0 ),
    inference(forward_subsumption_resolution,[],[f61536,f43587]) ).

fof(f61634,plain,
    ! [X0] :
      ( ~ memberP(sk3,X0)
      | sk9 = X0 ),
    inference(forward_subsumption_resolution,[],[f61633,f43587]) ).

fof(f65304,plain,
    sk5 = sk9,
    inference(resolution,[],[f61634,f4529]) ).

fof(f65318,plain,
    cons(sk9,nil) = sF0,
    inference(superposition,[],[f249,f65304]) ).

fof(f65568,plain,
    sF0 = sF5,
    inference(forward_demodulation,[],[f65318,f260]) ).

fof(f65573,plain,
    sk3 = sF0,
    inference(forward_demodulation,[],[f65568,f60848]) ).

fof(f65797,plain,
    ( ~ segmentP(sk3,sF1)
    | sk3 = sF1 ),
    inference(superposition,[],[f4482,f65573]) ).

fof(f66016,plain,
    sk3 = sF1,
    inference(forward_subsumption_resolution,[],[f65797,f22442]) ).

fof(f66277,plain,
    ~ segmentP(sk3,sF3),
    inference(superposition,[],[f8494,f66016]) ).

fof(f66343,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f66277,f9003]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC169-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.37  % Computer : n001.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Mon Sep 28 08:21:18 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.14/0.39  Running first-order model finding
% 0.14/0.39  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
% 26.40/4.14  % (205919)Will run a generic schedule for satisfiability detection.
% 26.40/4.14  % (205926)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2061774510:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 26.40/4.14  % (205925)% WARNING: option uhcvi not known.
% 26.40/4.14  % (205924)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1353276249_2999 on theBenchmark for (2999ds/0Mi)
% 26.40/4.14  % (205927)dis+10_1_sil=32000:sp=arity:random_seed=1798363568:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 26.40/4.14  % (205928)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4045582025:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 26.40/4.14  % (205929)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1074692500:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 26.40/4.14  % (205930)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=514796485:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 26.40/4.14  % (205925)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=446717713:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 26.40/4.14  % TRYING [1]
% 26.40/4.14  % TRYING [2]
% 26.40/4.14  % TRYING [3]
% 26.40/4.14  % TRYING [4]
% 26.40/4.14  % (205927)Instruction limit reached! 
% 26.40/4.14  % (205927)------------------------------
% 26.40/4.14  % (205927)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 26.40/4.14  % (205927)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.40/4.14  % (205927)CaDiCaL version: 2.1.3
% 26.40/4.14  % (205927)Termination reason: Instruction limit
% 26.40/4.14  % (205927)Termination phase: Saturation
% 26.40/4.14  % (205927)Time elapsed: 0.059 s
% 26.40/4.14  % (205927)Peak memory usage: 13 MB
% 26.40/4.14  % (205927)Instructions burned: 103 (million)
% 26.40/4.14  % (205928)Instruction limit reached! 
% 26.40/4.14  % (205928)------------------------------
% 26.40/4.14  % (205928)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 26.40/4.14  % (205928)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.40/4.14  % (205928)CaDiCaL version: 2.1.3
% 26.40/4.14  % (205928)Termination reason: Instruction limit
% 26.40/4.14  % (205928)Termination phase: Saturation
% 26.40/4.14  % (205928)Time elapsed: 0.061 s
% 26.40/4.14  % (205928)Peak memory usage: 13 MB
% 26.40/4.14  % (205928)Instructions burned: 117 (million)
% 26.40/4.14  % (205929)Instruction limit reached! 
% 26.40/4.14  % (205929)------------------------------
% 26.40/4.14  % (205929)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 26.40/4.14  % (205929)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.40/4.14  % (205929)CaDiCaL version: 2.1.3
% 26.40/4.14  % (205929)Termination reason: Instruction limit
% 26.40/4.14  % (205929)Termination phase: Saturation
% 26.40/4.14  % (205929)Time elapsed: 0.065 s
% 26.40/4.14  % (205929)Peak memory usage: 14 MB
% 26.40/4.14  % (205929)Instructions burned: 132 (million)
% 26.40/4.14  % (205938)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3383569509:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 26.40/4.14  % (205939)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2290906751:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 26.40/4.14  % (205940)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=1968446391:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 26.40/4.14  % (205930)Instruction limit reached! 
% 26.40/4.14  % (205930)------------------------------
% 26.40/4.14  % (205930)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 26.40/4.14  % (205930)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.40/4.14  % (205930)CaDiCaL version: 2.1.3
% 26.40/4.14  % (205930)Termination reason: Instruction limit
% 26.40/4.14  % (205930)Termination phase: Saturation
% 26.40/4.14  % (205930)Time elapsed: 0.090 s
% 26.40/4.14  % (205930)Peak memory usage: 14 MB
% 26.40/4.14  % (205930)Instructions burned: 159 (million)
% 26.40/4.14  % TRYING [1]
% 26.40/4.14  % TRYING [2]
% 26.40/4.14  % TRYING [3]
% 26.40/4.14  % TRYING [5]
% 26.40/4.14  % (205944)ott-21_1_sil=16000:fs=off:random_seed=1261364399:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 26.40/4.14  % TRYING [4]
% 26.40/4.14  % (205939)Instruction limit reached! 
% 26.40/4.14  % (205939)------------------------------
% 26.40/4.14  % (205939)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 26.40/4.14  % (205939)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.92/7.13  % (205939)CaDiCaL version: 2.1.3
% 46.92/7.13  % (205939)Termination reason: Instruction limit
% 46.92/7.13  % (205939)Termination phase: Saturation
% 46.92/7.13  % (205939)Time elapsed: 0.070 s
% 46.92/7.13  % (205939)Peak memory usage: 14 MB
% 46.92/7.13  % (205939)Instructions burned: 131 (million)
% 46.92/7.13  % (205946)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3845290781:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 46.92/7.13  % TRYING [5]
% 46.92/7.13  % (205944)Instruction limit reached! 
% 46.92/7.13  % (205944)------------------------------
% 46.92/7.13  % (205944)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.92/7.13  % (205944)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.92/7.13  % (205944)CaDiCaL version: 2.1.3
% 46.92/7.13  % (205944)Termination reason: Instruction limit
% 46.92/7.13  % (205944)Termination phase: Saturation
% 46.92/7.13  % (205944)Time elapsed: 0.088 s
% 46.92/7.13  % (205944)Peak memory usage: 13 MB
% 46.92/7.13  % (205944)Instructions burned: 181 (million)
% 46.92/7.13  % (205948)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=994850350:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 46.92/7.13  % TRYING [1]
% 46.92/7.13  % TRYING [2]
% 46.92/7.13  % TRYING [3]
% 46.92/7.13  % TRYING [6]
% 46.92/7.13  % TRYING [4]
% 46.92/7.13  % TRYING [6]
% 46.92/7.13  % (205938)Instruction limit reached! 
% 46.92/7.13  % (205938)------------------------------
% 46.92/7.13  % (205938)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.92/7.13  % (205938)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.92/7.13  % (205938)CaDiCaL version: 2.1.3
% 46.92/7.13  % (205938)Termination reason: Instruction limit
% 46.92/7.13  % (205938)Termination phase: Finite model building constraint generation
% 46.92/7.13  % (205938)Time elapsed: 0.280 s
% 46.92/7.13  % (205938)Peak memory usage: 34 MB
% 46.92/7.13  % (205938)Instructions burned: 718 (million)
% 46.92/7.13  % (205950)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3095749478:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 46.92/7.13  % TRYING [5]
% 46.92/7.13  % (205940)Instruction limit reached! 
% 46.92/7.13  % (205940)------------------------------
% 46.92/7.13  % (205940)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.92/7.13  % (205940)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.92/7.13  % (205940)CaDiCaL version: 2.1.3
% 46.92/7.13  % (205940)Termination reason: Instruction limit
% 46.92/7.13  % (205940)Termination phase: Saturation
% 46.92/7.13  % (205940)Time elapsed: 0.386 s
% 46.92/7.13  % (205940)Peak memory usage: 21 MB
% 46.92/7.13  % (205940)Instructions burned: 686 (million)
% 46.92/7.13  % (205946)Instruction limit reached! 
% 46.92/7.13  % (205946)------------------------------
% 46.92/7.13  % (205946)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.92/7.13  % (205946)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.92/7.13  % (205946)CaDiCaL version: 2.1.3
% 46.92/7.13  % (205946)Termination reason: Instruction limit
% 46.92/7.13  % (205946)Termination phase: Saturation
% 46.92/7.13  % (205946)Time elapsed: 0.317 s
% 46.92/7.13  % (205946)Peak memory usage: 15 MB
% 46.92/7.13  % (205946)Instructions burned: 478 (million)
% 46.92/7.13  % (205952)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=2316286326:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 46.92/7.13  % (205953)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=1632377165:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2994 on theBenchmark for (2994ds/692Mi)
% 46.92/7.13  % (205948)Instruction limit reached! 
% 46.92/7.13  % (205948)------------------------------
% 46.92/7.13  % (205948)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.92/7.13  % (205948)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.92/7.13  % (205948)CaDiCaL version: 2.1.3
% 46.92/7.13  % (205948)Termination reason: Instruction limit
% 46.92/7.13  % (205948)Termination phase: Finite model building SAT solving
% 46.92/7.13  % (205948)Time elapsed: 0.338 s
% 46.92/7.13  % (205948)Peak memory usage: 22 MB
% 46.92/7.13  % (205948)Instructions burned: 867 (million)
% 46.92/7.13  % (205956)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1740286710:i=879:kws=inv_precedence:fsr=off_2993 on theBenchmark for (2993ds/879Mi)
% 46.92/7.13  % TRYING [14]
% 46.92/7.13  % TRYING [7]
% 46.92/7.13  % (205952)Instruction limit reached! 
% 46.92/7.13  % (205952)------------------------------
% 46.92/7.13  % (205952)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.92/7.13  % (205952)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.92/7.13  % (205952)CaDiCaL version: 2.1.3
% 46.92/7.13  % (205952)Termination reason: Instruction limit
% 46.92/7.13  % (205952)Termination phase: Finite model building constraint generation
% 46.92/7.13  % (205952)Time elapsed: 0.324 s
% 46.92/7.13  % (205952)Peak memory usage: 72 MB
% 46.92/7.13  % (205952)Instructions burned: 890 (million)
% 46.92/7.13  % (205958)fmb+10_1_sil=64000:random_seed=1351363815:i=22061:nm=2:gsp=on_2991 on theBenchmark for (2991ds/22061Mi)
% 46.92/7.13  % TRYING [1]
% 46.92/7.13  % TRYING [2]
% 46.92/7.13  % (205953)Instruction limit reached! 
% 46.92/7.13  % (205953)------------------------------
% 46.92/7.13  % (205953)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.92/7.13  % (205953)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.92/7.13  % (205953)CaDiCaL version: 2.1.3
% 46.92/7.13  % (205953)Termination reason: Instruction limit
% 46.92/7.13  % (205953)Termination phase: Saturation
% 46.92/7.13  % (205953)Time elapsed: 0.358 s
% 46.92/7.13  % (205953)Peak memory usage: 18 MB
% 46.92/7.13  % (205953)Instructions burned: 692 (million)
% 46.92/7.13  % TRYING [3]
% 46.92/7.13  % (205960)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=1118348486:i=9515:nm=5_2990 on theBenchmark for (2990ds/9515Mi)
% 46.92/7.13  % TRYING [20]
% 46.92/7.13  % TRYING [4]
% 46.92/7.13  % (205956)Instruction limit reached! 
% 46.92/7.13  % (205956)------------------------------
% 46.92/7.13  % (205956)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.92/7.13  % (205956)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.92/7.13  % (205956)CaDiCaL version: 2.1.3
% 46.92/7.13  % (205956)Termination reason: Instruction limit
% 46.92/7.13  % (205956)Termination phase: Saturation
% 46.92/7.13  % (205956)Time elapsed: 0.465 s
% 46.92/7.13  % (205956)Peak memory usage: 20 MB
% 46.92/7.13  % (205956)Instructions burned: 881 (million)
% 46.92/7.13  % (205962)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=3565904129:fmbsr=1.7:i=920_2989 on theBenchmark for (2989ds/920Mi)
% 46.92/7.13  % (205950)Instruction limit reached! 
% 46.92/7.13  % (205950)------------------------------
% 46.92/7.13  % (205950)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.92/7.13  % (205950)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.92/7.13  % (205950)CaDiCaL version: 2.1.3
% 46.92/7.13  % (205950)Termination reason: Instruction limit
% 46.92/7.13  % (205950)Termination phase: Saturation
% 46.92/7.13  % (205950)Time elapsed: 0.684 s
% 46.92/7.13  % (205950)Peak memory usage: 27 MB
% 46.92/7.13  % (205950)Instructions burned: 1180 (million)
% 46.92/7.13  % TRYING [8]
% 46.92/7.13  % TRYING [5]
% 46.92/7.13  % (205964)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=3820906716:i=5131_2988 on theBenchmark for (2988ds/5131Mi)
% 46.92/7.13  % (205962)Instruction limit reached! 
% 46.92/7.13  % (205962)------------------------------
% 46.92/7.13  % (205962)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.92/7.13  % (205962)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.92/7.13  % (205962)CaDiCaL version: 2.1.3
% 46.92/7.13  % (205962)Termination reason: Instruction limit
% 46.92/7.13  % (205962)Termination phase: Finite model building constraint generation
% 46.92/7.13  % (205962)Time elapsed: 0.332 s
% 46.92/7.13  % (205962)Peak memory usage: 79 MB
% 46.92/7.13  % (205962)Instructions burned: 921 (million)
% 46.92/7.13  % (205966)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=1238808595:i=1472:ins=7:fdi=8:gsp=on_2985 on theBenchmark for (2985ds/1472Mi)
% 46.92/7.13  % TRYING [6]
% 46.92/7.13  % TRYING [8]
% 46.92/7.13  % (205966)Instruction limit reached! 
% 46.92/7.13  % (205966)------------------------------
% 46.92/7.13  % (205966)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.92/7.13  % (205966)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.92/7.13  % (205966)CaDiCaL version: 2.1.3
% 46.92/7.13  % (205966)Termination reason: Instruction limit
% 46.92/7.13  % (205966)Termination phase: Saturation
% 46.92/7.13  % (205966)Time elapsed: 0.652 s
% 46.92/7.13  % (205966)Peak memory usage: 16 MB
% 46.92/7.13  % (205966)Instructions burned: 1472 (million)
% 46.92/7.13  % (205968)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=1900018893:i=6324_2978 on theBenchmark for (2978ds/6324Mi)
% 46.92/7.13  % TRYING [77]
% 46.92/7.13  % TRYING [7]
% 46.92/7.13  % TRYING [9]
% 46.92/7.13  % (205964)Instruction limit reached! 
% 46.92/7.13  % (205964)------------------------------
% 46.92/7.13  % (205964)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.92/7.13  % (205964)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.92/7.13  % (205964)CaDiCaL version: 2.1.3
% 46.92/7.13  % (205964)Termination reason: Instruction limit
% 46.92/7.13  % (205964)Termination phase: Saturation
% 46.92/7.13  % (205964)Time elapsed: 2.602 s
% 46.92/7.13  % (205964)Peak memory usage: 55 MB
% 46.92/7.13  % (205964)Instructions burned: 5132 (million)
% 46.92/7.13  % (205970)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=1310949743:fmbsr=2.30978:i=2174_2962 on theBenchmark for (2962ds/2174Mi)
% 46.92/7.13  % TRYING [16]
% 46.92/7.13  % (205960)Instruction limit reached! 
% 46.92/7.13  % (205960)------------------------------
% 46.92/7.13  % (205960)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.92/7.13  % (205960)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.92/7.13  % (205960)CaDiCaL version: 2.1.3
% 46.92/7.13  % (205960)Termination reason: Instruction limit
% 46.92/7.13  % (205960)Termination phase: Finite model building constraint generation
% 46.92/7.13  % (205960)Time elapsed: 3.257 s
% 46.92/7.13  % (205960)Peak memory usage: 588 MB
% 46.92/7.13  % (205960)Instructions burned: 9516 (million)
% 46.92/7.13  % TRYING [8]
% 46.92/7.13  % (205972)ott-2_1_sil=16000:newcnf=on:random_seed=4096980121:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2957 on theBenchmark for (2957ds/869Mi)
% 46.92/7.13  % (205968)Instruction limit reached! 
% 46.92/7.13  % (205968)------------------------------
% 46.92/7.13  % (205968)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.92/7.13  % (205968)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.92/7.13  % (205968)CaDiCaL version: 2.1.3
% 46.92/7.13  % (205968)Termination reason: Instruction limit
% 46.92/7.13  % (205968)Termination phase: Finite model building constraint generation
% 46.92/7.13  % (205968)Time elapsed: 2.233 s
% 46.92/7.13  % (205968)Peak memory usage: 428 MB
% 46.92/7.13  % (205968)Instructions burned: 6327 (million)
% 46.92/7.13  % (205974)ott+10_1_sil=32000:tgt=ground:random_seed=137399709:i=5114:av=off_2955 on theBenchmark for (2955ds/5114Mi)
% 46.92/7.13  % (205970)Instruction limit reached! 
% 46.92/7.13  % (205970)------------------------------
% 46.92/7.13  % (205970)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.92/7.13  % (205970)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.92/7.13  % (205970)CaDiCaL version: 2.1.3
% 46.92/7.13  % (205970)Termination reason: Instruction limit
% 46.92/7.13  % (205970)Termination phase: Finite model building constraint generation
% 46.92/7.13  % (205970)Time elapsed: 0.748 s
% 46.92/7.13  % (205970)Peak memory usage: 138 MB
% 46.92/7.13  % (205970)Instructions burned: 2177 (million)
% 46.92/7.13  % (205976)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=2266274075:i=54282_2954 on theBenchmark for (2954ds/54282Mi)
% 46.92/7.13  % TRYING [1]
% 46.92/7.13  % TRYING [2]
% 46.92/7.13  % TRYING [3]
% 46.92/7.13  % TRYING [4]
% 46.92/7.13  % TRYING [5]
% 46.92/7.13  % (205972)Instruction limit reached! 
% 46.92/7.13  % (205972)------------------------------
% 46.92/7.13  % (205972)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.92/7.13  % (205972)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.92/7.13  % (205972)CaDiCaL version: 2.1.3
% 46.92/7.13  % (205972)Termination reason: Instruction limit
% 46.92/7.13  % (205972)Termination phase: Saturation
% 46.92/7.13  % (205972)Time elapsed: 0.453 s
% 46.92/7.13  % (205972)Peak memory usage: 25 MB
% 46.92/7.13  % (205972)Instructions burned: 871 (million)
% 46.92/7.13  % (205978)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=2308071667:i=3512:aac=none_2952 on theBenchmark for (2952ds/3512Mi)
% 46.92/7.13  % TRYING [6]
% 46.92/7.13  % TRYING [7]
% 46.92/7.13  % TRYING [8]
% 46.92/7.13  % (205978)Instruction limit reached! 
% 46.92/7.13  % (205978)------------------------------
% 46.92/7.13  % (205978)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.92/7.13  % (205978)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.92/7.13  % (205978)CaDiCaL version: 2.1.3
% 46.92/7.13  % (205978)Termination reason: Instruction limit
% 46.92/7.13  % (205978)Termination phase: Saturation
% 46.92/7.13  % (205978)Time elapsed: 1.896 s
% 46.92/7.13  % (205978)Peak memory usage: 41 MB
% 46.92/7.13  % (205978)Instructions burned: 3514 (million)
% 46.92/7.13  % (205974) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-205919-205974"...
% 46.92/7.13  % (205974)...printing done.
% 46.92/7.13  % (205974)Refutation found. Thanks to Tanya!
% 46.92/7.13  % SZS status Unsatisfiable for theBenchmark
% 46.92/7.13  % SZS output start Proof for theBenchmark
% See solution above
% 46.92/7.13  % (205974)------------------------------
% 46.92/7.13  % (205974)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 46.92/7.13  % (205974)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 46.92/7.13  % (205974)CaDiCaL version: 2.1.3
% 46.92/7.13  % (205974)Termination reason: Refutation
% 46.92/7.13  % (205974)Time elapsed: 2.214 s
% 46.92/7.13  % (205974)Peak memory usage: 51 MB
% 46.92/7.13  % (205974)Instructions burned: 4085 (million)
% 46.92/7.13  % (205919)Success in time 6.726 s
% 46.92/7.13  % Vampire exiting
%------------------------------------------------------------------------------