TSTP Solution File: SYN063+1 by CSE---1.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE---1.6
% Problem  : SYN063+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 %s %d

% Computer : n002.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:43:57 EDT 2023

% Result   : Theorem 0.19s 0.61s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SYN063+1 : TPTP v8.1.2. Released v2.0.0.
% 0.12/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34  % Computer : n002.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Sat Aug 26 20:48:33 EDT 2023
% 0.13/0.34  % CPUTime    : 
% 0.19/0.56  start to proof:theBenchmark
% 0.19/0.61  %-------------------------------------------
% 0.19/0.61  % File        :CSE---1.6
% 0.19/0.61  % Problem     :theBenchmark
% 0.19/0.61  % Transform   :cnf
% 0.19/0.61  % Format      :tptp:raw
% 0.19/0.61  % Command     :java -jar mcs_scs.jar %d %s
% 0.19/0.61  
% 0.19/0.61  % Result      :Theorem 0.000000s
% 0.19/0.61  % Output      :CNFRefutation 0.000000s
% 0.19/0.61  %-------------------------------------------
% 0.19/0.61  %--------------------------------------------------------------------------
% 0.19/0.61  % File     : SYN063+1 : TPTP v8.1.2. Released v2.0.0.
% 0.19/0.61  % Domain   : Syntactic
% 0.19/0.61  % Problem  : Pelletier Problem 33
% 0.19/0.61  % Version  : Especial.
% 0.19/0.61  % English  :
% 0.19/0.61  
% 0.19/0.61  % Refs     : [KM64]  Kalish & Montegue (1964), Logic: Techniques of Formal
% 0.19/0.61  %          : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au
% 0.19/0.61  %          : [Hah94] Haehnle (1994), Email to G. Sutcliffe
% 0.19/0.61  % Source   : [Hah94]
% 0.19/0.61  % Names    : Pelletier 33 [Pel86]
% 0.19/0.61  
% 0.19/0.61  % Status   : Theorem
% 0.19/0.61  % Rating   : 0.00 v5.5.0, 0.11 v5.4.0, 0.00 v4.1.0, 0.06 v4.0.1, 0.05 v3.7.0, 0.33 v3.5.0, 0.12 v3.4.0, 0.08 v3.3.0, 0.00 v3.2.0, 0.11 v3.1.0, 0.00 v2.5.0, 0.33 v2.4.0, 0.33 v2.2.1, 0.00 v2.1.0
% 0.19/0.61  % Syntax   : Number of formulae    :    1 (   0 unt;   0 def)
% 0.19/0.61  %            Number of atoms       :   10 (   0 equ)
% 0.19/0.61  %            Maximal formula atoms :   10 (  10 avg)
% 0.19/0.61  %            Number of connectives :   12 (   3   ~;   4   |;   2   &)
% 0.19/0.61  %                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
% 0.19/0.61  %            Maximal formula depth :    7 (   7 avg)
% 0.19/0.61  %            Maximal term depth    :    1 (   1 avg)
% 0.19/0.61  %            Number of predicates  :    1 (   1 usr;   0 prp; 1-1 aty)
% 0.19/0.61  %            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
% 0.19/0.61  %            Number of variables   :    2 (   2   !;   0   ?)
% 0.19/0.61  % SPC      : FOF_THM_EPR_NEQ
% 0.19/0.61  
% 0.19/0.61  % Comments : This is a monadic predicate formulation of Pelletier 17.
% 0.19/0.61  %--------------------------------------------------------------------------
% 0.19/0.61  fof(pel33,conjecture,
% 0.19/0.61      ( ! [X] :
% 0.19/0.61          ( ( big_p(a)
% 0.19/0.61            & ( big_p(X)
% 0.19/0.61             => big_p(b) ) )
% 0.19/0.61         => big_p(c) )
% 0.19/0.61    <=> ! [X1] :
% 0.19/0.61          ( ( ~ big_p(a)
% 0.19/0.61            | big_p(X1)
% 0.19/0.61            | big_p(c) )
% 0.19/0.61          & ( ~ big_p(a)
% 0.19/0.61            | ~ big_p(b)
% 0.19/0.61            | big_p(c) ) ) ) ).
% 0.19/0.61  
% 0.19/0.61  %--------------------------------------------------------------------------
% 0.19/0.61  %-------------------------------------------
% 0.19/0.61  % Proof found
% 0.19/0.61  % SZS status Theorem for theBenchmark
% 0.19/0.61  % SZS output start Proof
% 0.19/0.62  %ClaNum:31(EqnAxiom:0)
% 0.19/0.62  %VarNum:2(SingletonVarNum:2)
% 0.19/0.62  %MaxLitNum:4
% 0.19/0.62  %MaxfuncDepth:0
% 0.19/0.62  %SharedTerms:13
% 0.19/0.62  %goalClause: 1 2 23 24 28
% 0.19/0.62  %singleGoalClaCount:2
% 0.19/0.62  [1]P1(a1)
% 0.19/0.62  [2]~P1(a2)
% 0.19/0.62  [23]P1(a3)+~P1(a5)+~P1(a4)
% 0.19/0.62  [24]P1(a2)+~P1(a1)+~P1(a3)
% 0.19/0.62  [28]P1(x281)+P1(x282)+P1(a2)+~P1(a1)
% 0.19/0.62  %EqnAxiom
% 0.19/0.62  
% 0.19/0.62  %-------------------------------------------
% 0.19/0.62  cnf(32,plain,
% 0.19/0.62     ($false),
% 0.19/0.62     inference(scs_inference,[],[2,1,28]),
% 0.19/0.62     ['proof']).
% 0.19/0.62  % SZS output end Proof
% 0.19/0.62  % Total time :0.000000s
%------------------------------------------------------------------------------