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

% Computer : n014.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 : Fri Jul 15 23:14:59 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ holdsAt(backwards,n2),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',backwards_2)]) ).

cnf(g1,plain,
    sPE(backwards,backwards),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g2,plain,
    sPE(pull,pull),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g3,plain,
    sPE(plus(n1,n1),n2),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus1_1)]) ).

cnf(g4,plain,
    sPE(n1,n1),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g5,plain,
    ( ~ sPE(pull,pull)
    | ~ sPE(n1,n1)
    | happens(pull,n1) ),
    inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',happens_all_defn)]) ).

cnf(g6,plain,
    ( ~ sPE(backwards,backwards)
    | ~ sPE(plus(n1,n1),n2)
    | ~ holdsAt(backwards,plus(n1,n1))
    | holdsAt(backwards,n2) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g7,plain,
    sPE(plus(n0,n1),n1),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus0_1)]) ).

cnf(g8,plain,
    ( ~ happens(push,n1)
    | sPE(n1,n0)
    | sP7(push,n1)
    | sP8(push,n1)
    | sP9(push,n1) ),
    inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',happens_all_defn)]) ).

cnf(g9,plain,
    ( ~ happens(pull,n1)
    | ~ initiates(pull,backwards,n1)
    | holdsAt(backwards,plus(n1,n1)) ),
    inference(ground_cnf,[],[file('Axioms/CSR001+0.ax',happens_holds)]) ).

cnf(g10,plain,
    ( ~ sPE(pull,pull)
    | ~ sPE(backwards,backwards)
    | happens(push,n1)
    | initiates(pull,backwards,n1) ),
    inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',initiates_all_defn)]) ).

cnf(g11,plain,
    ( ~ sPE(plus(n1,n0),plus(n0,n1))
    | ~ sPE(plus(n0,n1),n1)
    | sPE(plus(n1,n0),n1) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g12,plain,
    sPE(plus(n1,n0),plus(n0,n1)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_plus)]) ).

cnf(g13,plain,
    ( ~ sPE(n1,n2)
    | sPE(n2,n1) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g14,plain,
    ( ~ sPE(n2,n1)
    | less_or_equal(n2,n1) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal)]) ).

cnf(g15,plain,
    ( ~ less_or_equal(n2,n1)
    | less(n2,n2) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',less2)]) ).

cnf(g16,plain,
    ( sPE(push,pull)
    | ~ sP7(push,n1) ),
    inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',happens_all_defn)]) ).

cnf(g17,plain,
    ~ sPE(push,pull),
    inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',push_not_pull)]) ).

cnf(g18,plain,
    ( ~ less(n2,n2)
    | ~ less(n2,n2) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_property)]) ).

cnf(g19,plain,
    ( ~ sPE(n1,plus(n1,n0))
    | ~ sPE(plus(n1,n0),n2)
    | sPE(n1,n2) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g20,plain,
    ( ~ sPE(plus(n1,n0),n1)
    | sPE(n1,plus(n1,n0)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g21,plain,
    ( ~ sPE(plus(n1,n0),plus(n1,n1))
    | ~ sPE(plus(n1,n1),n2)
    | sPE(plus(n1,n0),n2) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g22,plain,
    ( ~ sPE(plus(n1,n1),plus(n1,n0))
    | sPE(plus(n1,n0),plus(n1,n1)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g23,plain,
    ( ~ sPE(n1,n1)
    | ~ sPE(n1,n0)
    | sPE(plus(n1,n1),plus(n1,n0)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g24,plain,
    ( sPE(push,pull)
    | ~ sP8(push,n1) ),
    inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',happens_all_defn)]) ).

cnf(g25,plain,
    ( sPE(n1,n2)
    | ~ sP9(push,n1) ),
    inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',happens_all_defn)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11  % Problem  : CSR018+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.09/0.12  % Command  : satcop --statistics %s
% 0.12/0.33  % Computer : n014.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sat Jun 11 05:28:53 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 3.26/0.86  % symbols: 48
% 3.26/0.86  % clauses: 153
% 3.26/0.86  % start clauses: 1
% 3.26/0.86  % iterative deepening steps: 634
% 3.26/0.86  % maximum path limit: 5
% 3.26/0.86  % literal attempts: 760454
% 3.26/0.86  % depth failures: 604134
% 3.26/0.86  % regularity failures: 38248
% 3.26/0.86  % tautology failures: 22709
% 3.26/0.86  % reductions: 3337
% 3.26/0.86  % extensions: 756836
% 3.26/0.86  % SAT variables: 81934
% 3.26/0.86  % SAT clauses: 106215
% 3.26/0.86  % WalkSAT solutions: 106198
% 3.26/0.86  % CDCL solutions: 16
% 3.26/0.86  % SZS status Theorem for theBenchmark
% 3.26/0.86  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------