↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Computer : n017.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:35 PM UTC 2026

% Result   : Unsatisfiable 0.09s 0.41s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   28 (  15 unt;   0 def)
%            Number of atoms       :   46 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   40 (  22   ~;  18   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   5 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   64 (  64   !;   0   ?)

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

fof(f2,axiom,
    ! [X,Y,Z] : is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Y),equivalent(X,Z)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f3,negated_conjecture,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(a,equivalent(b,c)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

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

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

fof(f7,plain,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(a,equivalent(b,c)))),
    inference(cnf_transformation,[status(thm)],[f3]) ).

fof(f8,plain,
    ! [X0,X1,X2] :
      ( is_a_theorem(equivalent(equivalent(X2,X1),equivalent(X0,X2)))
      | ~ is_a_theorem(equivalent(X0,X1)) ),
    inference(resolution,[status(thm)],[f6,f5]) ).

fof(f9,plain,
    ! [X0,X1,X2,X3] : is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X3,X1))),equivalent(equivalent(X3,X2),X0))),
    inference(resolution,[status(thm)],[f8,f6]) ).

fof(f11,plain,
    ! [X0,X1,X2,X3] :
      ( is_a_theorem(equivalent(equivalent(X3,X2),X0))
      | ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X3,X1)))) ),
    inference(resolution,[status(thm)],[f9,f5]) ).

fof(f12,plain,
    ! [X0,X1,X2,X3] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,X2),equivalent(equivalent(X3,X1),equivalent(X2,X3))))),
    inference(resolution,[status(thm)],[f11,f9]) ).

fof(f13,plain,
    ! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X1))),
    inference(resolution,[status(thm)],[f11,f6]) ).

fof(f15,plain,
    ! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(equivalent(X1,X2),X0))),
    inference(resolution,[status(thm)],[f13,f8]) ).

fof(f17,plain,
    ! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,X2),equivalent(X2,X1)))),
    inference(resolution,[status(thm)],[f15,f11]) ).

fof(f19,plain,
    ! [X0,X1,X2] :
      ( is_a_theorem(equivalent(equivalent(X1,X2),X0))
      | ~ is_a_theorem(equivalent(X0,equivalent(X1,X2))) ),
    inference(resolution,[status(thm)],[f15,f5]) ).

fof(f20,plain,
    ! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,X0),equivalent(X1,X1))),
    inference(resolution,[status(thm)],[f17,f11]) ).

fof(f22,plain,
    ! [X0,X1,X2] :
      ( is_a_theorem(equivalent(equivalent(X0,X2),equivalent(X2,X1)))
      | ~ is_a_theorem(equivalent(X0,X1)) ),
    inference(resolution,[status(thm)],[f17,f5]) ).

fof(f25,plain,
    ! [X0,X1] :
      ( is_a_theorem(equivalent(X1,X1))
      | ~ is_a_theorem(equivalent(X0,X0)) ),
    inference(resolution,[status(thm)],[f20,f5]) ).

fof(f27,plain,
    ! [X0,X1,X2] :
      ( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X2,X1)))
      | ~ is_a_theorem(equivalent(X0,X0)) ),
    inference(resolution,[status(thm)],[f25,f8]) ).

fof(f32,plain,
    ! [X0,X1,X2] :
      ( is_a_theorem(X0)
      | ~ is_a_theorem(equivalent(X1,X2))
      | ~ is_a_theorem(equivalent(X0,equivalent(X1,X2))) ),
    inference(resolution,[status(thm)],[f19,f5]) ).

fof(f35,plain,
    ! [X0,X1,X2] :
      ( is_a_theorem(equivalent(X2,X1))
      | ~ is_a_theorem(equivalent(X0,X2))
      | ~ is_a_theorem(equivalent(X0,X1)) ),
    inference(resolution,[status(thm)],[f22,f5]) ).

fof(f39,plain,
    ! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X2,X0),X1))),
    inference(resolution,[status(thm)],[f12,f11]) ).

fof(f57,plain,
    ! [X0,X1,X2] :
      ( is_a_theorem(X0)
      | ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X1),equivalent(X2,X2)))) ),
    inference(resolution,[status(thm)],[f32,f20]) ).

fof(f61,plain,
    ! [X0] :
      ( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(a,b),c)))
      | ~ is_a_theorem(equivalent(X0,equivalent(a,equivalent(b,c)))) ),
    inference(resolution,[status(thm)],[f35,f7]) ).

fof(f88,plain,
    ! [X0] : is_a_theorem(equivalent(X0,X0)),
    inference(resolution,[status(thm)],[f57,f12]) ).

fof(f102,plain,
    ! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X1,X0))),
    inference(backward_subsumption_resolution,[status(thm)],[f27,f88]) ).

fof(f152,plain,
    ~ is_a_theorem(equivalent(equivalent(equivalent(b,c),a),equivalent(equivalent(a,b),c))),
    inference(resolution,[status(thm)],[f102,f61]) ).

fof(f158,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f152,f39]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL009-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.37  % Computer : n017.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Sun Sep 20 23:55:12 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.38  % Drodi V4.1.1
% 0.09/0.41  % Refutation found
% 0.09/0.41  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.09/0.41  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.09/0.43  % Elapsed time: 0.045216 seconds
% 0.09/0.43  % CPU time: 0.151284 seconds
% 0.09/0.43  % Total memory used: 48.028 MB
% 0.09/0.43  % Net memory used: 47.452 MB
%------------------------------------------------------------------------------