↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Computer : n007.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:59:56 PM UTC 2026

% Result   : Unsatisfiable 0.13s 0.37s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   48 (   7 unt;   9 def)
%            Number of atoms       :  103 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :  105 (  50   ~;  46   |;   0   &)
%                                         (   9 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   13 (  12 usr;  10 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   17 (  17   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [P] :
      ( truth(isa(P,knave))
      | truth(isa(P,knight))
      | ~ person(P) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f5,axiom,
    ( says(asked,not(or(isa(asked,knight),isa(other,knight))))
    | says(asked,or(isa(asked,knight),isa(other,knight))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f12,axiom,
    person(asked),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f13,axiom,
    person(other),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f14,negated_conjecture,
    ! [P1,P2,S] :
      ( ~ says(asked,S)
      | ~ truth(isa(other,P2))
      | ~ truth(isa(asked,P1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f15,plain,
    ! [X0] :
      ( truth(isa(X0,knave))
      | truth(isa(X0,knight))
      | ~ person(X0) ),
    inference(cnf_transformation,[status(thm)],[f1]) ).

fof(f21,plain,
    ( says(asked,not(or(isa(asked,knight),isa(other,knight))))
    | says(asked,or(isa(asked,knight),isa(other,knight))) ),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f32,plain,
    person(asked),
    inference(cnf_transformation,[status(thm)],[f12]) ).

fof(f33,plain,
    person(other),
    inference(cnf_transformation,[status(thm)],[f13]) ).

fof(f34,plain,
    ( ! [S] : ~ says(asked,S)
    | ! [P2] : ~ truth(isa(other,P2))
    | ! [P1] : ~ truth(isa(asked,P1)) ),
    inference(miniscoping,[status(thm)],[f14]) ).

fof(f35,plain,
    ! [X0,X1,X2] :
      ( ~ says(asked,X2)
      | ~ truth(isa(other,X1))
      | ~ truth(isa(asked,X0)) ),
    inference(cnf_transformation,[status(thm)],[f34]) ).

fof(f36,definition,
    ( sQ0_spl
  <=> says(asked,or(isa(asked,knight),isa(other,knight))) ),
    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).

fof(f37,plain,
    ( ~ sQ0_spl
    | says(asked,or(isa(asked,knight),isa(other,knight))) ),
    inference(component_clause,[status(thm)],[f36]) ).

fof(f39,definition,
    ( sQ1_spl
  <=> says(asked,not(or(isa(asked,knight),isa(other,knight)))) ),
    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).

fof(f40,plain,
    ( ~ sQ1_spl
    | says(asked,not(or(isa(asked,knight),isa(other,knight)))) ),
    inference(component_clause,[status(thm)],[f39]) ).

fof(f42,plain,
    ( sQ1_spl
    | sQ0_spl ),
    inference(split_clause,[status(thm)],[f21,f36,f39]) ).

fof(f43,definition,
    ! [X0] :
      ( sQ2_spl
    <=> ~ truth(isa(asked,X0)) ),
    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).

fof(f44,plain,
    ! [X0] :
      ( ~ sQ2_spl
      | ~ truth(isa(asked,X0)) ),
    inference(component_clause,[status(thm)],[f43]) ).

fof(f46,definition,
    ! [X1] :
      ( sQ3_spl
    <=> ~ truth(isa(other,X1)) ),
    introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).

fof(f47,plain,
    ! [X0] :
      ( ~ sQ3_spl
      | ~ truth(isa(other,X0)) ),
    inference(component_clause,[status(thm)],[f46]) ).

fof(f49,definition,
    ! [X2] :
      ( sQ4_spl
    <=> ~ says(asked,X2) ),
    introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).

fof(f50,plain,
    ! [X0] :
      ( ~ sQ4_spl
      | ~ says(asked,X0) ),
    inference(component_clause,[status(thm)],[f49]) ).

fof(f52,plain,
    ( sQ4_spl
    | sQ3_spl
    | sQ2_spl ),
    inference(split_clause,[status(thm)],[f35,f43,f46,f49]) ).

fof(f53,plain,
    ( ~ sQ0_spl
    | ~ sQ4_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f37,f50]) ).

fof(f54,plain,
    ( ~ sQ0_spl
    | ~ sQ4_spl ),
    inference(contradiction_clause,[status(thm)],[f53]) ).

fof(f64,definition,
    ( sQ7_spl
  <=> truth(isa(asked,knight)) ),
    introduced(definition,[new_symbols(definition,[sQ7_spl])],[split_symbol_definition]) ).

fof(f65,plain,
    ( ~ sQ7_spl
    | truth(isa(asked,knight)) ),
    inference(component_clause,[status(thm)],[f64]) ).

fof(f68,plain,
    ( ~ sQ7_spl
    | ~ sQ2_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f65,f44]) ).

fof(f69,plain,
    ( ~ sQ7_spl
    | ~ sQ2_spl ),
    inference(contradiction_clause,[status(thm)],[f68]) ).

fof(f76,definition,
    ( sQ8_spl
  <=> truth(isa(other,knight)) ),
    introduced(definition,[new_symbols(definition,[sQ8_spl])],[split_symbol_definition]) ).

fof(f77,plain,
    ( ~ sQ8_spl
    | truth(isa(other,knight)) ),
    inference(component_clause,[status(thm)],[f76]) ).

fof(f80,plain,
    ( ~ sQ8_spl
    | ~ sQ3_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f77,f47]) ).

fof(f81,plain,
    ( ~ sQ8_spl
    | ~ sQ3_spl ),
    inference(contradiction_clause,[status(thm)],[f80]) ).

fof(f83,plain,
    ( ~ sQ2_spl
    | truth(isa(asked,knight))
    | ~ person(asked) ),
    inference(resolution,[status(thm)],[f15,f44]) ).

fof(f84,definition,
    ( sQ9_spl
  <=> person(asked) ),
    introduced(definition,[new_symbols(definition,[sQ9_spl])],[split_symbol_definition]) ).

fof(f86,plain,
    ( sQ9_spl
    | ~ person(asked) ),
    inference(component_clause,[status(thm)],[f84]) ).

fof(f87,plain,
    ( ~ sQ2_spl
    | sQ7_spl
    | ~ sQ9_spl ),
    inference(split_clause,[status(thm)],[f83,f84,f64,f43]) ).

fof(f88,plain,
    ( sQ9_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f86,f32]) ).

fof(f89,plain,
    sQ9_spl,
    inference(contradiction_clause,[status(thm)],[f88]) ).

fof(f94,plain,
    ( ~ sQ3_spl
    | truth(isa(other,knight))
    | ~ person(other) ),
    inference(resolution,[status(thm)],[f47,f15]) ).

fof(f95,definition,
    ( sQ10_spl
  <=> person(other) ),
    introduced(definition,[new_symbols(definition,[sQ10_spl])],[split_symbol_definition]) ).

fof(f97,plain,
    ( sQ10_spl
    | ~ person(other) ),
    inference(component_clause,[status(thm)],[f95]) ).

fof(f98,plain,
    ( ~ sQ3_spl
    | sQ8_spl
    | ~ sQ10_spl ),
    inference(split_clause,[status(thm)],[f94,f95,f76,f46]) ).

fof(f99,plain,
    ( sQ10_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f97,f33]) ).

fof(f100,plain,
    sQ10_spl,
    inference(contradiction_clause,[status(thm)],[f99]) ).

fof(f101,plain,
    ( ~ sQ1_spl
    | ~ sQ4_spl
    | $false ),
    inference(backward_subsumption_resolution,[status(thm)],[f40,f50]) ).

fof(f102,plain,
    ( ~ sQ1_spl
    | ~ sQ4_spl ),
    inference(contradiction_clause,[status(thm)],[f101]) ).

fof(f103,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f42,f52,f54,f69,f81,f87,f89,f98,f100,f102]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : PUZ035-4 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.34  % Computer : n007.cluster.edu
% 0.09/0.34  % Model    : x86_64 x86_64
% 0.09/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34  % Memory   : 8046.5625MB
% 0.09/0.34  % 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 03:44:36 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.36  % Drodi V4.1.1
% 0.13/0.37  % Refutation found
% 0.13/0.37  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.37  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.39  % Elapsed time: 0.037599 seconds
% 0.13/0.39  % CPU time: 0.096123 seconds
% 0.13/0.39  % Total memory used: 13.169 MB
% 0.13/0.39  % Net memory used: 12.862 MB
%------------------------------------------------------------------------------