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

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    test(sK2),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals)]) ).

cnf(g1,plain,
    ~ sPE(sK1,addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals)]) ).

cnf(g2,plain,
    ( ~ sPE(c(sK2),c(sK2))
    | ~ test(sK2)
    | complement(sK2,c(sK2)) ),
    inference(ground_cnf,[],[file('Axioms/KLE001+1.ax',test_3)]) ).

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

cnf(g4,plain,
    ( ~ complement(sK2,c(sK2))
    | sPE(addition(c(sK2),sK2),one) ),
    inference(ground_cnf,[],[file('Axioms/KLE001+1.ax',test_2)]) ).

cnf(g5,plain,
    ( ~ sPE(addition(c(sK2),sK2),one)
    | ~ sPE(sK1,sK1)
    | sPE(multiplication(addition(c(sK2),sK2),sK1),multiplication(one,sK1)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g6,plain,
    sPE(addition(multiplication(c(sK2),sK1),multiplication(sK2,sK1)),addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1))),
    inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',additive_commutativity)]) ).

cnf(g7,plain,
    sPE(multiplication(one,sK1),sK1),
    inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',multiplicative_left_identity)]) ).

cnf(g8,plain,
    ( ~ sPE(sK1,addition(multiplication(c(sK2),sK1),multiplication(sK2,sK1)))
    | ~ sPE(addition(multiplication(c(sK2),sK1),multiplication(sK2,sK1)),addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)))
    | sPE(sK1,addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

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

cnf(g10,plain,
    ( ~ sPE(sK1,multiplication(addition(c(sK2),sK2),sK1))
    | ~ sPE(multiplication(addition(c(sK2),sK2),sK1),addition(multiplication(c(sK2),sK1),multiplication(sK2,sK1)))
    | sPE(sK1,addition(multiplication(c(sK2),sK1),multiplication(sK2,sK1))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g11,plain,
    sPE(multiplication(addition(c(sK2),sK2),sK1),addition(multiplication(c(sK2),sK1),multiplication(sK2,sK1))),
    inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',left_distributivity)]) ).

cnf(g12,plain,
    ( ~ sPE(multiplication(addition(c(sK2),sK2),sK1),sK1)
    | sPE(sK1,multiplication(addition(c(sK2),sK2),sK1)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g13,plain,
    ( ~ sPE(multiplication(addition(c(sK2),sK2),sK1),multiplication(one,sK1))
    | ~ sPE(multiplication(one,sK1),sK1)
    | sPE(multiplication(addition(c(sK2),sK2),sK1),sK1) ),
    inference(ground_cnf,[],[theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem  : KLE021+3 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.14  % Command  : satcop --statistics %s
% 0.14/0.35  % Computer : n016.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Thu Jun 16 10:37:34 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.20/0.48  % symbols: 13
% 0.20/0.48  % clauses: 36
% 0.20/0.48  % start clauses: 2
% 0.20/0.48  % iterative deepening steps: 369
% 0.20/0.48  % maximum path limit: 4
% 0.20/0.48  % literal attempts: 130238
% 0.20/0.48  % depth failures: 84917
% 0.20/0.48  % regularity failures: 3580
% 0.20/0.48  % tautology failures: 3407
% 0.20/0.48  % reductions: 24623
% 0.20/0.48  % extensions: 105176
% 0.20/0.48  % SAT variables: 26267
% 0.20/0.48  % SAT clauses: 26826
% 0.20/0.48  % WalkSAT solutions: 26825
% 0.20/0.48  % CDCL solutions: 0
% 0.20/0.48  % SZS status Theorem for theBenchmark
% 0.20/0.48  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------