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

View Problem - Process Solution

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

% Computer : n022.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.14s 0.44s
% Output   : Proof 0.14s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14  % Problem  : KLE022+1 : TPTP v8.1.0. Released v4.0.0.
% 0.14/0.15  % Command  : satcop --statistics %s
% 0.14/0.37  % Computer : n022.cluster.edu
% 0.14/0.37  % Model    : x86_64 x86_64
% 0.14/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37  % Memory   : 8042.1875MB
% 0.14/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37  % CPULimit : 300
% 0.14/0.37  % WCLimit  : 600
% 0.14/0.37  % DateTime : Thu Jun 16 16:21:02 EDT 2022
% 0.14/0.37  % CPUTime  : 
% 0.14/0.44  % symbols: 13
% 0.14/0.44  % clauses: 34
% 0.14/0.44  % start clauses: 2
% 0.14/0.44  % iterative deepening steps: 299
% 0.14/0.44  % maximum path limit: 4
% 0.14/0.44  % literal attempts: 53674
% 0.14/0.44  % depth failures: 35368
% 0.14/0.44  % regularity failures: 3981
% 0.14/0.44  % tautology failures: 2056
% 0.14/0.44  % reductions: 3579
% 0.14/0.44  % extensions: 49566
% 0.14/0.44  % SAT variables: 13137
% 0.14/0.44  % SAT clauses: 14409
% 0.14/0.44  % WalkSAT solutions: 14403
% 0.14/0.44  % CDCL solutions: 0
% 0.14/0.44  % SZS status Theorem for theBenchmark
% 0.14/0.44  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------