↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Computer : n015.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 02:39:39 PM UTC 2026

% Result   : Unsatisfiable 0.11s 0.42s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   38 (  13 unt;   0 def)
%            Number of atoms       :   74 (  38 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   69 (  33   ~;  36   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   10 (  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f8,axiom,
    ssList(nil),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f82,axiom,
    ! [U] :
      ( nil = U
      | ~ ssList(U)
      | ~ rearsegP(nil,U) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f115,axiom,
    ! [U,V] :
      ( ~ ssList(U)
      | ~ ssList(V)
      | ~ neq(U,V)
      | U != V ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f188,negated_conjecture,
    ssList(sk3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f190,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f191,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f192,negated_conjecture,
    ( nil = sk1
    | nil = sk2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f195,negated_conjecture,
    ( nil != sk2
    | nil != sk1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f196,negated_conjecture,
    ( neq(sk3,nil)
    | nil = sk4 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f199,negated_conjecture,
    ( rearsegP(sk4,sk3)
    | nil = sk3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f207,plain,
    ssList(nil),
    inference(cnf_transformation,[status(thm)],[f8]) ).

fof(f282,plain,
    ! [X0] :
      ( nil = X0
      | ~ ssList(X0)
      | ~ rearsegP(nil,X0) ),
    inference(cnf_transformation,[status(thm)],[f82]) ).

fof(f320,plain,
    ! [U] :
      ( ~ ssList(U)
      | ! [V] :
          ( ~ ssList(V)
          | ~ neq(U,V)
          | U != V ) ),
    inference(miniscoping,[status(thm)],[f115]) ).

fof(f321,plain,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | ~ ssList(X1)
      | ~ neq(X0,X1)
      | X0 != X1 ),
    inference(cnf_transformation,[status(thm)],[f320]) ).

fof(f432,plain,
    ssList(sk3),
    inference(cnf_transformation,[status(thm)],[f188]) ).

fof(f434,plain,
    sk2 = sk4,
    inference(cnf_transformation,[status(thm)],[f190]) ).

fof(f435,plain,
    sk1 = sk3,
    inference(cnf_transformation,[status(thm)],[f191]) ).

fof(f436,plain,
    ( nil = sk1
    | nil = sk2 ),
    inference(cnf_transformation,[status(thm)],[f192]) ).

fof(f439,plain,
    ( nil != sk2
    | nil != sk1 ),
    inference(cnf_transformation,[status(thm)],[f195]) ).

fof(f440,plain,
    ( neq(sk3,nil)
    | nil = sk4 ),
    inference(cnf_transformation,[status(thm)],[f196]) ).

fof(f443,plain,
    ( rearsegP(sk4,sk3)
    | nil = sk3 ),
    inference(cnf_transformation,[status(thm)],[f199]) ).

fof(f451,plain,
    ! [X1] :
      ( ~ ssList(X1)
      | ~ ssList(X1)
      | ~ neq(X1,X1) ),
    inference(destructive_equality_resolution,[status(thm)],[f321]) ).

fof(f452,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ~ neq(X0,X0) ),
    inference(duplicate_literals_removal,[status(thm)],[f451]) ).

fof(f475,plain,
    ( nil = sk3
    | nil = sk2 ),
    inference(forward_demodulation,[status(thm)],[f435,f436]) ).

fof(f477,plain,
    ( nil != sk2
    | nil != sk3 ),
    inference(forward_demodulation,[status(thm)],[f435,f439]) ).

fof(f480,plain,
    ( neq(sk3,nil)
    | nil = sk2 ),
    inference(forward_demodulation,[status(thm)],[f434,f440]) ).

fof(f484,plain,
    ( rearsegP(sk2,sk3)
    | nil = sk3 ),
    inference(forward_demodulation,[status(thm)],[f434,f443]) ).

fof(f485,plain,
    ( nil = sk3
    | rearsegP(nil,sk3)
    | nil = sk3 ),
    inference(paramodulation,[status(thm)],[f475,f484]) ).

fof(f486,plain,
    ( rearsegP(nil,sk3)
    | nil = sk3 ),
    inference(duplicate_literals_removal,[status(thm)],[f485]) ).

fof(f487,plain,
    ( nil = sk3
    | nil = sk3
    | ~ ssList(sk3) ),
    inference(resolution,[status(thm)],[f282,f486]) ).

fof(f490,plain,
    ( nil = sk3
    | ~ ssList(sk3) ),
    inference(duplicate_literals_removal,[status(thm)],[f487]) ).

fof(f491,plain,
    nil = sk3,
    inference(forward_subsumption_resolution,[status(thm)],[f490,f432]) ).

fof(f496,plain,
    ( neq(nil,nil)
    | nil = sk2 ),
    inference(backward_demodulation,[status(thm)],[f491,f480]) ).

fof(f497,plain,
    ( nil != sk2
    | nil != nil ),
    inference(backward_demodulation,[status(thm)],[f491,f477]) ).

fof(f501,plain,
    nil != sk2,
    inference(trivial_equality_resolution,[status(thm)],[f497]) ).

fof(f507,plain,
    neq(nil,nil),
    inference(forward_subsumption_resolution,[status(thm)],[f496,f501]) ).

fof(f509,plain,
    ~ ssList(nil),
    inference(resolution,[status(thm)],[f507,f452]) ).

fof(f510,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f509,f207]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC028-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.38  % Computer : n015.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Mon Sep 21 07:53:07 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.40  % Drodi V4.1.1
% 0.11/0.42  % Refutation found
% 0.11/0.42  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.11/0.42  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.11/0.45  % Elapsed time: 0.065369 seconds
% 0.11/0.45  % CPU time: 0.163123 seconds
% 0.11/0.45  % Total memory used: 108.510 MB
% 0.11/0.45  % Net memory used: 108.371 MB
%------------------------------------------------------------------------------