↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Computer : n006.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:06:41 PM UTC 2026

% Result   : Unsatisfiable 181.19s 23.31s
% Output   : CNFRefutation 153.89s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   25
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   55 (  26 unt;   2 def)
%            Number of atoms       :   91 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   75 (  39   ~;  34   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    4 (   3 usr;   3 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :  100 ( 100   !;   0   ?)

% 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,
    ! [X,Y,Z] : is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f3,axiom,
    ! [X] : is_a_theorem(implies(implies(not(X),X),X)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f4,axiom,
    ! [X,Y] : is_a_theorem(implies(X,implies(not(X),Y))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f5,negated_conjecture,
    ~ is_a_theorem(implies(implies(a,b),implies(not(b),not(a)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

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

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

fof(f9,plain,
    ! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)),
    inference(cnf_transformation,[status(thm)],[f3]) ).

fof(f10,plain,
    ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
    inference(cnf_transformation,[status(thm)],[f4]) ).

fof(f11,plain,
    ~ is_a_theorem(implies(implies(a,b),implies(not(b),not(a)))),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f23,plain,
    ! [X0,X1,X2] :
      ( is_a_theorem(implies(implies(X1,X2),implies(X0,X2)))
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[status(thm)],[f8,f7]) ).

fof(f24,plain,
    ! [X0,X1,X2] :
      ( is_a_theorem(implies(X0,X2))
      | ~ is_a_theorem(implies(X1,X2))
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[status(thm)],[f23,f7]) ).

fof(f26,plain,
    ! [X0] :
      ( ~ is_a_theorem(implies(X0,implies(not(b),not(a))))
      | ~ is_a_theorem(implies(implies(a,b),X0)) ),
    inference(resolution,[status(thm)],[f24,f11]) ).

fof(f114,plain,
    ! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(not(X0),X0),X1))),
    inference(resolution,[status(thm)],[f23,f9]) ).

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

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

fof(f120,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(implies(not(X0),X0),X1))
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[status(thm)],[f114,f7]) ).

fof(f127,plain,
    ! [X0,X1,X2] :
      ( is_a_theorem(implies(X0,X2))
      | ~ is_a_theorem(implies(implies(not(X0),X1),X2)) ),
    inference(resolution,[status(thm)],[f116,f7]) ).

fof(f147,plain,
    ! [X0,X1,X2,X3] :
      ( is_a_theorem(implies(X0,implies(X1,X3)))
      | ~ is_a_theorem(implies(X0,implies(implies(not(X1),X2),X3))) ),
    inference(resolution,[status(thm)],[f24,f116]) ).

fof(f149,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(X0,X1))
      | ~ is_a_theorem(implies(X0,implies(not(X1),X1))) ),
    inference(resolution,[status(thm)],[f24,f9]) ).

fof(f159,plain,
    ! [X0,X1,X2] : is_a_theorem(implies(X0,implies(implies(X1,X2),implies(not(X0),X2)))),
    inference(resolution,[status(thm)],[f127,f8]) ).

fof(f311,plain,
    ! [X0,X1,X2] :
      ( is_a_theorem(implies(implies(X1,X2),implies(not(X0),X2)))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[status(thm)],[f159,f7]) ).

fof(f320,plain,
    ! [X0,X1,X2,X3] :
      ( is_a_theorem(implies(implies(X2,X0),X3))
      | ~ is_a_theorem(implies(implies(implies(X0,X1),implies(X2,X1)),X3)) ),
    inference(resolution,[status(thm)],[f115,f7]) ).

fof(f444,plain,
    ! [X0] :
      ( ~ is_a_theorem(implies(X0,a))
      | ~ is_a_theorem(implies(implies(X0,b),implies(not(b),not(a)))) ),
    inference(resolution,[status(thm)],[f26,f23]) ).

fof(f489,plain,
    ! [X0,X1,X2,X3] :
      ( ~ is_a_theorem(implies(X3,X1))
      | is_a_theorem(implies(X0,implies(X3,X2)))
      | ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
    inference(resolution,[status(thm)],[f24,f23]) ).

fof(f635,plain,
    ! [X0,X1,X2] :
      ( ~ is_a_theorem(X1)
      | is_a_theorem(implies(X0,implies(not(X1),X2))) ),
    inference(resolution,[status(thm)],[f127,f311]) ).

fof(f677,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(not(X1),X0))
      | is_a_theorem(implies(implies(X0,X1),X1)) ),
    inference(resolution,[status(thm)],[f149,f23]) ).

fof(f688,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(X1)
      | is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[status(thm)],[f149,f635]) ).

fof(f695,plain,
    ! [X0,X1] : is_a_theorem(implies(X0,implies(implies(not(X1),X1),X1))),
    inference(resolution,[status(thm)],[f688,f9]) ).

fof(f924,plain,
    ! [X0,X1] :
      ( is_a_theorem(X1)
      | ~ is_a_theorem(implies(not(X0),X0))
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[status(thm)],[f120,f7]) ).

fof(f1127,plain,
    ! [X0,X1] : is_a_theorem(implies(implies(implies(implies(not(X0),X0),X0),X1),X1)),
    inference(resolution,[status(thm)],[f677,f695]) ).

fof(f2668,plain,
    ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(not(X1),X1)),implies(X0,X1))),
    inference(resolution,[status(thm)],[f320,f1127]) ).

fof(f2866,plain,
    ! [X0,X1] : is_a_theorem(implies(implies(not(X0),X1),implies(implies(X1,X0),X0))),
    inference(resolution,[status(thm)],[f2668,f320]) ).

fof(f3239,plain,
    ! [X0,X1] : is_a_theorem(implies(X0,implies(implies(X1,X0),X0))),
    inference(resolution,[status(thm)],[f2866,f127]) ).

fof(f3268,plain,
    ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
    inference(resolution,[status(thm)],[f3239,f147]) ).

fof(f3299,plain,
    ! [X0,X1,X2] : is_a_theorem(implies(X0,implies(X1,implies(X2,X1)))),
    inference(resolution,[status(thm)],[f3268,f688]) ).

fof(f3313,plain,
    ! [X0,X1,X2] :
      ( is_a_theorem(X2)
      | ~ is_a_theorem(implies(implies(X0,implies(X1,X0)),X2)) ),
    inference(resolution,[status(thm)],[f3299,f924]) ).

fof(f3470,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(X0,a))
      | ~ is_a_theorem(implies(not(b),X1))
      | ~ is_a_theorem(implies(implies(X0,b),implies(X1,not(a)))) ),
    inference(resolution,[status(thm)],[f489,f444]) ).

fof(f3925,plain,
    ! [X0,X1,X2] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,X2))),
    inference(resolution,[status(thm)],[f3313,f8]) ).

fof(f4508,plain,
    ! [X0,X1,X2] :
      ( is_a_theorem(implies(X1,X2))
      | ~ is_a_theorem(implies(implies(X0,X1),X2)) ),
    inference(resolution,[status(thm)],[f3925,f7]) ).

fof(f6051,plain,
    ! [X0,X1] : is_a_theorem(implies(X0,implies(implies(X0,X1),X1))),
    inference(resolution,[status(thm)],[f4508,f2866]) ).

fof(f6130,plain,
    ! [X0,X1] : is_a_theorem(implies(not(X0),implies(X0,X1))),
    inference(resolution,[status(thm)],[f6051,f147]) ).

fof(f6141,plain,
    ! [X0] : is_a_theorem(implies(not(not(X0)),X0)),
    inference(resolution,[status(thm)],[f6130,f149]) ).

fof(f39206,plain,
    ( ~ is_a_theorem(implies(not(not(a)),a))
    | ~ is_a_theorem(implies(not(b),implies(b,not(a)))) ),
    inference(resolution,[status(thm)],[f3470,f2866]) ).

fof(f39271,definition,
    ( sQ699_spl
  <=> is_a_theorem(implies(not(b),implies(b,not(a)))) ),
    introduced(definition,[new_symbols(definition,[sQ699_spl])],[split_symbol_definition]) ).

fof(f39273,plain,
    ( sQ699_spl
    | ~ is_a_theorem(implies(not(b),implies(b,not(a)))) ),
    inference(component_clause,[status(thm)],[f39271]) ).

fof(f39279,definition,
    ( sQ701_spl
  <=> is_a_theorem(implies(not(not(a)),a)) ),
    introduced(definition,[new_symbols(definition,[sQ701_spl])],[split_symbol_definition]) ).

fof(f39281,plain,
    ( sQ701_spl
    | ~ is_a_theorem(implies(not(not(a)),a)) ),
    inference(component_clause,[status(thm)],[f39279]) ).

fof(f39282,plain,
    ( ~ sQ701_spl
    | ~ sQ699_spl ),
    inference(split_clause,[status(thm)],[f39206,f39271,f39279]) ).

fof(f39345,plain,
    ( sQ699_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f39273,f6130]) ).

fof(f39346,plain,
    sQ699_spl,
    inference(contradiction_clause,[status(thm)],[f39345]) ).

fof(f39347,plain,
    ( sQ701_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f39281,f6141]) ).

fof(f39348,plain,
    sQ701_spl,
    inference(contradiction_clause,[status(thm)],[f39347]) ).

fof(f39349,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f39282,f39346,f39348]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL058-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.34  % Computer : n006.cluster.edu
% 0.09/0.34  % Model    : x86_64 x86_64
% 0.09/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34  % Memory   : 8046.5625MB
% 0.09/0.34  % OS       : Linux 6.8.0-71-generic
% 0.09/0.34  % CPULimit : 300
% 0.09/0.34  % WCLimit  : 300
% 0.09/0.34  % DateTime : Mon Sep 21 00:02:12 UTC 2026
% 0.09/0.34  % CPUTime  : 
% 0.09/0.35  % Drodi V4.1.1
% 181.19/23.31  % Refutation found
% 181.19/23.31  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 181.19/23.31  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 68.67/23.41  % Elapsed time: 23.052109 seconds
% 68.67/23.41  % CPU time: 182.278340 seconds
% 68.67/23.41  % Total memory used: 789.669 MB
% 68.67/23.41  % Net memory used: 697.958 MB
%------------------------------------------------------------------------------