TSTP Solution File: SYN379+1 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SYN379+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n013.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 : Fri Sep  1 01:51:29 EDT 2023

% Result   : Theorem 0.20s 0.57s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of formulae    :    8 (   3 unt;   2 typ;   0 def)
%            Number of atoms       :   15 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   16 (   7   ~;   0   |;   5   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    4 (   2   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :   20 (   4 sgn;  13   !;   2   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    big_p: $i > $o ).

tff(decl_23,type,
    big_q: ( $i * $i * $i ) > $o ).

fof(x2131,conjecture,
    ( ! [X1] : big_p(X1)
   => ? [X2] :
        ( ! [X1,X3] : big_q(X1,X2,X3)
       => ~ ! [X3] :
              ( big_p(X3)
              & ~ big_q(X2,X2,X3) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2131) ).

fof(c_0_1,negated_conjecture,
    ~ ( ! [X1] : big_p(X1)
     => ? [X2] :
          ( ! [X1,X3] : big_q(X1,X2,X3)
         => ~ ! [X3] :
                ( big_p(X3)
                & ~ big_q(X2,X2,X3) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[x2131])]) ).

fof(c_0_2,negated_conjecture,
    ! [X4,X5,X6,X7,X8] :
      ( big_p(X4)
      & big_q(X6,X5,X7)
      & big_p(X8)
      & ~ big_q(X5,X5,X8) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])]) ).

cnf(c_0_3,negated_conjecture,
    ~ big_q(X1,X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    big_q(X1,X2,X3),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN379+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35  % Computer : n013.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Sat Aug 26 20:36:17 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.20/0.56  start to proof: theBenchmark
% 0.20/0.57  % Version  : CSE_E---1.5
% 0.20/0.57  % Problem  : theBenchmark.p
% 0.20/0.57  % Proof found
% 0.20/0.57  % SZS status Theorem for theBenchmark.p
% 0.20/0.57  % SZS output start Proof
% See solution above
% 0.20/0.57  % Total time : 0.003000 s
% 0.20/0.57  % SZS output end Proof
% 0.20/0.57  % Total time : 0.005000 s
%------------------------------------------------------------------------------