%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : SWV487+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n016.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 : Wed Jul 20 21:29:26 EDT 2022

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

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

cnf(g1,plain,
    int_less(sK2,sK1),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ut)]) ).

cnf(g2,plain,
    int_leq(sK1,n),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ut)]) ).

cnf(g3,plain,
    ~ sPE(a(sK1,sK2),real_zero),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ut)]) ).

cnf(g4,plain,
    ( ~ int_leq(int_one,sK2)
    | int_less(int_zero,sK2) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',one_successor_of_zero)]) ).

cnf(g5,plain,
    ( ~ int_less(sK2,sK1)
    | sPE(plus(sK2,sK0(sK2,sK1)),sK1) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus_and_inverse)]) ).

cnf(g6,plain,
    ( ~ int_less(sK2,sK1)
    | int_less(int_zero,sK0(sK2,sK1)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus_and_inverse)]) ).

cnf(g7,plain,
    ( ~ int_less(sK2,sK1)
    | int_leq(sK2,sK1) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_leq)]) ).

cnf(g8,plain,
    ( ~ int_leq(sK1,n)
    | sPE(sK1,n)
    | int_less(sK1,n) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_leq)]) ).

cnf(g9,plain,
    ( ~ int_less(sK2,n)
    | int_leq(sK2,n) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_leq)]) ).

cnf(g10,plain,
    ( ~ int_less(int_zero,sK1)
    | int_leq(int_one,sK1) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',one_successor_of_zero)]) ).

cnf(g11,plain,
    ( ~ sPE(plus(sK2,sK0(sK2,sK1)),sK1)
    | sPE(sK1,plus(sK2,sK0(sK2,sK1))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g12,plain,
    sPE(sK2,sK2),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g13,plain,
    ( ~ int_less(int_zero,sK2)
    | ~ int_less(sK2,sK1)
    | int_less(int_zero,sK1) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_less_transitive)]) ).

cnf(g14,plain,
    ( ~ sPE(sK2,sK2)
    | int_leq(sK2,sK2) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_leq)]) ).

cnf(g15,plain,
    ( ~ int_less(sK2,sK1)
    | ~ int_less(sK1,n)
    | int_less(sK2,n) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_less_transitive)]) ).

cnf(g16,plain,
    ( ~ sPE(sK2,sK2)
    | ~ sPE(sK1,n)
    | ~ int_leq(sK2,sK1)
    | int_leq(sK2,n) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g17,plain,
    ( ~ sPE(sK1,plus(sK2,sK0(sK2,sK1)))
    | ~ sPE(sK2,sK2)
    | sPE(a(sK1,sK2),a(plus(sK2,sK0(sK2,sK1)),sK2)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g18,plain,
    ( ~ sPE(sK1,plus(sK2,sK0(sK2,sK1)))
    | ~ int_leq(sK1,n)
    | ~ int_leq(sK2,n)
    | ~ int_leq(sK2,sK2)
    | ~ int_leq(int_one,sK1)
    | ~ int_leq(int_one,sK2)
    | ~ int_leq(int_one,sK2)
    | ~ int_less(int_zero,sK0(sK2,sK1))
    | sPE(a(plus(sK2,sK0(sK2,sK1)),sK2),real_zero) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qiu)]) ).

cnf(g19,plain,
    ( ~ sPE(a(sK1,sK2),a(plus(sK2,sK0(sK2,sK1)),sK2))
    | ~ sPE(a(plus(sK2,sK0(sK2,sK1)),sK2),real_zero)
    | sPE(a(sK1,sK2),real_zero) ),
    inference(ground_cnf,[],[theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWV487+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12  % Command  : satcop --statistics %s
% 0.12/0.33  % Computer : n016.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 : Wed Jun 15 07:29:47 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 4.75/1.01  % symbols: 15
% 4.75/1.01  % clauses: 31
% 4.75/1.01  % start clauses: 4
% 4.75/1.01  % iterative deepening steps: 813
% 4.75/1.01  % maximum path limit: 4
% 4.75/1.01  % literal attempts: 1612082
% 4.75/1.01  % depth failures: 1340462
% 4.75/1.01  % regularity failures: 47712
% 4.75/1.01  % tautology failures: 43567
% 4.75/1.01  % reductions: 24686
% 4.75/1.01  % extensions: 1585635
% 4.75/1.01  % SAT variables: 71970
% 4.75/1.01  % SAT clauses: 92659
% 4.75/1.01  % WalkSAT solutions: 92650
% 4.75/1.01  % CDCL solutions: 8
% 4.75/1.01  % SZS status Theorem for theBenchmark
% 4.75/1.01  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------