%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : KLE146+1 : 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 : Sun Jul 17 02:25:51 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ leq(one,strong_iteration(sK0)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals)]) ).

cnf(g1,plain,
    sPE(addition(one,zero),one),
    inference(ground_cnf,[],[file('Axioms/KLE004+0.ax',additive_identity)]) ).

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

cnf(g3,plain,
    sPE(addition(one,one),one),
    inference(ground_cnf,[],[file('Axioms/KLE004+0.ax',idempotence)]) ).

cnf(g4,plain,
    sPE(strong_iteration(sK0),addition(multiplication(sK0,strong_iteration(sK0)),one)),
    inference(ground_cnf,[],[file('Axioms/KLE004+0.ax',infty_unfold1)]) ).

cnf(g5,plain,
    sPE(addition(multiplication(sK0,strong_iteration(sK0)),one),addition(one,multiplication(sK0,strong_iteration(sK0)))),
    inference(ground_cnf,[],[file('Axioms/KLE004+0.ax',additive_commutativity)]) ).

cnf(g6,plain,
    ( ~ sPE(addition(addition(one,zero),one),addition(one,one))
    | ~ sPE(addition(one,one),one)
    | sPE(addition(addition(one,zero),one),one) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g7,plain,
    ( ~ sPE(addition(one,zero),one)
    | ~ sPE(one,one)
    | sPE(addition(addition(one,zero),one),addition(one,one)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g8,plain,
    ( ~ sPE(strong_iteration(sK0),addition(one,multiplication(sK0,strong_iteration(sK0))))
    | sPE(addition(one,multiplication(sK0,strong_iteration(sK0))),strong_iteration(sK0)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g9,plain,
    ( ~ sPE(strong_iteration(sK0),addition(multiplication(sK0,strong_iteration(sK0)),one))
    | ~ sPE(addition(multiplication(sK0,strong_iteration(sK0)),one),addition(one,multiplication(sK0,strong_iteration(sK0))))
    | sPE(strong_iteration(sK0),addition(one,multiplication(sK0,strong_iteration(sK0)))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g10,plain,
    ( ~ sPE(addition(one,zero),one)
    | ~ sPE(addition(one,multiplication(sK0,strong_iteration(sK0))),strong_iteration(sK0))
    | ~ leq(addition(one,zero),addition(one,multiplication(sK0,strong_iteration(sK0))))
    | leq(one,strong_iteration(sK0)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g11,plain,
    ( ~ sPE(addition(addition(one,zero),addition(one,multiplication(sK0,strong_iteration(sK0)))),addition(one,multiplication(sK0,strong_iteration(sK0))))
    | leq(addition(one,zero),addition(one,multiplication(sK0,strong_iteration(sK0)))) ),
    inference(ground_cnf,[],[file('Axioms/KLE004+0.ax',order)]) ).

cnf(g12,plain,
    ( ~ sPE(addition(addition(one,zero),addition(one,multiplication(sK0,strong_iteration(sK0)))),addition(addition(addition(one,zero),one),multiplication(sK0,strong_iteration(sK0))))
    | ~ sPE(addition(addition(addition(one,zero),one),multiplication(sK0,strong_iteration(sK0))),addition(one,multiplication(sK0,strong_iteration(sK0))))
    | sPE(addition(addition(one,zero),addition(one,multiplication(sK0,strong_iteration(sK0)))),addition(one,multiplication(sK0,strong_iteration(sK0)))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g13,plain,
    sPE(addition(addition(one,zero),addition(one,multiplication(sK0,strong_iteration(sK0)))),addition(addition(addition(one,zero),one),multiplication(sK0,strong_iteration(sK0)))),
    inference(ground_cnf,[],[file('Axioms/KLE004+0.ax',additive_associativity)]) ).

cnf(g14,plain,
    ( ~ sPE(addition(addition(one,zero),one),one)
    | ~ sPE(multiplication(sK0,strong_iteration(sK0)),multiplication(sK0,strong_iteration(sK0)))
    | sPE(addition(addition(addition(one,zero),one),multiplication(sK0,strong_iteration(sK0))),addition(one,multiplication(sK0,strong_iteration(sK0)))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g15,plain,
    sPE(multiplication(sK0,strong_iteration(sK0)),multiplication(sK0,strong_iteration(sK0))),
    inference(ground_cnf,[],[theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : KLE146+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.14  % Command  : satcop --statistics %s
% 0.13/0.35  % Computer : n007.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Thu Jun 16 16:15:56 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.46  % symbols: 10
% 0.20/0.46  % clauses: 28
% 0.20/0.46  % start clauses: 1
% 0.20/0.46  % iterative deepening steps: 1401
% 0.20/0.46  % maximum path limit: 5
% 0.20/0.46  % literal attempts: 91429
% 0.20/0.46  % depth failures: 37974
% 0.20/0.46  % regularity failures: 10252
% 0.20/0.46  % tautology failures: 4606
% 0.20/0.46  % reductions: 0
% 0.20/0.46  % extensions: 90093
% 0.20/0.46  % SAT variables: 34652
% 0.20/0.46  % SAT clauses: 49085
% 0.20/0.46  % WalkSAT solutions: 49091
% 0.20/0.46  % CDCL solutions: 0
% 0.20/0.46  % SZS status Theorem for theBenchmark
% 0.20/0.46  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------