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

% Computer : n001.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 01:25:53 PM UTC 2026

% Result   : Theorem 0.10s 0.42s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT070+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37  % Computer : n001.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Mon Sep 21 01:30:29 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.39  % Drodi V4.1.1
% 0.10/0.42  % Refutation found
% 0.10/0.42  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.42  % SZS output start CNFRefutation for theBenchmark
% 0.10/0.42  fof(f29,axiom,(
% 0.10/0.42    (! [V,InfD,SupD] :( ( leq(InfD,V)& leq(V,SupD) )=> completion_compatible(V,InfD,SupD) ) )),
% 0.10/0.42    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.42  fof(f37,hypothesis,(
% 0.10/0.42    (! [X] : leq(ninf,X) )),
% 0.10/0.42    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.42  fof(f38,hypothesis,(
% 0.10/0.42    (! [X] : leq(X,nsup) )),
% 0.10/0.42    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.42  fof(f40,conjecture,(
% 0.10/0.42    (? [V] :( leq(ninf,V)& leq(V,nsup)& completion_compatible(V,ninf,nsup) ) )),
% 0.10/0.42    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.42  fof(f41,negated_conjecture,(
% 0.10/0.42    ~((? [V] :( leq(ninf,V)& leq(V,nsup)& completion_compatible(V,ninf,nsup) ) ))),
% 0.10/0.42    inference(negated_conjecture,[status(cth)],[f40])).
% 0.10/0.42  fof(f127,plain,(
% 0.10/0.42    ![V,InfD,SupD]: ((~leq(InfD,V)|~leq(V,SupD))|completion_compatible(V,InfD,SupD))),
% 0.10/0.42    inference(pre_NNF_transformation,[status(thm)],[f29])).
% 0.10/0.42  fof(f128,plain,(
% 0.10/0.42    ![X0,X1,X2]: (~leq(X0,X1)|~leq(X1,X2)|completion_compatible(X1,X0,X2))),
% 0.10/0.42    inference(cnf_transformation,[status(thm)],[f127])).
% 0.10/0.42  fof(f143,plain,(
% 0.10/0.42    ![X0]: (leq(ninf,X0))),
% 0.10/0.42    inference(cnf_transformation,[status(thm)],[f37])).
% 0.10/0.42  fof(f144,plain,(
% 0.10/0.42    ![X0]: (leq(X0,nsup))),
% 0.10/0.42    inference(cnf_transformation,[status(thm)],[f38])).
% 0.10/0.42  fof(f146,plain,(
% 0.10/0.42    (![V]: ((~leq(ninf,V)|~leq(V,nsup))|~completion_compatible(V,ninf,nsup)))),
% 0.10/0.42    inference(pre_NNF_transformation,[status(thm)],[f41])).
% 0.10/0.42  fof(f147,plain,(
% 0.10/0.42    ![X0]: (~leq(ninf,X0)|~leq(X0,nsup)|~completion_compatible(X0,ninf,nsup))),
% 0.10/0.42    inference(cnf_transformation,[status(thm)],[f146])).
% 0.10/0.42  fof(f160,plain,(
% 0.10/0.42    ![X0]: (~leq(X0,nsup)|~completion_compatible(X0,ninf,nsup))),
% 0.10/0.42    inference(forward_subsumption_resolution,[status(thm)],[f147,f143])).
% 0.10/0.42  fof(f176,plain,(
% 0.10/0.42    ![X0]: (~leq(ninf,X0)|~leq(X0,nsup)|~leq(X0,nsup))),
% 0.10/0.42    inference(resolution,[status(thm)],[f128,f160])).
% 0.10/0.42  fof(f177,plain,(
% 0.10/0.42    ![X0]: (~leq(ninf,X0)|~leq(X0,nsup))),
% 0.10/0.42    inference(duplicate_literals_removal,[status(thm)],[f176])).
% 0.10/0.42  fof(f179,plain,(
% 0.10/0.42    ![X0]: (~leq(X0,nsup))),
% 0.10/0.42    inference(forward_subsumption_resolution,[status(thm)],[f177,f143])).
% 0.10/0.42  fof(f180,plain,(
% 0.10/0.42    $false),
% 0.10/0.42    inference(backward_subsumption_resolution,[status(thm)],[f144,f179])).
% 0.10/0.42  % SZS output end CNFRefutation for theBenchmark.p
% 0.10/0.46  % Elapsed time: 0.068299 seconds
% 0.10/0.46  % CPU time: 0.178167 seconds
% 0.10/0.46  % Total memory used: 103.136 MB
% 0.10/0.46  % Net memory used: 103.030 MB
%------------------------------------------------------------------------------