TSTP Solution File: SYN032-1 by Drodi---3.6.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% Problem  : SYN032-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n012.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Apr 30 20:51:03 EDT 2024

% Result   : Unsatisfiable 0.17s 0.69s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   28 (   1 unt;   0 def)
%            Number of atoms       :   64 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   60 (  24   ~;  30   |;   0   &)
%                                         (   6 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of predicates  :   13 (  12 usr;  13 prp; 0-0 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,hypothesis,
    ( h
    | a
    | ~ j ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f2,hypothesis,
    ( h
    | k
    | j ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f3,hypothesis,
    ( h
    | j
    | ~ k ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f4,hypothesis,
    ( b
    | ~ a ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f5,hypothesis,
    ( c
    | ~ h ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f6,hypothesis,
    ( ~ h
    | ~ c ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f7,negated_conjecture,
    ( ~ a
    | ~ b ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f8,plain,
    ( h
    | a
    | ~ j ),
    inference(cnf_transformation,[status(esa)],[f1]) ).

fof(f9,plain,
    ( h
    | k
    | j ),
    inference(cnf_transformation,[status(esa)],[f2]) ).

fof(f10,plain,
    ( h
    | j
    | ~ k ),
    inference(cnf_transformation,[status(esa)],[f3]) ).

fof(f11,plain,
    ( b
    | ~ a ),
    inference(cnf_transformation,[status(esa)],[f4]) ).

fof(f12,plain,
    ( c
    | ~ h ),
    inference(cnf_transformation,[status(esa)],[f5]) ).

fof(f13,plain,
    ( ~ h
    | ~ c ),
    inference(cnf_transformation,[status(esa)],[f6]) ).

fof(f14,plain,
    ( ~ a
    | ~ b ),
    inference(cnf_transformation,[status(esa)],[f7]) ).

fof(f15,plain,
    ( spl0_0
  <=> h ),
    introduced(split_symbol_definition) ).

fof(f18,plain,
    ( spl0_1
  <=> a ),
    introduced(split_symbol_definition) ).

fof(f21,plain,
    ( spl0_2
  <=> j ),
    introduced(split_symbol_definition) ).

fof(f24,plain,
    ( spl0_0
    | spl0_1
    | ~ spl0_2 ),
    inference(split_clause,[status(thm)],[f8,f15,f18,f21]) ).

fof(f25,plain,
    ( spl0_3
  <=> k ),
    introduced(split_symbol_definition) ).

fof(f28,plain,
    ( spl0_0
    | spl0_3
    | spl0_2 ),
    inference(split_clause,[status(thm)],[f9,f15,f25,f21]) ).

fof(f29,plain,
    ( spl0_0
    | spl0_2
    | ~ spl0_3 ),
    inference(split_clause,[status(thm)],[f10,f15,f21,f25]) ).

fof(f30,plain,
    ( spl0_4
  <=> b ),
    introduced(split_symbol_definition) ).

fof(f33,plain,
    ( spl0_4
    | ~ spl0_1 ),
    inference(split_clause,[status(thm)],[f11,f30,f18]) ).

fof(f34,plain,
    ( spl0_5
  <=> c ),
    introduced(split_symbol_definition) ).

fof(f37,plain,
    ( spl0_5
    | ~ spl0_0 ),
    inference(split_clause,[status(thm)],[f12,f34,f15]) ).

fof(f38,plain,
    ( ~ spl0_0
    | ~ spl0_5 ),
    inference(split_clause,[status(thm)],[f13,f15,f34]) ).

fof(f39,plain,
    ( ~ spl0_1
    | ~ spl0_4 ),
    inference(split_clause,[status(thm)],[f14,f18,f30]) ).

fof(f40,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f24,f28,f29,f33,f37,f38,f39]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.41  % Problem  : SYN032-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.42  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.17/0.68  % Computer : n012.cluster.edu
% 0.17/0.68  % Model    : x86_64 x86_64
% 0.17/0.68  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.68  % Memory   : 8042.1875MB
% 0.17/0.68  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.68  % CPULimit : 300
% 0.17/0.68  % WCLimit  : 300
% 0.17/0.68  % DateTime : Mon Apr 29 21:45:57 EDT 2024
% 0.17/0.68  % CPUTime  : 
% 0.17/0.68  % Drodi V3.6.0
% 0.17/0.69  % Refutation found
% 0.17/0.69  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.17/0.69  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.17/0.70  % Elapsed time: 0.014446 seconds
% 0.17/0.70  % CPU time: 0.011008 seconds
% 0.17/0.70  % Total memory used: 538.336 KB
% 0.17/0.70  % Net memory used: 490.192 KB
%------------------------------------------------------------------------------