TSTP Solution File: CSR016+1 by SATCoP---0.1

View Problem - Process Solution

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

% Computer : n023.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 4.38s 0.89s
% Output   : Proof 4.38s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

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

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

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

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

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

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

cnf(g6,plain,
    sPE(push,push),
    inference(ground_cnf,[],[theory(equality)]) ).

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

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

cnf(g9,plain,
    sPE(n0,n0),
    inference(ground_cnf,[],[theory(equality)]) ).

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

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

cnf(g12,plain,
    ( ~ sPE(pull,push)
    | sPE(push,pull) ),
    inference(ground_cnf,[],[theory(equality)]) ).

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

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

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

cnf(g16,plain,
    ( ~ happens(push,n0)
    | ~ initiates(push,forwards,n0)
    | holdsAt(forwards,plus(n0,n1)) ),
    inference(ground_cnf,[],[file('Axioms/CSR001+0.ax',happens_holds)]) ).

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

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

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

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

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

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

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

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : CSR016+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.03/0.12  % Command  : satcop --statistics %s
% 0.13/0.31  % Computer : n023.cluster.edu
% 0.13/0.31  % Model    : x86_64 x86_64
% 0.13/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.31  % Memory   : 8042.1875MB
% 0.13/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.31  % CPULimit : 300
% 0.13/0.31  % WCLimit  : 600
% 0.13/0.31  % DateTime : Fri Jun 10 03:48:52 EDT 2022
% 0.13/0.32  % CPUTime  : 
% 4.38/0.89  % symbols: 48
% 4.38/0.89  % clauses: 153
% 4.38/0.89  % start clauses: 1
% 4.38/0.89  % iterative deepening steps: 682
% 4.38/0.89  % maximum path limit: 6
% 4.38/0.89  % literal attempts: 1251595
% 4.38/0.89  % depth failures: 1001659
% 4.38/0.89  % regularity failures: 64447
% 4.38/0.89  % tautology failures: 45405
% 4.38/0.89  % reductions: 5346
% 4.38/0.89  % extensions: 1245861
% 4.38/0.89  % SAT variables: 75006
% 4.38/0.89  % SAT clauses: 110335
% 4.38/0.89  % WalkSAT solutions: 110320
% 4.38/0.89  % CDCL solutions: 13
% 4.38/0.89  % SZS status Theorem for theBenchmark
% 4.38/0.89  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------