↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Computer : n012.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:09:11 PM UTC 2026

% Result   : Theorem 0.03s 0.32s
% Output   : CNFRefutation 0.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   18 (  12 unt;   0 def)
%            Number of atoms       :   27 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   22 (  13   ~;   9   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   6 avg)
%            Maximal term depth    :   13 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   72 (  69   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X,Y] :
      ( is_a_theorem(Y)
      | ~ is_a_theorem(X)
      | ~ is_a_theorem(implies(X,Y)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f2,axiom,
    ! [A,B,C,D,E] : is_a_theorem(implies(implies(A,B),implies(implies(implies(C,implies(D,E)),implies(B,implies(not(D),not(A)))),implies(A,D)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f3,conjecture,
    ! [A,B,C] : is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f4,negated_conjecture,
    ~ ! [A,B,C] : is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))),
    inference(negated_conjecture,[status(cth)],[f3]) ).

fof(f5,plain,
    ! [Y] :
      ( is_a_theorem(Y)
      | ! [X] :
          ( ~ is_a_theorem(X)
          | ~ is_a_theorem(implies(X,Y)) ) ),
    inference(miniscoping,[status(thm)],[f1]) ).

fof(f6,plain,
    ! [X0,X1] :
      ( is_a_theorem(X1)
      | ~ is_a_theorem(X0)
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f7,plain,
    ! [X0,X1,X2,X3,X4] : is_a_theorem(implies(implies(X0,X1),implies(implies(implies(X2,implies(X3,X4)),implies(X1,implies(not(X3),not(X0)))),implies(X0,X3)))),
    inference(cnf_transformation,[status(thm)],[f2]) ).

fof(f8,plain,
    ? [A,B,C] : ~ is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))),
    inference(pre_NNF_transformation,[status(thm)],[f4]) ).

fof(f9,plain,
    ~ is_a_theorem(implies(implies(sK0_skl,sK1_skl),implies(implies(sK1_skl,sK2_skl),implies(sK0_skl,sK2_skl)))),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl,sK2_skl]),skolemize(A,sK0_skl),skolemize(B,sK1_skl),skolemize(C,sK2_skl)],[f8]) ).

fof(f10,plain,
    ~ is_a_theorem(implies(implies(sK0_skl,sK1_skl),implies(implies(sK1_skl,sK2_skl),implies(sK0_skl,sK2_skl)))),
    inference(cnf_transformation,[status(thm)],[f9]) ).

fof(f11,plain,
    ! [X0,X1,X2,X3,X4] :
      ( is_a_theorem(implies(implies(implies(X2,implies(X3,X4)),implies(X1,implies(not(X3),not(X0)))),implies(X0,X3)))
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[status(thm)],[f7,f6]) ).

fof(f12,plain,
    ! [X0,X1,X2,X3,X4,X5,X6,X7] : is_a_theorem(implies(implies(implies(X0,implies(X1,X2)),implies(implies(implies(implies(X3,implies(X4,X5)),implies(X6,implies(not(X4),not(X7)))),implies(X7,X4)),implies(not(X1),not(implies(X7,X6))))),implies(implies(X7,X6),X1))),
    inference(resolution,[status(thm)],[f11,f7]) ).

fof(f13,plain,
    ! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] : is_a_theorem(implies(implies(implies(X0,implies(X1,X2)),implies(implies(implies(X3,X4),X5),implies(not(X1),not(implies(implies(X6,implies(X5,X7)),implies(implies(implies(implies(X8,implies(X9,X10)),implies(X4,implies(not(X9),not(X3)))),implies(X3,X9)),implies(not(X5),not(implies(X3,X4))))))))),implies(implies(implies(X6,implies(X5,X7)),implies(implies(implies(implies(X8,implies(X9,X10)),implies(X4,implies(not(X9),not(X3)))),implies(X3,X9)),implies(not(X5),not(implies(X3,X4))))),X1))),
    inference(resolution,[status(thm)],[f12,f11]) ).

fof(f14,plain,
    ! [X0,X1,X2,X3,X4,X5,X6,X7] :
      ( is_a_theorem(implies(implies(X7,X6),X1))
      | ~ is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(implies(implies(X3,implies(X4,X5)),implies(X6,implies(not(X4),not(X7)))),implies(X7,X4)),implies(not(X1),not(implies(X7,X6)))))) ),
    inference(resolution,[status(thm)],[f12,f6]) ).

fof(f18,plain,
    ! [X0,X1,X2,X3,X4,X5] : is_a_theorem(implies(implies(implies(implies(implies(X0,implies(X1,X2)),implies(X3,implies(not(X1),not(X4)))),implies(X4,X1)),X5),implies(implies(X4,X3),X5))),
    inference(resolution,[status(thm)],[f13,f14]) ).

fof(f22,plain,
    ! [X0,X1,X2,X3,X4,X5] :
      ( is_a_theorem(implies(implies(X4,X3),X5))
      | ~ is_a_theorem(implies(implies(implies(implies(X0,implies(X1,X2)),implies(X3,implies(not(X1),not(X4)))),implies(X4,X1)),X5)) ),
    inference(resolution,[status(thm)],[f18,f6]) ).

fof(f23,plain,
    ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
    inference(resolution,[status(thm)],[f22,f18]) ).

fof(f29,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[f10,f23]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : LCL982+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.02  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.29  % Computer : n012.cluster.edu
% 0.03/0.29  % Model    : x86_64 x86_64
% 0.03/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.29  % Memory   : 8046.5625MB
% 0.03/0.29  % OS       : Linux 6.8.0-71-generic
% 0.03/0.30  % CPULimit : 300
% 0.03/0.30  % WCLimit  : 300
% 0.03/0.30  % DateTime : Mon Sep 21 01:15:21 UTC 2026
% 0.03/0.30  % CPUTime  : 
% 0.03/0.30  % Drodi V4.1.1
% 0.03/0.32  % Refutation found
% 0.03/0.32  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.03/0.32  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.08/0.33  % Elapsed time: 0.031490 seconds
% 0.08/0.33  % CPU time: 0.078920 seconds
% 0.08/0.33  % Total memory used: 55.954 MB
% 0.08/0.33  % Net memory used: 55.388 MB
%------------------------------------------------------------------------------