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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : KLE061+1 : TPTP v8.1.0. Released v4.0.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 : Sun Jul 17 02:25:31 EDT 2022

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

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

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

cnf(g2,plain,
    sPE(multiplication(domain(sK0),one),domain(sK0)),
    inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',multiplicative_right_identity)]) ).

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

cnf(g4,plain,
    sPE(addition(domain(sK0),one),one),
    inference(ground_cnf,[],[file('Axioms/KLE001+5.ax',domain3)]) ).

cnf(g5,plain,
    ( ~ sPE(multiplication(domain(sK0),one),domain(sK0))
    | sPE(domain(sK0),multiplication(domain(sK0),one)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g6,plain,
    ( ~ sPE(multiplication(domain(sK0),domain(sK0)),multiplication(domain(sK0),one))
    | ~ sPE(multiplication(domain(sK0),one),domain(sK0))
    | sPE(multiplication(domain(sK0),domain(sK0)),domain(sK0)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

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

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

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

cnf(g10,plain,
    ( ~ sPE(domain(sK0),domain(domain(sK0)))
    | ~ sPE(domain(sK0),domain(sK0))
    | sPE(multiplication(domain(sK0),domain(sK0)),multiplication(domain(domain(sK0)),domain(sK0))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g11,plain,
    sPE(addition(domain(sK0),multiplication(domain(domain(sK0)),domain(sK0))),multiplication(domain(domain(sK0)),domain(sK0))),
    inference(ground_cnf,[],[file('Axioms/KLE001+5.ax',domain1)]) ).

cnf(g12,plain,
    ( ~ sPE(addition(domain(sK0),multiplication(domain(domain(sK0)),domain(sK0))),multiplication(domain(domain(sK0)),domain(sK0)))
    | leq(domain(sK0),multiplication(domain(domain(sK0)),domain(sK0))) ),
    inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',order)]) ).

cnf(g13,plain,
    ( ~ sPE(multiplication(domain(sK0),domain(sK0)),multiplication(domain(domain(sK0)),domain(sK0)))
    | sPE(multiplication(domain(domain(sK0)),domain(sK0)),multiplication(domain(sK0),domain(sK0))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g14,plain,
    sPE(domain(multiplication(one,sK0)),domain(multiplication(one,domain(sK0)))),
    inference(ground_cnf,[],[file('Axioms/KLE001+5.ax',domain2)]) ).

cnf(g15,plain,
    ( ~ sPE(multiplication(one,domain(sK0)),domain(sK0))
    | sPE(domain(multiplication(one,domain(sK0))),domain(domain(sK0))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g16,plain,
    ( ~ leq(multiplication(domain(sK0),one),multiplication(domain(sK0),domain(sK0)))
    | sPE(addition(multiplication(domain(sK0),one),multiplication(domain(sK0),domain(sK0))),multiplication(domain(sK0),domain(sK0))) ),
    inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',order)]) ).

cnf(g17,plain,
    ( ~ sPE(domain(sK0),multiplication(domain(sK0),one))
    | ~ sPE(multiplication(domain(domain(sK0)),domain(sK0)),multiplication(domain(sK0),domain(sK0)))
    | ~ leq(domain(sK0),multiplication(domain(domain(sK0)),domain(sK0)))
    | leq(multiplication(domain(sK0),one),multiplication(domain(sK0),domain(sK0))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g18,plain,
    sPE(addition(multiplication(domain(sK0),domain(sK0)),multiplication(domain(sK0),one)),addition(multiplication(domain(sK0),one),multiplication(domain(sK0),domain(sK0)))),
    inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',additive_commutativity)]) ).

cnf(g19,plain,
    ( ~ sPE(domain(multiplication(one,sK0)),domain(sK0))
    | sPE(domain(sK0),domain(multiplication(one,sK0))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g20,plain,
    ( ~ sPE(multiplication(one,sK0),sK0)
    | sPE(domain(multiplication(one,sK0)),domain(sK0)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

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

cnf(g22,plain,
    ( ~ sPE(domain(sK0),domain(multiplication(one,sK0)))
    | ~ sPE(domain(multiplication(one,sK0)),domain(domain(sK0)))
    | sPE(domain(sK0),domain(domain(sK0))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g23,plain,
    ( ~ sPE(domain(multiplication(one,sK0)),domain(multiplication(one,domain(sK0))))
    | ~ sPE(domain(multiplication(one,domain(sK0))),domain(domain(sK0)))
    | sPE(domain(multiplication(one,sK0)),domain(domain(sK0))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g24,plain,
    sPE(multiplication(domain(sK0),addition(domain(sK0),one)),addition(multiplication(domain(sK0),domain(sK0)),multiplication(domain(sK0),one))),
    inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',right_distributivity)]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : KLE061+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.15  % Command  : satcop --statistics %s
% 0.14/0.36  % Computer : n023.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Thu Jun 16 12:24:35 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 12.62/2.04  % symbols: 9
% 12.62/2.04  % clauses: 26
% 12.62/2.04  % start clauses: 1
% 12.62/2.04  % iterative deepening steps: 8492
% 12.62/2.04  % maximum path limit: 7
% 12.62/2.04  % literal attempts: 1399572
% 12.62/2.04  % depth failures: 473604
% 12.62/2.04  % regularity failures: 169553
% 12.62/2.04  % tautology failures: 100272
% 12.62/2.04  % reductions: 0
% 12.62/2.04  % extensions: 1391232
% 12.62/2.04  % SAT variables: 389781
% 12.62/2.04  % SAT clauses: 640124
% 12.62/2.04  % WalkSAT solutions: 640123
% 12.62/2.04  % CDCL solutions: 0
% 12.62/2.04  % SZS status Theorem for theBenchmark
% 12.62/2.04  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------