↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Computer : n018.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 03:07:48 PM UTC 2026

% Result   : Unsatisfiable 6.36s 1.29s
% Output   : CNFRefutation 6.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   34 (  19 unt;   2 def)
%            Number of atoms       :   53 (  15 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   40 (  21   ~;  17   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   3 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :   51 (  51   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [S,T,Sigma] : sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f2,axiom,
    ! [X,Sigma] : sep(lseg(X,X),Sigma) = Sigma,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f8,axiom,
    ! [X,Y,Z,Sigma] :
      ( heap(sep(lseg(X,Z),Sigma))
      | X = Y
      | ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f10,axiom,
    ! [X,Y,Z,W,Sigma] :
      ( heap(sep(lseg(X,Z),sep(next(Z,W),Sigma)))
      | ~ heap(sep(lseg(X,Y),sep(lseg(Y,Z),sep(next(Z,W),Sigma)))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f16,hypothesis,
    x1 != x2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f20,hypothesis,
    heap(sep(next(x1,x2),sep(lseg(x3,x1),sep(lseg(x4,nil),sep(next(x2,x4),emp))))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f21,negated_conjecture,
    ~ heap(sep(lseg(x4,nil),sep(next(x2,x4),sep(lseg(x3,x2),emp)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f22,plain,
    ! [X0,X1,X2] : sep(X0,sep(X1,X2)) = sep(X1,sep(X0,X2)),
    inference(cnf_transformation,[status(thm)],[f1]) ).

fof(f23,plain,
    ! [X0,X1] : sep(lseg(X0,X0),X1) = X1,
    inference(cnf_transformation,[status(thm)],[f2]) ).

fof(f32,plain,
    ! [X,Z,Sigma] :
      ( heap(sep(lseg(X,Z),Sigma))
      | ! [Y] :
          ( X = Y
          | ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) ) ),
    inference(miniscoping,[status(thm)],[f8]) ).

fof(f33,plain,
    ! [X0,X1,X2,X3] :
      ( heap(sep(lseg(X0,X2),X3))
      | X0 = X1
      | ~ heap(sep(next(X0,X1),sep(lseg(X1,X2),X3))) ),
    inference(cnf_transformation,[status(thm)],[f32]) ).

fof(f36,plain,
    ! [X,Z,W,Sigma] :
      ( heap(sep(lseg(X,Z),sep(next(Z,W),Sigma)))
      | ! [Y] : ~ heap(sep(lseg(X,Y),sep(lseg(Y,Z),sep(next(Z,W),Sigma)))) ),
    inference(miniscoping,[status(thm)],[f10]) ).

fof(f37,plain,
    ! [X0,X1,X2,X3,X4] :
      ( heap(sep(lseg(X0,X2),sep(next(X2,X3),X4)))
      | ~ heap(sep(lseg(X0,X1),sep(lseg(X1,X2),sep(next(X2,X3),X4)))) ),
    inference(cnf_transformation,[status(thm)],[f36]) ).

fof(f44,plain,
    x1 != x2,
    inference(cnf_transformation,[status(thm)],[f16]) ).

fof(f48,plain,
    heap(sep(next(x1,x2),sep(lseg(x3,x1),sep(lseg(x4,nil),sep(next(x2,x4),emp))))),
    inference(cnf_transformation,[status(thm)],[f20]) ).

fof(f49,plain,
    ~ heap(sep(lseg(x4,nil),sep(next(x2,x4),sep(lseg(x3,x2),emp)))),
    inference(cnf_transformation,[status(thm)],[f21]) ).

fof(f52,plain,
    ! [X0,X1,X2,X3] : sep(X0,sep(X1,sep(X2,X3))) = sep(X2,sep(X0,sep(X1,X3))),
    inference(paramodulation,[status(thm)],[f22,f22]) ).

fof(f176,plain,
    ! [X0,X1,X2,X3] : sep(X0,sep(X1,sep(X2,X3))) = sep(X2,sep(X1,sep(X0,X3))),
    inference(paramodulation,[status(thm)],[f22,f52]) ).

fof(f365,plain,
    ~ heap(sep(lseg(x3,x2),sep(next(x2,x4),sep(lseg(x4,nil),emp)))),
    inference(paramodulation,[status(thm)],[f176,f49]) ).

fof(f684,plain,
    ! [X0,X1,X2] :
      ( heap(sep(lseg(X0,X1),X2))
      | X0 = X1
      | ~ heap(sep(next(X0,X1),X2)) ),
    inference(paramodulation,[status(thm)],[f23,f33]) ).

fof(f696,plain,
    ! [X0] : ~ heap(sep(lseg(x3,X0),sep(lseg(X0,x2),sep(next(x2,x4),sep(lseg(x4,nil),emp))))),
    inference(resolution,[status(thm)],[f365,f37]) ).

fof(f703,plain,
    ! [X0] : ~ heap(sep(lseg(X0,x2),sep(next(x2,x4),sep(lseg(x3,X0),sep(lseg(x4,nil),emp))))),
    inference(paramodulation,[status(thm)],[f52,f696]) ).

fof(f723,plain,
    ! [X0] : ~ heap(sep(lseg(X0,x2),sep(lseg(x3,X0),sep(lseg(x4,nil),sep(next(x2,x4),emp))))),
    inference(paramodulation,[status(thm)],[f52,f703]) ).

fof(f1066,plain,
    ( heap(sep(lseg(x1,x2),sep(lseg(x3,x1),sep(lseg(x4,nil),sep(next(x2,x4),emp)))))
    | x1 = x2 ),
    inference(resolution,[status(thm)],[f48,f684]) ).

fof(f1073,definition,
    ( sQ7_spl
  <=> x1 = x2 ),
    introduced(definition,[new_symbols(definition,[sQ7_spl])],[split_symbol_definition]) ).

fof(f1074,plain,
    ( ~ sQ7_spl
    | x1 = x2 ),
    inference(component_clause,[status(thm)],[f1073]) ).

fof(f1076,definition,
    ( sQ8_spl
  <=> heap(sep(lseg(x1,x2),sep(lseg(x3,x1),sep(lseg(x4,nil),sep(next(x2,x4),emp))))) ),
    introduced(definition,[new_symbols(definition,[sQ8_spl])],[split_symbol_definition]) ).

fof(f1077,plain,
    ( ~ sQ8_spl
    | heap(sep(lseg(x1,x2),sep(lseg(x3,x1),sep(lseg(x4,nil),sep(next(x2,x4),emp))))) ),
    inference(component_clause,[status(thm)],[f1076]) ).

fof(f1079,plain,
    ( sQ8_spl
    | sQ7_spl ),
    inference(split_clause,[status(thm)],[f1066,f1073,f1076]) ).

fof(f1080,plain,
    ( ~ sQ7_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f1074,f44]) ).

fof(f1081,plain,
    ~ sQ7_spl,
    inference(contradiction_clause,[status(thm)],[f1080]) ).

fof(f1082,plain,
    ( ~ sQ8_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f1077,f723]) ).

fof(f1083,plain,
    ~ sQ8_spl,
    inference(contradiction_clause,[status(thm)],[f1082]) ).

fof(f1084,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f1079,f1081,f1083]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWW407-1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n018.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep 21 09:53:30 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.37  % Drodi V4.1.1
% 6.36/1.29  % Refutation found
% 6.36/1.29  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 6.36/1.29  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 6.36/1.33  % Elapsed time: 0.958649 seconds
% 6.36/1.33  % CPU time: 7.207225 seconds
% 6.36/1.33  % Total memory used: 137.171 MB
% 6.36/1.33  % Net memory used: 134.351 MB
%------------------------------------------------------------------------------