TSTP Solution File: SEU150+1 by Drodi---3.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.5.1
% Problem  : SEU150+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n006.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 : Wed May 31 12:35:59 EDT 2023

% Result   : Theorem 0.15s 0.53s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   18 (   8 unt;   0 def)
%            Number of atoms       :   28 (  27 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   19 (   9   ~;   4   |;   3   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   31 (;  25   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [A,B] : unordered_pair(A,B) = unordered_pair(B,A),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f4,axiom,
    ! [A,B,C] :
      ( singleton(A) = unordered_pair(B,C)
     => A = B ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f5,conjecture,
    ! [A,B,C] :
      ( singleton(A) = unordered_pair(B,C)
     => B = C ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f6,negated_conjecture,
    ~ ! [A,B,C] :
        ( singleton(A) = unordered_pair(B,C)
       => B = C ),
    inference(negated_conjecture,[status(cth)],[f5]) ).

fof(f7,plain,
    ! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
    inference(cnf_transformation,[status(esa)],[f1]) ).

fof(f8,plain,
    ! [A,B,C] :
      ( singleton(A) != unordered_pair(B,C)
      | A = B ),
    inference(pre_NNF_transformation,[status(esa)],[f4]) ).

fof(f9,plain,
    ! [A,B] :
      ( ! [C] : singleton(A) != unordered_pair(B,C)
      | A = B ),
    inference(miniscoping,[status(esa)],[f8]) ).

fof(f10,plain,
    ! [X0,X1,X2] :
      ( singleton(X0) != unordered_pair(X1,X2)
      | X0 = X1 ),
    inference(cnf_transformation,[status(esa)],[f9]) ).

fof(f11,plain,
    ? [A,B,C] :
      ( singleton(A) = unordered_pair(B,C)
      & B != C ),
    inference(pre_NNF_transformation,[status(esa)],[f6]) ).

fof(f12,plain,
    ? [B,C] :
      ( ? [A] : singleton(A) = unordered_pair(B,C)
      & B != C ),
    inference(miniscoping,[status(esa)],[f11]) ).

fof(f13,plain,
    ( singleton(sk0_2) = unordered_pair(sk0_0,sk0_1)
    & sk0_0 != sk0_1 ),
    inference(skolemization,[status(esa)],[f12]) ).

fof(f14,plain,
    singleton(sk0_2) = unordered_pair(sk0_0,sk0_1),
    inference(cnf_transformation,[status(esa)],[f13]) ).

fof(f15,plain,
    sk0_0 != sk0_1,
    inference(cnf_transformation,[status(esa)],[f13]) ).

fof(f16,plain,
    sk0_2 = sk0_0,
    inference(resolution,[status(thm)],[f10,f14]) ).

fof(f18,plain,
    ! [X0,X1,X2] :
      ( singleton(X0) != unordered_pair(X1,X2)
      | X0 = X2 ),
    inference(paramodulation,[status(thm)],[f7,f10]) ).

fof(f20,plain,
    singleton(sk0_0) = unordered_pair(sk0_0,sk0_1),
    inference(backward_demodulation,[status(thm)],[f16,f14]) ).

fof(f22,plain,
    sk0_0 = sk0_1,
    inference(resolution,[status(thm)],[f18,f20]) ).

fof(f23,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f22,f15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : SEU150+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.10  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.30  % Computer : n006.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit : 300
% 0.09/0.30  % WCLimit  : 300
% 0.09/0.30  % DateTime : Tue May 30 09:08:17 EDT 2023
% 0.09/0.30  % CPUTime  : 
% 0.09/0.31  % Drodi V3.5.1
% 0.15/0.53  % Refutation found
% 0.15/0.53  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.15/0.53  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.53  % Elapsed time: 0.011268 seconds
% 0.15/0.53  % CPU time: 0.009865 seconds
% 0.15/0.53  % Memory used: 2.257 MB
%------------------------------------------------------------------------------