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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : KLE066+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:32 EDT 2022

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

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

cnf(g1,plain,
    sPE(multiplication(sK0,domain(sK1)),zero),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals)]) ).

cnf(g2,plain,
    ( ~ sPE(zero,multiplication(sK0,sK1))
    | sPE(multiplication(sK0,sK1),zero) ),
    inference(ground_cnf,[],[theory(equality)]) ).

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

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

cnf(g5,plain,
    sPE(domain(zero),zero),
    inference(ground_cnf,[],[file('Axioms/KLE001+5.ax',domain4)]) ).

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

cnf(g7,plain,
    sPE(addition(multiplication(sK0,sK1),zero),multiplication(sK0,sK1)),
    inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',additive_identity)]) ).

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

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

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

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

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

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

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

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

cnf(g16,plain,
    ( ~ sPE(multiplication(sK0,sK1),multiplication(sK0,sK1))
    | ~ sPE(zero,multiplication(domain(multiplication(sK0,sK1)),multiplication(sK0,sK1)))
    | sPE(addition(multiplication(sK0,sK1),zero),addition(multiplication(sK0,sK1),multiplication(domain(multiplication(sK0,sK1)),multiplication(sK0,sK1)))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g17,plain,
    ( ~ sPE(addition(multiplication(sK0,sK1),multiplication(domain(multiplication(sK0,sK1)),multiplication(sK0,sK1))),multiplication(domain(multiplication(sK0,sK1)),multiplication(sK0,sK1)))
    | ~ sPE(multiplication(domain(multiplication(sK0,sK1)),multiplication(sK0,sK1)),zero)
    | sPE(addition(multiplication(sK0,sK1),multiplication(domain(multiplication(sK0,sK1)),multiplication(sK0,sK1))),zero) ),
    inference(ground_cnf,[],[theory(equality)]) ).

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

cnf(g19,plain,
    sPE(multiplication(zero,multiplication(sK0,sK1)),zero),
    inference(ground_cnf,[],[file('Axioms/KLE001+0.ax',left_annihilation)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : KLE066+1 : TPTP v8.1.0. Released v4.0.0.
% 0.13/0.14  % Command  : satcop --statistics %s
% 0.13/0.35  % Computer : n022.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 15:15:02 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 6.75/1.20  % symbols: 10
% 6.75/1.20  % clauses: 27
% 6.75/1.20  % start clauses: 2
% 6.75/1.20  % iterative deepening steps: 1298
% 6.75/1.20  % maximum path limit: 5
% 6.75/1.20  % literal attempts: 2511246
% 6.75/1.20  % depth failures: 2063669
% 6.75/1.20  % regularity failures: 55830
% 6.75/1.20  % tautology failures: 15682
% 6.75/1.20  % reductions: 28733
% 6.75/1.20  % extensions: 2480842
% 6.75/1.20  % SAT variables: 107228
% 6.75/1.20  % SAT clauses: 150269
% 6.75/1.20  % WalkSAT solutions: 150260
% 6.75/1.20  % CDCL solutions: 8
% 6.75/1.20  % SZS status Theorem for theBenchmark
% 6.75/1.20  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------