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

% Computer : n004.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:10:14 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL540+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04  % Command  : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/5.37  % Computer : n004.cluster.edu
% 0.09/5.37  % Model    : x86_64 x86_64
% 0.09/5.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37  % Memory   : 8046.5625MB
% 0.09/5.37  % OS       : Linux 6.8.0-71-generic
% 0.09/5.37  % CPULimit : 300
% 0.09/5.37  % WCLimit  : 300
% 0.09/5.37  % DateTime : Mon Sep 21 00:37:57 UTC 2026
% 0.09/5.38  % CPUTime  : 
% 0.09/5.39  % Drodi V4.1.1
% 0.14/5.41  % Refutation found
% 0.14/5.41  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/5.41  % SZS output start CNFRefutation for theBenchmark
% 0.14/5.41  fof(f1,axiom,(
% 0.14/5.41    ( modus_ponens<=> (! [X,Y] :( ( is_a_theorem(X)& is_a_theorem(implies(X,Y)) )=> is_a_theorem(Y) ) )) ),
% 0.14/5.41    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/5.41  fof(f9,axiom,(
% 0.14/5.41    ( and_3<=> (! [X,Y] : is_a_theorem(implies(X,implies(Y,and(X,Y)))) )) ),
% 0.14/5.41    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/5.41  fof(f35,axiom,(
% 0.14/5.41    modus_ponens ),
% 0.14/5.41    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/5.41  fof(f42,axiom,(
% 0.14/5.41    and_3 ),
% 0.14/5.41    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/5.41  fof(f52,axiom,(
% 0.14/5.41    ( adjunction<=> (! [X,Y] :( ( is_a_theorem(X)& is_a_theorem(Y) )=> is_a_theorem(and(X,Y)) ) )) ),
% 0.14/5.41    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/5.41  fof(f89,conjecture,(
% 0.14/5.41    adjunction ),
% 0.14/5.41    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.14/5.41  fof(f90,negated_conjecture,(
% 0.14/5.41    ~(adjunction )),
% 0.14/5.41    inference(negated_conjecture,[status(cth)],[f89])).
% 0.14/5.41  fof(f91,plain,(
% 0.14/5.41    modus_ponens<=>(![X,Y]: ((~is_a_theorem(X)|~is_a_theorem(implies(X,Y)))|is_a_theorem(Y)))),
% 0.14/5.41    inference(pre_NNF_transformation,[status(thm)],[f1])).
% 0.14/5.41  fof(f92,plain,(
% 0.14/5.41    (~modus_ponens|(![X,Y]: ((~is_a_theorem(X)|~is_a_theorem(implies(X,Y)))|is_a_theorem(Y))))&(modus_ponens|(?[X,Y]: ((is_a_theorem(X)&is_a_theorem(implies(X,Y)))&~is_a_theorem(Y))))),
% 0.14/5.41    inference(NNF_transformation,[status(thm)],[f91])).
% 0.14/5.41  fof(f93,plain,(
% 0.14/5.41    (~modus_ponens|(![Y]: ((![X]: (~is_a_theorem(X)|~is_a_theorem(implies(X,Y))))|is_a_theorem(Y))))&(modus_ponens|(?[Y]: ((?[X]: (is_a_theorem(X)&is_a_theorem(implies(X,Y))))&~is_a_theorem(Y))))),
% 0.14/5.41    inference(miniscoping,[status(thm)],[f92])).
% 0.14/5.41  fof(f94,plain,(
% 0.14/5.41    (~modus_ponens|(![Y]: ((![X]: (~is_a_theorem(X)|~is_a_theorem(implies(X,Y))))|is_a_theorem(Y))))&(modus_ponens|((is_a_theorem(sK1_skl)&is_a_theorem(implies(sK1_skl,sK0_skl)))&~is_a_theorem(sK0_skl)))),
% 0.14/5.41    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl]),skolemize(Y,sK0_skl),skolemize(X,sK1_skl)],[f93])).
% 0.14/5.41  fof(f95,plain,(
% 0.14/5.41    ![X0,X1]: (~modus_ponens|~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1))),
% 0.14/5.41    inference(cnf_transformation,[status(thm)],[f94])).
% 0.14/5.41  fof(f129,plain,(
% 0.14/5.41    (~and_3|(![X,Y]: is_a_theorem(implies(X,implies(Y,and(X,Y))))))&(and_3|(?[X,Y]: ~is_a_theorem(implies(X,implies(Y,and(X,Y))))))),
% 0.14/5.41    inference(NNF_transformation,[status(thm)],[f9])).
% 0.14/5.41  fof(f130,plain,(
% 0.14/5.41    (~and_3|(![X,Y]: is_a_theorem(implies(X,implies(Y,and(X,Y))))))&(and_3|~is_a_theorem(implies(sK17_skl,implies(sK18_skl,and(sK17_skl,sK18_skl)))))),
% 0.14/5.41    inference(skolemize,[status(esa),new_symbols(skolem,[sK17_skl,sK18_skl]),skolemize(X,sK17_skl),skolemize(Y,sK18_skl)],[f129])).
% 0.14/5.41  fof(f131,plain,(
% 0.14/5.41    ![X0,X1]: (~and_3|is_a_theorem(implies(X0,implies(X1,and(X0,X1)))))),
% 0.14/5.41    inference(cnf_transformation,[status(thm)],[f130])).
% 0.14/5.41  fof(f214,plain,(
% 0.14/5.41    modus_ponens),
% 0.14/5.41    inference(cnf_transformation,[status(thm)],[f35])).
% 0.14/5.41  fof(f221,plain,(
% 0.14/5.41    and_3),
% 0.14/5.41    inference(cnf_transformation,[status(thm)],[f42])).
% 0.14/5.41  fof(f243,plain,(
% 0.14/5.41    adjunction<=>(![X,Y]: ((~is_a_theorem(X)|~is_a_theorem(Y))|is_a_theorem(and(X,Y))))),
% 0.14/5.41    inference(pre_NNF_transformation,[status(thm)],[f52])).
% 0.14/5.41  fof(f244,plain,(
% 0.14/5.41    (~adjunction|(![X,Y]: ((~is_a_theorem(X)|~is_a_theorem(Y))|is_a_theorem(and(X,Y)))))&(adjunction|(?[X,Y]: ((is_a_theorem(X)&is_a_theorem(Y))&~is_a_theorem(and(X,Y)))))),
% 0.14/5.41    inference(NNF_transformation,[status(thm)],[f243])).
% 0.14/5.41  fof(f245,plain,(
% 0.14/5.41    (~adjunction|(![X,Y]: ((~is_a_theorem(X)|~is_a_theorem(Y))|is_a_theorem(and(X,Y)))))&(adjunction|((is_a_theorem(sK58_skl)&is_a_theorem(sK59_skl))&~is_a_theorem(and(sK58_skl,sK59_skl))))),
% 0.14/5.41    inference(skolemize,[status(esa),new_symbols(skolem,[sK58_skl,sK59_skl]),skolemize(X,sK58_skl),skolemize(Y,sK59_skl)],[f244])).
% 0.14/5.41  fof(f247,plain,(
% 0.14/5.41    adjunction|is_a_theorem(sK58_skl)),
% 0.14/5.41    inference(cnf_transformation,[status(thm)],[f245])).
% 0.14/5.41  fof(f248,plain,(
% 0.14/5.41    adjunction|is_a_theorem(sK59_skl)),
% 0.14/5.41    inference(cnf_transformation,[status(thm)],[f245])).
% 0.14/5.41  fof(f249,plain,(
% 0.14/5.41    adjunction|~is_a_theorem(and(sK58_skl,sK59_skl))),
% 0.14/5.41    inference(cnf_transformation,[status(thm)],[f245])).
% 0.14/5.42  fof(f352,plain,(
% 0.14/5.42    ~adjunction),
% 0.14/5.42    inference(cnf_transformation,[status(thm)],[f90])).
% 0.14/5.42  fof(f356,plain,(
% 0.14/5.42    ![X0,X1]: (~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1))),
% 0.14/5.42    inference(backward_subsumption_resolution,[status(thm)],[f95,f214])).
% 0.14/5.42  fof(f363,plain,(
% 0.14/5.42    ![X0,X1]: (is_a_theorem(implies(X0,implies(X1,and(X0,X1)))))),
% 0.14/5.42    inference(backward_subsumption_resolution,[status(thm)],[f131,f221])).
% 0.14/5.42  fof(f379,plain,(
% 0.14/5.42    ~is_a_theorem(and(sK58_skl,sK59_skl))),
% 0.14/5.42    inference(backward_subsumption_resolution,[status(thm)],[f249,f352])).
% 0.14/5.42  fof(f380,plain,(
% 0.14/5.42    is_a_theorem(sK59_skl)),
% 0.14/5.42    inference(backward_subsumption_resolution,[status(thm)],[f248,f352])).
% 0.14/5.42  fof(f381,plain,(
% 0.14/5.42    is_a_theorem(sK58_skl)),
% 0.14/5.42    inference(backward_subsumption_resolution,[status(thm)],[f247,f352])).
% 0.14/5.42  fof(f454,plain,(
% 0.14/5.42    ![X0,X1]: (~is_a_theorem(X0)|is_a_theorem(implies(X1,and(X0,X1))))),
% 0.14/5.42    inference(resolution,[status(thm)],[f363,f356])).
% 0.14/5.42  fof(f515,plain,(
% 0.14/5.42    ![X0,X1]: (~is_a_theorem(X0)|~is_a_theorem(X1)|is_a_theorem(and(X0,X1)))),
% 0.14/5.42    inference(resolution,[status(thm)],[f454,f356])).
% 0.14/5.42  fof(f551,plain,(
% 0.14/5.42    ~is_a_theorem(sK58_skl)|~is_a_theorem(sK59_skl)),
% 0.14/5.42    inference(resolution,[status(thm)],[f515,f379])).
% 0.14/5.42  fof(f557,plain,(
% 0.14/5.42    ~is_a_theorem(sK59_skl)),
% 0.14/5.42    inference(forward_subsumption_resolution,[status(thm)],[f551,f381])).
% 0.14/5.42  fof(f558,plain,(
% 0.14/5.42    $false),
% 0.14/5.42    inference(backward_subsumption_resolution,[status(thm)],[f380,f557])).
% 0.14/5.42  % SZS output end CNFRefutation for theBenchmark.p
% 0.14/5.44  % Elapsed time: 0.055328 seconds
% 0.14/5.44  % CPU time: 0.193153 seconds
% 0.14/5.44  % Total memory used: 72.255 MB
% 0.14/5.44  % Net memory used: 72.192 MB
%------------------------------------------------------------------------------