↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Computer : n001.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:28:14 PM UTC 2026

% Result   : Unsatisfiable 0.13s 0.39s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   39 (   5 unt;   2 def)
%            Number of atoms       :  100 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  121 (  60   ~;  59   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   3 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   76 (  76   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ~ eq(p1,p2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f6,axiom,
    ! [A,B,C,D] :
      ( eq(D,A)
      | ~ latin(D,B,C)
      | ~ latin(A,B,C) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f9,axiom,
    ! [A,B,C,D] :
      ( eq(D,A)
      | ~ greek(D,B,C)
      | ~ greek(A,B,C) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f10,axiom,
    ! [E,F] :
      ( latin(E,F,p2)
      | latin(E,F,p1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f11,axiom,
    ! [G,H] :
      ( latin(G,p2,H)
      | latin(G,p1,H) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f13,axiom,
    ! [K,L] :
      ( greek(K,L,p2)
      | greek(K,L,p1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f14,axiom,
    ! [M,N] :
      ( greek(M,p2,N)
      | greek(M,p1,N) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f16,negated_conjecture,
    ! [A,B,C,D,E,F] :
      ( eq(E,A)
      | eq(F,B)
      | ~ latin(E,F,D)
      | ~ greek(E,F,C)
      | ~ latin(A,B,D)
      | ~ greek(A,B,C) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f17,plain,
    ~ eq(p1,p2),
    inference(cnf_transformation,[status(thm)],[f1]) ).

fof(f24,plain,
    ! [A,D] :
      ( eq(D,A)
      | ! [B,C] :
          ( ~ latin(D,B,C)
          | ~ latin(A,B,C) ) ),
    inference(miniscoping,[status(thm)],[f6]) ).

fof(f25,plain,
    ! [X0,X1,X2,X3] :
      ( eq(X3,X0)
      | ~ latin(X3,X1,X2)
      | ~ latin(X0,X1,X2) ),
    inference(cnf_transformation,[status(thm)],[f24]) ).

fof(f30,plain,
    ! [A,D] :
      ( eq(D,A)
      | ! [B,C] :
          ( ~ greek(D,B,C)
          | ~ greek(A,B,C) ) ),
    inference(miniscoping,[status(thm)],[f9]) ).

fof(f31,plain,
    ! [X0,X1,X2,X3] :
      ( eq(X3,X0)
      | ~ greek(X3,X1,X2)
      | ~ greek(X0,X1,X2) ),
    inference(cnf_transformation,[status(thm)],[f30]) ).

fof(f32,plain,
    ! [X0,X1] :
      ( latin(X0,X1,p2)
      | latin(X0,X1,p1) ),
    inference(cnf_transformation,[status(thm)],[f10]) ).

fof(f33,plain,
    ! [X0,X1] :
      ( latin(X0,p2,X1)
      | latin(X0,p1,X1) ),
    inference(cnf_transformation,[status(thm)],[f11]) ).

fof(f35,plain,
    ! [X0,X1] :
      ( greek(X0,X1,p2)
      | greek(X0,X1,p1) ),
    inference(cnf_transformation,[status(thm)],[f13]) ).

fof(f36,plain,
    ! [X0,X1] :
      ( greek(X0,p2,X1)
      | greek(X0,p1,X1) ),
    inference(cnf_transformation,[status(thm)],[f14]) ).

fof(f38,plain,
    ! [A,E] :
      ( eq(E,A)
      | ! [B,F] :
          ( eq(F,B)
          | ! [D] :
              ( ~ latin(E,F,D)
              | ! [C] :
                  ( ~ greek(E,F,C)
                  | ~ latin(A,B,D)
                  | ~ greek(A,B,C) ) ) ) ),
    inference(miniscoping,[status(thm)],[f16]) ).

fof(f39,plain,
    ! [X0,X1,X2,X3,X4,X5] :
      ( eq(X4,X0)
      | eq(X5,X1)
      | ~ latin(X4,X5,X3)
      | ~ greek(X4,X5,X2)
      | ~ latin(X0,X1,X3)
      | ~ greek(X0,X1,X2) ),
    inference(cnf_transformation,[status(thm)],[f38]) ).

fof(f40,plain,
    ! [X0,X1] :
      ( ~ greek(p1,X0,X1)
      | ~ greek(p2,X0,X1) ),
    inference(resolution,[status(thm)],[f17,f31]) ).

fof(f43,plain,
    ! [X0,X1] :
      ( ~ latin(p1,X0,X1)
      | ~ latin(p2,X0,X1) ),
    inference(resolution,[status(thm)],[f17,f25]) ).

fof(f47,plain,
    ! [X0,X1,X2,X3] :
      ( eq(X3,X0)
      | ~ latin(X3,p1,X2)
      | ~ greek(X3,p1,X1)
      | ~ latin(X0,p2,X2)
      | ~ greek(X0,p2,X1) ),
    inference(resolution,[status(thm)],[f17,f39]) ).

fof(f50,plain,
    ! [X0] :
      ( ~ greek(p1,p1,X0)
      | greek(p2,p2,X0) ),
    inference(resolution,[status(thm)],[f36,f40]) ).

fof(f52,plain,
    ! [X0,X1] :
      ( ~ latin(p1,p1,X1)
      | ~ greek(p1,p1,X0)
      | ~ latin(p2,p2,X1)
      | ~ greek(p2,p2,X0) ),
    inference(resolution,[status(thm)],[f47,f17]) ).

fof(f53,definition,
    ! [X0] :
      ( sQ0_spl
    <=> ( ~ greek(p1,p1,X0)
        | ~ greek(p2,p2,X0) ) ),
    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).

fof(f54,plain,
    ! [X0] :
      ( ~ sQ0_spl
      | ~ greek(p1,p1,X0)
      | ~ greek(p2,p2,X0) ),
    inference(component_clause,[status(thm)],[f53]) ).

fof(f56,definition,
    ! [X1] :
      ( sQ1_spl
    <=> ( ~ latin(p1,p1,X1)
        | ~ latin(p2,p2,X1) ) ),
    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).

fof(f57,plain,
    ! [X0] :
      ( ~ sQ1_spl
      | ~ latin(p1,p1,X0)
      | ~ latin(p2,p2,X0) ),
    inference(component_clause,[status(thm)],[f56]) ).

fof(f59,plain,
    ( sQ1_spl
    | sQ0_spl ),
    inference(split_clause,[status(thm)],[f52,f53,f56]) ).

fof(f60,plain,
    ! [X0] :
      ( ~ sQ0_spl
      | ~ greek(p1,p1,X0) ),
    inference(forward_subsumption_resolution,[status(thm)],[f54,f50]) ).

fof(f63,plain,
    ( ~ sQ0_spl
    | greek(p1,p1,p1) ),
    inference(resolution,[status(thm)],[f60,f35]) ).

fof(f64,plain,
    ( ~ sQ0_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f63,f60]) ).

fof(f65,plain,
    ~ sQ0_spl,
    inference(contradiction_clause,[status(thm)],[f64]) ).

fof(f76,plain,
    ! [X0] :
      ( latin(p1,p1,X0)
      | ~ latin(p2,p2,X0) ),
    inference(resolution,[status(thm)],[f43,f33]) ).

fof(f78,plain,
    ! [X0] :
      ( ~ sQ1_spl
      | ~ latin(p2,p2,X0) ),
    inference(forward_subsumption_resolution,[status(thm)],[f76,f57]) ).

fof(f113,plain,
    ( ~ sQ1_spl
    | latin(p2,p2,p1) ),
    inference(resolution,[status(thm)],[f78,f32]) ).

fof(f114,plain,
    ( ~ sQ1_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f113,f78]) ).

fof(f115,plain,
    ~ sQ1_spl,
    inference(contradiction_clause,[status(thm)],[f114]) ).

fof(f116,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f59,f65,f115]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MSC008-2.002 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.35  % Computer : n001.cluster.edu
% 0.07/0.35  % Model    : x86_64 x86_64
% 0.07/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35  % Memory   : 8046.5625MB
% 0.07/0.35  % OS       : Linux 6.8.0-71-generic
% 0.07/0.35  % CPULimit : 300
% 0.07/0.35  % WCLimit  : 300
% 0.07/0.35  % DateTime : Mon Sep 21 01:32:59 UTC 2026
% 0.07/0.35  % CPUTime  : 
% 0.13/0.36  % Drodi V4.1.1
% 0.13/0.39  % Refutation found
% 0.13/0.39  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.42  % Elapsed time: 0.057482 seconds
% 0.13/0.42  % CPU time: 0.161394 seconds
% 0.13/0.42  % Total memory used: 9.948 MB
% 0.13/0.42  % Net memory used: 9.738 MB
%------------------------------------------------------------------------------