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

% Computer : n007.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:27 EDT 2022

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

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

cnf(g1,plain,
    int_leq(sK1,n),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d)]) ).

cnf(g2,plain,
    int_leq(int_one,sK2),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d)]) ).

cnf(g3,plain,
    int_leq(sK2,n),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d)]) ).

cnf(g4,plain,
    ~ sPE(sK1,sK2),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',d)]) ).

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

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

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

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

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

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

cnf(g11,plain,
    sPE(sK1,sK1),
    inference(ground_cnf,[],[theory(equality)]) ).

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

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

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

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

cnf(g16,plain,
    ( ~ sPE(sK1,sK1)
    | int_leq(sK1,sK1) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_leq)]) ).

cnf(g17,plain,
    ( ~ sPE(plus(sK1,sK0(sK1,sK2)),sK2)
    | sPE(sK2,plus(sK1,sK0(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/sandbox/benchmark/theBenchmark.p',qii)]) ).

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

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

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

cnf(g22,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)]) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SWV489+3 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12  % Command  : satcop --statistics %s
% 0.14/0.34  % Computer : n007.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Wed Jun 15 13:08:10 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 25.41/3.58  % symbols: 14
% 25.41/3.58  % clauses: 33
% 25.41/3.58  % start clauses: 6
% 25.41/3.58  % iterative deepening steps: 1348
% 25.41/3.58  % maximum path limit: 4
% 25.41/3.58  % literal attempts: 4819945
% 25.41/3.58  % depth failures: 3998248
% 25.41/3.58  % regularity failures: 140031
% 25.41/3.58  % tautology failures: 153592
% 25.41/3.58  % reductions: 67584
% 25.41/3.58  % extensions: 4748470
% 25.41/3.58  % SAT variables: 172774
% 25.41/3.58  % SAT clauses: 248679
% 25.41/3.58  % WalkSAT solutions: 247832
% 25.41/3.58  % CDCL solutions: 840
% 25.41/3.58  % SZS status Theorem for theBenchmark
% 25.41/3.58  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------