%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : GRA003+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n021.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Sat Jul 16 07:21:45 EDT 2022

% Result   : Theorem 0.13s 0.37s
% Output   : Proof 0.13s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    shortest_path(sK8,sK9,sK12),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',vertices_and_edges)]) ).

cnf(g1,plain,
    precedes(sK10,sK11,sK12),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',vertices_and_edges)]) ).

cnf(g2,plain,
    ( ~ edge(sK10)
    | ~ edge(sK11)
    | ~ vertex(sK8)
    | ~ vertex(sK9)
    | ~ path(sK8,sK9,sK12)
    | sPE(sK8,sK9)
    | sPE(sK10,sK11) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',vertices_and_edges)]) ).

cnf(g3,plain,
    ( ~ shortest_path(sK8,sK9,sK12)
    | path(sK8,sK9,sK12) ),
    inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',shortest_path_defn)]) ).

cnf(g4,plain,
    ( ~ sPE(sK8,sK9)
    | ~ shortest_path(sK8,sK9,sK12) ),
    inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',shortest_path_defn)]) ).

cnf(g5,plain,
    ( ~ path(sK8,sK9,sK12)
    | vertex(sK9) ),
    inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',path_properties)]) ).

cnf(g6,plain,
    ( ~ path(sK8,sK9,sK12)
    | vertex(sK8) ),
    inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',path_properties)]) ).

cnf(g7,plain,
    sPE(tail_of(sK10),tail_of(sK10)),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g8,plain,
    ( ~ sPE(sK10,sK11)
    | sPE(head_of(sK10),head_of(sK11)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g9,plain,
    ( ~ sPE(head_of(sK10),head_of(sK11))
    | ~ sPE(tail_of(sK10),tail_of(sK10))
    | ~ precedes(sK10,sK11,sK12)
    | ~ shortest_path(sK8,sK9,sK12) ),
    inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',shortest_path_properties)]) ).

cnf(g10,plain,
    ( ~ sequential(sK10,sK11)
    | edge(sK10) ),
    inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',sequential_defn)]) ).

cnf(g11,plain,
    ( ~ path(sK8,sK9,sK12)
    | ~ precedes(sK10,sK11,sK12)
    | on_path(sK11,sK12) ),
    inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',precedes_properties)]) ).

cnf(g12,plain,
    ( ~ path(sK8,sK9,sK12)
    | ~ on_path(sK11,sK12)
    | edge(sK11) ),
    inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',on_path_properties)]) ).

cnf(g13,plain,
    ( ~ path(sK8,sK9,sK12)
    | ~ precedes(sK10,sK11,sK12)
    | sequential(sK10,sK11)
    | sequential(sK10,sK4(sK12,sK8,sK9,sK10,sK11)) ),
    inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',precedes_properties)]) ).

cnf(g14,plain,
    ( ~ sequential(sK10,sK4(sK12,sK8,sK9,sK10,sK11))
    | edge(sK10) ),
    inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',sequential_defn)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : GRA003+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.10/0.13  % Command  : satcop --statistics %s
% 0.13/0.34  % Computer : n021.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Tue May 31 02:23:59 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.37  % symbols: 40
% 0.13/0.37  % clauses: 91
% 0.13/0.37  % start clauses: 3
% 0.13/0.37  % iterative deepening steps: 173
% 0.13/0.37  % maximum path limit: 3
% 0.13/0.37  % literal attempts: 38946
% 0.13/0.37  % depth failures: 32310
% 0.13/0.37  % regularity failures: 353
% 0.13/0.37  % tautology failures: 351
% 0.13/0.37  % reductions: 630
% 0.13/0.37  % extensions: 37860
% 0.13/0.37  % SAT variables: 9612
% 0.13/0.37  % SAT clauses: 9140
% 0.13/0.37  % WalkSAT solutions: 9142
% 0.13/0.37  % CDCL solutions: 0
% 0.13/0.37  % SZS status Theorem for theBenchmark
% 0.13/0.37  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------