↑ 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  : LCL469+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 : n009.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:08 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL469+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.11/5.38  % Computer : n009.cluster.edu
% 0.11/5.38  % Model    : x86_64 x86_64
% 0.11/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38  % Memory   : 8046.5625MB
% 0.11/5.38  % OS       : Linux 6.8.0-71-generic
% 0.11/5.38  % CPULimit : 300
% 0.11/5.38  % WCLimit  : 300
% 0.11/5.38  % DateTime : Mon Sep 21 00:35:17 UTC 2026
% 0.11/5.38  % CPUTime  : 
% 0.11/5.40  % Drodi V4.1.1
% 0.15/5.41  % Refutation found
% 0.15/5.41  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.15/5.41  % SZS output start CNFRefutation for theBenchmark
% 0.15/5.41  fof(f10,axiom,(
% 0.15/5.41    ( or_1<=> (! [X,Y] : is_a_theorem(implies(X,or(X,Y))) )) ),
% 0.15/5.41    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.15/5.41  fof(f20,axiom,(
% 0.15/5.41    ( cn2<=> (! [P,Q] : is_a_theorem(implies(P,implies(not(P),Q))) )) ),
% 0.15/5.41    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.15/5.41  fof(f27,axiom,(
% 0.15/5.41    ( op_or=> (! [X,Y] : or(X,Y) = not(and(not(X),not(Y))) )) ),
% 0.15/5.41    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.15/5.41  fof(f29,axiom,(
% 0.15/5.41    ( op_implies_and=> (! [X,Y] : implies(X,Y) = not(and(X,not(Y))) )) ),
% 0.15/5.41    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.15/5.41  fof(f32,axiom,(
% 0.15/5.41    op_or ),
% 0.15/5.41    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.15/5.41  fof(f37,axiom,(
% 0.15/5.41    cn2 ),
% 0.15/5.41    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.15/5.41  fof(f41,axiom,(
% 0.15/5.41    op_implies_and ),
% 0.15/5.41    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.15/5.41  fof(f43,conjecture,(
% 0.15/5.41    or_1 ),
% 0.15/5.41    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.15/5.41  fof(f44,negated_conjecture,(
% 0.15/5.41    ~(or_1 )),
% 0.15/5.41    inference(negated_conjecture,[status(cth)],[f43])).
% 0.15/5.41  fof(f87,plain,(
% 0.15/5.41    (~or_1|(![X,Y]: is_a_theorem(implies(X,or(X,Y)))))&(or_1|(?[X,Y]: ~is_a_theorem(implies(X,or(X,Y)))))),
% 0.15/5.41    inference(NNF_transformation,[status(thm)],[f10])).
% 0.15/5.41  fof(f88,plain,(
% 0.15/5.41    (~or_1|(![X,Y]: is_a_theorem(implies(X,or(X,Y)))))&(or_1|~is_a_theorem(implies(sK19_skl,or(sK19_skl,sK20_skl))))),
% 0.15/5.41    inference(skolemize,[status(esa),new_symbols(skolem,[sK19_skl,sK20_skl]),skolemize(X,sK19_skl),skolemize(Y,sK20_skl)],[f87])).
% 0.15/5.41  fof(f90,plain,(
% 0.15/5.41    or_1|~is_a_theorem(implies(sK19_skl,or(sK19_skl,sK20_skl)))),
% 0.15/5.41    inference(cnf_transformation,[status(thm)],[f88])).
% 0.15/5.41  fof(f127,plain,(
% 0.15/5.41    (~cn2|(![P,Q]: is_a_theorem(implies(P,implies(not(P),Q)))))&(cn2|(?[P,Q]: ~is_a_theorem(implies(P,implies(not(P),Q)))))),
% 0.15/5.41    inference(NNF_transformation,[status(thm)],[f20])).
% 0.15/5.41  fof(f128,plain,(
% 0.15/5.41    (~cn2|(![P,Q]: is_a_theorem(implies(P,implies(not(P),Q)))))&(cn2|~is_a_theorem(implies(sK41_skl,implies(not(sK41_skl),sK42_skl))))),
% 0.15/5.41    inference(skolemize,[status(esa),new_symbols(skolem,[sK41_skl,sK42_skl]),skolemize(P,sK41_skl),skolemize(Q,sK42_skl)],[f127])).
% 0.15/5.41  fof(f129,plain,(
% 0.15/5.41    ![X0,X1]: (~cn2|is_a_theorem(implies(X0,implies(not(X0),X1))))),
% 0.15/5.41    inference(cnf_transformation,[status(thm)],[f128])).
% 0.15/5.41  fof(f155,plain,(
% 0.15/5.41    ~op_or|(![X,Y]: or(X,Y)=not(and(not(X),not(Y))))),
% 0.15/5.41    inference(pre_NNF_transformation,[status(thm)],[f27])).
% 0.15/5.41  fof(f156,plain,(
% 0.15/5.41    ![X0,X1]: (~op_or|or(X0,X1)=not(and(not(X0),not(X1))))),
% 0.15/5.41    inference(cnf_transformation,[status(thm)],[f155])).
% 0.15/5.41  fof(f159,plain,(
% 0.15/5.41    ~op_implies_and|(![X,Y]: implies(X,Y)=not(and(X,not(Y))))),
% 0.15/5.41    inference(pre_NNF_transformation,[status(thm)],[f29])).
% 0.15/5.41  fof(f160,plain,(
% 0.15/5.41    ![X0,X1]: (~op_implies_and|implies(X0,X1)=not(and(X0,not(X1))))),
% 0.15/5.41    inference(cnf_transformation,[status(thm)],[f159])).
% 0.15/5.41  fof(f165,plain,(
% 0.15/5.41    op_or),
% 0.15/5.41    inference(cnf_transformation,[status(thm)],[f32])).
% 0.15/5.41  fof(f170,plain,(
% 0.15/5.41    cn2),
% 0.15/5.41    inference(cnf_transformation,[status(thm)],[f37])).
% 0.15/5.41  fof(f174,plain,(
% 0.15/5.41    op_implies_and),
% 0.15/5.41    inference(cnf_transformation,[status(thm)],[f41])).
% 0.15/5.41  fof(f176,plain,(
% 0.15/5.41    ~or_1),
% 0.15/5.41    inference(cnf_transformation,[status(thm)],[f44])).
% 0.15/5.41  fof(f181,plain,(
% 0.15/5.41    ~is_a_theorem(implies(sK19_skl,or(sK19_skl,sK20_skl)))),
% 0.15/5.41    inference(forward_subsumption_resolution,[status(thm)],[f90,f176])).
% 0.15/5.41  fof(f185,plain,(
% 0.15/5.41    ![X0,X1]: (is_a_theorem(implies(X0,implies(not(X0),X1))))),
% 0.15/5.41    inference(forward_subsumption_resolution,[status(thm)],[f129,f170])).
% 0.15/5.41  fof(f192,plain,(
% 0.15/5.41    ![X0,X1]: (implies(X0,X1)=not(and(X0,not(X1))))),
% 0.15/5.41    inference(forward_subsumption_resolution,[status(thm)],[f160,f174])).
% 0.15/5.41  fof(f197,plain,(
% 0.15/5.41    ![X0,X1]: (~op_or|or(X0,X1)=implies(not(X0),X1))),
% 0.15/5.41    inference(forward_demodulation,[status(thm)],[f192,f156])).
% 0.15/5.41  fof(f205,plain,(
% 0.15/5.41    ![X0,X1]: (is_a_theorem(implies(X0,or(X0,X1))))),
% 0.15/5.41    inference(backward_demodulation,[status(thm)],[f206,f185])).
% 0.15/5.41  fof(f206,plain,(
% 0.15/5.41    ![X0,X1]: (or(X0,X1)=implies(not(X0),X1))),
% 0.15/5.41    inference(forward_subsumption_resolution,[status(thm)],[f197,f165])).
% 0.15/5.41  fof(f222,plain,(
% 0.15/5.41    $false),
% 0.15/5.41    inference(backward_subsumption_resolution,[status(thm)],[f181,f205])).
% 0.15/5.41  % SZS output end CNFRefutation for theBenchmark.p
% 0.15/5.45  % Elapsed time: 0.061700 seconds
% 0.15/5.45  % CPU time: 0.135226 seconds
% 0.15/5.45  % Total memory used: 51.972 MB
% 0.15/5.45  % Net memory used: 51.948 MB
%------------------------------------------------------------------------------