↑ Up

Drodi---4.1.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : LCL099-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 : n010.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:48 PM UTC 2026

% Result   : Unsatisfiable 13.57s 2.12s
% Output   : CNFRefutation 13.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   22
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   55 (  30 unt;   0 def)
%            Number of atoms       :   88 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   79 (  46   ~;  33   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :  153 ( 153   !;   0   ?)

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

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

fof(f3,axiom,
    ! [X,Y,Z,U,V] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),U),equivalent(equivalent(Y,Z),U)),V),V)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f4,negated_conjecture,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,a),c)),equivalent(equivalent(e,a),falsehood)),equivalent(equivalent(equivalent(equivalent(a,b),e),c),falsehood))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

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

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

fof(f8,plain,
    ! [X0,X1,X2,X3,X4] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),X4),X4)),
    inference(cnf_transformation,[status(thm)],[f3]) ).

fof(f9,plain,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,a),c)),equivalent(equivalent(e,a),falsehood)),equivalent(equivalent(equivalent(equivalent(a,b),e),c),falsehood))),
    inference(cnf_transformation,[status(thm)],[f4]) ).

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

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

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

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

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

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

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

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

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

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

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

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

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

fof(f40,plain,
    ! [X0,X1,X2,X3,X4] :
      ( is_a_theorem(equivalent(equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X4)),X0),equivalent(equivalent(X3,X4),X1)))
      | ~ is_a_theorem(equivalent(X0,X1)) ),
    inference(resolution,[status(thm)],[f25,f6]) ).

fof(f42,plain,
    ! [X0,X1,X2,X3] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),equivalent(X2,X3))),equivalent(X1,X3))),
    inference(resolution,[status(thm)],[f26,f10]) ).

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

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

fof(f50,plain,
    ! [X0,X1,X2,X3] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(equivalent(X3,X0),equivalent(X3,X1)),X2))),
    inference(resolution,[status(thm)],[f37,f7]) ).

fof(f59,plain,
    ! [X0,X1,X2,X3] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X2),equivalent(equivalent(X3,X0),equivalent(X3,X1))))),
    inference(resolution,[status(thm)],[f37,f27]) ).

fof(f60,plain,
    ! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),equivalent(X2,X1)))),
    inference(resolution,[status(thm)],[f37,f20]) ).

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

fof(f66,plain,
    ! [X0,X1,X2,X3] :
      ( is_a_theorem(equivalent(equivalent(equivalent(X3,X0),equivalent(X3,X1)),X2))
      | ~ is_a_theorem(equivalent(equivalent(X0,X1),X2)) ),
    inference(resolution,[status(thm)],[f64,f10]) ).

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

fof(f72,plain,
    ! [X0] :
      ( ~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,a),c)),equivalent(equivalent(e,a),falsehood)),X0))
      | ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(equivalent(a,b),e),c),falsehood))) ),
    inference(resolution,[status(thm)],[f69,f9]) ).

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

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

fof(f134,plain,
    ! [X0] : ~ is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(equivalent(b,a),c)),equivalent(equivalent(a,X0),equivalent(equivalent(e,a),falsehood))),equivalent(equivalent(equivalent(equivalent(a,b),e),c),falsehood))),
    inference(resolution,[status(thm)],[f72,f12]) ).

fof(f144,plain,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,a),equivalent(equivalent(a,b),e))),equivalent(equivalent(e,a),falsehood)),falsehood)),
    inference(resolution,[status(thm)],[f134,f40]) ).

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

fof(f215,plain,
    ! [X0] :
      ( ~ is_a_theorem(equivalent(equivalent(equivalent(e,a),falsehood),X0))
      | ~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,a),equivalent(equivalent(a,b),e))),X0),falsehood)) ),
    inference(resolution,[status(thm)],[f46,f144]) ).

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

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

fof(f333,plain,
    ! [X0] :
      ( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(b,a),equivalent(equivalent(a,b),e)),X0),falsehood))
      | ~ is_a_theorem(equivalent(equivalent(equivalent(e,a),falsehood),equivalent(a,X0))) ),
    inference(resolution,[status(thm)],[f215,f66]) ).

fof(f358,plain,
    ! [X0,X1,X2] :
      ( is_a_theorem(X2)
      | ~ is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X1),X0)),X2)) ),
    inference(resolution,[status(thm)],[f79,f12]) ).

fof(f455,plain,
    ! [X0,X1,X2] :
      ( ~ is_a_theorem(equivalent(equivalent(equivalent(X2,X2),X0),X1))
      | is_a_theorem(equivalent(X0,X1)) ),
    inference(resolution,[status(thm)],[f358,f64]) ).

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

fof(f832,plain,
    ! [X0] :
      ( ~ is_a_theorem(equivalent(falsehood,equivalent(e,X0)))
      | ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(b,a),equivalent(equivalent(a,b),e)),X0),falsehood)) ),
    inference(resolution,[status(thm)],[f333,f43]) ).

fof(f840,plain,
    ! [X0] : ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(b,a),equivalent(equivalent(a,b),e)),equivalent(equivalent(e,equivalent(X0,X0)),falsehood)),falsehood)),
    inference(resolution,[status(thm)],[f832,f259]) ).

fof(f845,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(equivalent(equivalent(equivalent(e,equivalent(X1,X1)),falsehood),X0))
      | ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(b,a),equivalent(equivalent(a,b),e)),X0),falsehood)) ),
    inference(resolution,[status(thm)],[f840,f46]) ).

fof(f1236,plain,
    ! [X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X0),X1),X1)),
    inference(resolution,[status(thm)],[f201,f50]) ).

fof(f1319,plain,
    ! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(X1,X1)),equivalent(X0,X2)),X2)),
    inference(resolution,[status(thm)],[f1236,f201]) ).

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

fof(f1672,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),e),X1),falsehood))
      | ~ is_a_theorem(equivalent(equivalent(equivalent(e,equivalent(X0,X0)),falsehood),equivalent(equivalent(b,a),X1))) ),
    inference(resolution,[status(thm)],[f845,f66]) ).

fof(f2561,plain,
    ! [X0] : ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),e),equivalent(equivalent(a,b),equivalent(equivalent(e,equivalent(X0,X0)),falsehood))),falsehood)),
    inference(resolution,[status(thm)],[f1672,f602]) ).

fof(f3426,plain,
    ! [X0] : ~ is_a_theorem(equivalent(equivalent(e,equivalent(equivalent(e,equivalent(X0,X0)),falsehood)),falsehood)),
    inference(resolution,[status(thm)],[f2561,f66]) ).

fof(f3435,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f3426,f1339]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL099-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n010.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Mon Sep 21 00:04:54 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.13/0.36  % Drodi V4.1.1
% 13.57/2.12  % Refutation found
% 13.57/2.12  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 13.57/2.12  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 13.57/2.16  % Elapsed time: 1.789812 seconds
% 13.57/2.16  % CPU time: 13.874192 seconds
% 13.57/2.16  % Total memory used: 190.963 MB
% 13.57/2.16  % Net memory used: 172.477 MB
%------------------------------------------------------------------------------