↑ 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  : SWV138+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n019.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 02:50:07 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV138+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n019.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.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Mon Sep 21 08:32:50 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.37  % Drodi V4.1.1
% 0.12/0.40  % Refutation found
% 0.12/0.40  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.40  % SZS output start CNFRefutation for theBenchmark
% 0.12/0.40  fof(f5,axiom,(
% 0.12/0.40    (! [X,Y,Z] :( ( leq(X,Y)& leq(Y,Z) )=> leq(X,Z) ) )),
% 0.12/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.12/0.40  fof(f8,axiom,(
% 0.12/0.40    (! [X,Y] :( gt(Y,X)=> leq(X,Y) ) )),
% 0.12/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.12/0.40  fof(f53,conjecture,(
% 0.12/0.40    ( ( leq(n0,s_best7)& leq(n0,s_sworst7)& leq(n0,s_worst7)& leq(n2,pv1325)& leq(s_best7,n3)& leq(s_sworst7,n3)& leq(s_worst7,n3)& leq(pv1325,n3)& gt(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7)) )=> leq(n0,pv1325) ) ),
% 0.12/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.12/0.40  fof(f54,negated_conjecture,(
% 0.12/0.40    ~(( ( leq(n0,s_best7)& leq(n0,s_sworst7)& leq(n0,s_worst7)& leq(n2,pv1325)& leq(s_best7,n3)& leq(s_sworst7,n3)& leq(s_worst7,n3)& leq(pv1325,n3)& gt(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7)) )=> leq(n0,pv1325) ) )),
% 0.12/0.40    inference(negated_conjecture,[status(cth)],[f53])).
% 0.12/0.40  fof(f65,axiom,(
% 0.12/0.40    gt(n2,n0) ),
% 0.12/0.40    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.12/0.40  fof(f93,plain,(
% 0.12/0.40    ![X,Y,Z]: ((~leq(X,Y)|~leq(Y,Z))|leq(X,Z))),
% 0.12/0.40    inference(pre_NNF_transformation,[status(thm)],[f5])).
% 0.12/0.40  fof(f94,plain,(
% 0.12/0.40    ![X,Z]: ((![Y]: (~leq(X,Y)|~leq(Y,Z)))|leq(X,Z))),
% 0.12/0.40    inference(miniscoping,[status(thm)],[f93])).
% 0.12/0.40  fof(f95,plain,(
% 0.12/0.40    ![X0,X1,X2]: (~leq(X0,X1)|~leq(X1,X2)|leq(X0,X2))),
% 0.12/0.40    inference(cnf_transformation,[status(thm)],[f94])).
% 0.12/0.40  fof(f104,plain,(
% 0.12/0.40    ![X,Y]: (~gt(Y,X)|leq(X,Y))),
% 0.12/0.40    inference(pre_NNF_transformation,[status(thm)],[f8])).
% 0.12/0.40  fof(f105,plain,(
% 0.12/0.40    ![X0,X1]: (~gt(X0,X1)|leq(X1,X0))),
% 0.12/0.40    inference(cnf_transformation,[status(thm)],[f104])).
% 0.12/0.40  fof(f244,plain,(
% 0.12/0.40    (((((((((leq(n0,s_best7)&leq(n0,s_sworst7))&leq(n0,s_worst7))&leq(n2,pv1325))&leq(s_best7,n3))&leq(s_sworst7,n3))&leq(s_worst7,n3))&leq(pv1325,n3))&gt(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7)))&~leq(n0,pv1325))),
% 0.12/0.40    inference(pre_NNF_transformation,[status(thm)],[f54])).
% 0.12/0.40  fof(f248,plain,(
% 0.12/0.40    leq(n2,pv1325)),
% 0.12/0.40    inference(cnf_transformation,[status(thm)],[f244])).
% 0.12/0.40  fof(f254,plain,(
% 0.12/0.40    ~leq(n0,pv1325)),
% 0.12/0.40    inference(cnf_transformation,[status(thm)],[f244])).
% 0.12/0.40  fof(f265,plain,(
% 0.12/0.40    gt(n2,n0)),
% 0.12/0.40    inference(cnf_transformation,[status(thm)],[f65])).
% 0.12/0.40  fof(f340,plain,(
% 0.12/0.40    ![X0]: (~leq(n0,X0)|~leq(X0,pv1325))),
% 0.12/0.40    inference(resolution,[status(thm)],[f95,f254])).
% 0.12/0.40  fof(f349,plain,(
% 0.12/0.40    ~leq(n0,n2)),
% 0.12/0.40    inference(resolution,[status(thm)],[f340,f248])).
% 0.12/0.40  fof(f363,plain,(
% 0.12/0.40    ~gt(n2,n0)),
% 0.12/0.40    inference(resolution,[status(thm)],[f105,f349])).
% 0.12/0.40  fof(f367,plain,(
% 0.12/0.40    $false),
% 0.12/0.40    inference(forward_subsumption_resolution,[status(thm)],[f363,f265])).
% 0.12/0.40  % SZS output end CNFRefutation for theBenchmark.p
% 0.12/0.41  % Elapsed time: 0.059243 seconds
% 0.12/0.41  % CPU time: 0.204679 seconds
% 0.12/0.41  % Total memory used: 92.428 MB
% 0.12/0.41  % Net memory used: 92.105 MB
%------------------------------------------------------------------------------