↑ Up

Drodi-SAT---4.1.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi-SAT---4.1.1
% Problem  : KLE146+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n015.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 12:58:24 PM UTC 2026

% Result   : Theorem 0.14s 0.40s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KLE146+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n015.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sun Sep 20 22:49:35 UTC 2026
% 0.14/0.36  % CPUTime  : 
% 0.14/0.37  % Drodi V4.1.1
% 0.14/0.40  % Refutation found
% 0.14/0.40  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.40  % SZS output start CNFRefutation for theBenchmark
% 0.14/0.40  fof(f1,axiom,(
% 0.14/0.40    (! [A,B] : addition(A,B) = addition(B,A) )),
% 0.14/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.40  fof(f2,axiom,(
% 0.14/0.40    (! [C,B,A] : addition(A,addition(B,C)) = addition(addition(A,B),C) )),
% 0.14/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.40  fof(f4,axiom,(
% 0.14/0.40    (! [A] : addition(A,A) = A )),
% 0.14/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.40  fof(f15,axiom,(
% 0.14/0.40    (! [A] : strong_iteration(A) = addition(multiplication(A,strong_iteration(A)),one) )),
% 0.14/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.40  fof(f18,axiom,(
% 0.14/0.40    (! [A,B] :( leq(A,B)<=> addition(A,B) = B ) )),
% 0.14/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.40  fof(f19,conjecture,(
% 0.14/0.40    (! [X0] : leq(one,strong_iteration(X0)) )),
% 0.14/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/0.40  fof(f20,negated_conjecture,(
% 0.14/0.40    ~((! [X0] : leq(one,strong_iteration(X0)) ))),
% 0.14/0.40    inference(negated_conjecture,[status(cth)],[f19])).
% 0.14/0.40  fof(f21,plain,(
% 0.14/0.40    ![X0,X1]: (addition(X0,X1)=addition(X1,X0))),
% 0.14/0.40    inference(cnf_transformation,[status(thm)],[f1])).
% 0.14/0.40  fof(f22,plain,(
% 0.14/0.40    ![X0,X1,X2]: (addition(X0,addition(X1,X2))=addition(addition(X0,X1),X2))),
% 0.14/0.40    inference(cnf_transformation,[status(thm)],[f2])).
% 0.14/0.40  fof(f24,plain,(
% 0.14/0.40    ![X0]: (addition(X0,X0)=X0)),
% 0.14/0.40    inference(cnf_transformation,[status(thm)],[f4])).
% 0.14/0.40  fof(f37,plain,(
% 0.14/0.40    ![X0]: (strong_iteration(X0)=addition(multiplication(X0,strong_iteration(X0)),one))),
% 0.14/0.40    inference(cnf_transformation,[status(thm)],[f15])).
% 0.14/0.40  fof(f41,plain,(
% 0.14/0.40    ![A,B]: ((~leq(A,B)|addition(A,B)=B)&(leq(A,B)|~addition(A,B)=B))),
% 0.14/0.40    inference(NNF_transformation,[status(thm)],[f18])).
% 0.14/0.40  fof(f42,plain,(
% 0.14/0.40    (![A,B]: (~leq(A,B)|addition(A,B)=B))&(![A,B]: (leq(A,B)|~addition(A,B)=B))),
% 0.14/0.40    inference(miniscoping,[status(thm)],[f41])).
% 0.14/0.40  fof(f44,plain,(
% 0.14/0.40    ![X0,X1]: (leq(X0,X1)|~addition(X0,X1)=X1)),
% 0.14/0.40    inference(cnf_transformation,[status(thm)],[f42])).
% 0.14/0.40  fof(f45,plain,(
% 0.14/0.40    (?[X0]: ~leq(one,strong_iteration(X0)))),
% 0.14/0.40    inference(pre_NNF_transformation,[status(thm)],[f20])).
% 0.14/0.40  fof(f46,plain,(
% 0.14/0.40    ~leq(one,strong_iteration(sK0_skl))),
% 0.14/0.40    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(X0,sK0_skl)],[f45])).
% 0.14/0.40  fof(f47,plain,(
% 0.14/0.40    ~leq(one,strong_iteration(sK0_skl))),
% 0.14/0.40    inference(cnf_transformation,[status(thm)],[f46])).
% 0.14/0.40  fof(f129,plain,(
% 0.14/0.40    ![X0]: (strong_iteration(X0)=addition(one,multiplication(X0,strong_iteration(X0))))),
% 0.14/0.40    inference(paramodulation,[status(thm)],[f37,f21])).
% 0.14/0.40  fof(f210,plain,(
% 0.14/0.40    ![X0,X1]: (addition(X0,addition(X0,X1))=addition(X0,X1))),
% 0.14/0.40    inference(paramodulation,[status(thm)],[f24,f22])).
% 0.14/0.40  fof(f316,plain,(
% 0.14/0.40    ![X0,X1]: (leq(X0,addition(X0,X1)))),
% 0.14/0.40    inference(resolution,[status(thm)],[f210,f44])).
% 0.14/0.40  fof(f370,plain,(
% 0.14/0.40    ![X0]: (leq(one,strong_iteration(X0)))),
% 0.14/0.40    inference(paramodulation,[status(thm)],[f129,f316])).
% 0.14/0.40  fof(f380,plain,(
% 0.14/0.40    $false),
% 0.14/0.40    inference(backward_subsumption_resolution,[status(thm)],[f47,f370])).
% 0.14/0.40  % SZS output end CNFRefutation for theBenchmark.p
% 0.14/0.42  % Elapsed time: 0.060020 seconds
% 0.14/0.42  % CPU time: 0.189500 seconds
% 0.14/0.42  % Total memory used: 67.790 MB
% 0.14/0.42  % Net memory used: 67.432 MB
%------------------------------------------------------------------------------