%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : GRA002+3 : 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.12s 0.37s
% Output   : Proof 0.12s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    complete,
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maximal_path_length)]) ).

cnf(g1,plain,
    shortest_path(sK10,sK11,sK9),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maximal_path_length)]) ).

cnf(g2,plain,
    ~ less_or_equal(minus(length_of(sK9),n1),number_of_in(triangles,graph)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maximal_path_length)]) ).

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

cnf(g4,plain,
    ( ~ path(sK10,sK11,sK9)
    | sPE(number_of_in(sequential_pairs,sK9),number_of_in(triangles,sK9))
    | sequential(sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sequential_pairs_and_triangles)]) ).

cnf(g5,plain,
    ( ~ path(sK10,sK11,sK9)
    | sPE(number_of_in(sequential_pairs,sK9),number_of_in(triangles,sK9))
    | on_path(sK6(sK9,sK10,sK11),sK9) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sequential_pairs_and_triangles)]) ).

cnf(g6,plain,
    ( ~ path(sK10,sK11,sK9)
    | sPE(number_of_in(sequential_pairs,sK9),minus(length_of(sK9),n1)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',path_length_sequential_pairs)]) ).

cnf(g7,plain,
    ( ~ path(sK10,sK11,sK9)
    | sPE(number_of_in(sequential_pairs,sK9),number_of_in(triangles,sK9))
    | on_path(sK7(sK9,sK10,sK11),sK9) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sequential_pairs_and_triangles)]) ).

cnf(g8,plain,
    ( ~ sPE(number_of_in(triangles,sK9),minus(length_of(sK9),n1))
    | ~ sPE(number_of_in(triangles,graph),number_of_in(triangles,graph))
    | ~ less_or_equal(number_of_in(triangles,sK9),number_of_in(triangles,graph))
    | less_or_equal(minus(length_of(sK9),n1),number_of_in(triangles,graph)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g9,plain,
    less_or_equal(number_of_in(triangles,sK9),number_of_in(triangles,graph)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',graph_has_them_all)]) ).

cnf(g10,plain,
    sPE(number_of_in(triangles,graph),number_of_in(triangles,graph)),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g11,plain,
    ( ~ complete
    | ~ sequential(sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11))
    | ~ precedes(sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9)
    | ~ shortest_path(sK10,sK11,sK9)
    | triangle(sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sequential_is_triangle)]) ).

cnf(g12,plain,
    ( ~ path(sK10,sK11,sK9)
    | ~ on_path(sK6(sK9,sK10,sK11),sK9)
    | ~ on_path(sK7(sK9,sK10,sK11),sK9)
    | ~ sequential(sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11))
    | precedes(sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9) ),
    inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',precedes_defn)]) ).

cnf(g13,plain,
    ( ~ sPE(number_of_in(sequential_pairs,sK9),number_of_in(triangles,sK9))
    | sPE(number_of_in(triangles,sK9),number_of_in(sequential_pairs,sK9)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g14,plain,
    ( ~ sPE(number_of_in(triangles,sK9),number_of_in(sequential_pairs,sK9))
    | ~ sPE(number_of_in(sequential_pairs,sK9),minus(length_of(sK9),n1))
    | sPE(number_of_in(triangles,sK9),minus(length_of(sK9),n1)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g15,plain,
    ( ~ path(sK10,sK11,sK9)
    | ~ triangle(sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9))
    | sPE(number_of_in(sequential_pairs,sK9),number_of_in(triangles,sK9)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sequential_pairs_and_triangles)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRA002+3 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.07/0.13  % Command  : satcop --statistics %s
% 0.12/0.34  % Computer : n021.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Tue May 31 02:50:44 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.37  % symbols: 39
% 0.12/0.37  % clauses: 93
% 0.12/0.37  % start clauses: 3
% 0.12/0.37  % iterative deepening steps: 111
% 0.12/0.37  % maximum path limit: 3
% 0.12/0.37  % literal attempts: 36108
% 0.12/0.37  % depth failures: 31557
% 0.12/0.37  % regularity failures: 290
% 0.12/0.37  % tautology failures: 390
% 0.12/0.37  % reductions: 439
% 0.12/0.37  % extensions: 35434
% 0.12/0.37  % SAT variables: 13166
% 0.12/0.37  % SAT clauses: 11507
% 0.12/0.37  % WalkSAT solutions: 11507
% 0.12/0.37  % CDCL solutions: 0
% 0.12/0.37  % SZS status Theorem for theBenchmark
% 0.12/0.37  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------