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

% Computer : n024.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.19s 0.43s
% Output   : Proof 0.19s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

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

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

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

cnf(g3,plain,
    ( ~ complete
    | ~ shortest_path(sK9,sK10,sK8)
    | sPE(number_of_in(sequential_pairs,sK8),number_of_in(triangles,sK8)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',triangles_and_sequential_pairs)]) ).

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

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

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GRA002+4 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.03/0.13  % Command  : satcop --statistics %s
% 0.13/0.34  % Computer : n024.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:28:06 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.43  % symbols: 38
% 0.19/0.43  % clauses: 92
% 0.19/0.43  % start clauses: 3
% 0.19/0.43  % iterative deepening steps: 95
% 0.19/0.43  % maximum path limit: 3
% 0.19/0.43  % literal attempts: 68579
% 0.19/0.43  % depth failures: 63476
% 0.19/0.43  % regularity failures: 218
% 0.19/0.43  % tautology failures: 326
% 0.19/0.43  % reductions: 1593
% 0.19/0.43  % extensions: 66733
% 0.19/0.43  % SAT variables: 37127
% 0.19/0.43  % SAT clauses: 28855
% 0.19/0.43  % WalkSAT solutions: 28849
% 0.19/0.43  % CDCL solutions: 0
% 0.19/0.43  % SZS status Theorem for theBenchmark
% 0.19/0.43  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------