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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE---1.6
% Problem  : SYN387+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 : n019.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:45:33 EDT 2023

% Result   : Theorem 0.20s 0.65s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN387+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.15/0.34  % Computer : n019.cluster.edu
% 0.15/0.34  % Model    : x86_64 x86_64
% 0.15/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34  % Memory   : 8042.1875MB
% 0.15/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34  % CPULimit   : 300
% 0.15/0.34  % WCLimit    : 300
% 0.15/0.34  % DateTime   : Sat Aug 26 20:23:13 EDT 2023
% 0.15/0.34  % CPUTime    : 
% 0.20/0.60  start to proof:theBenchmark
% 0.20/0.64  %-------------------------------------------
% 0.20/0.64  % File        :CSE---1.6
% 0.20/0.64  % Problem     :theBenchmark
% 0.20/0.64  % Transform   :cnf
% 0.20/0.64  % Format      :tptp:raw
% 0.20/0.64  % Command     :java -jar mcs_scs.jar %d %s
% 0.20/0.64  
% 0.20/0.64  % Result      :Theorem 0.000000s
% 0.20/0.64  % Output      :CNFRefutation 0.000000s
% 0.20/0.64  %-------------------------------------------
% 0.20/0.65  %--------------------------------------------------------------------------
% 0.20/0.65  % File     : SYN387+1 : TPTP v8.1.2. Released v2.0.0.
% 0.20/0.65  % Domain   : Syntactic
% 0.20/0.65  % Problem  : The Law of Excluded Middle
% 0.20/0.65  % Version  : Especial.
% 0.20/0.65  %            Theorem formulation : 1 proposition.
% 0.20/0.65  % English  : The Law of Excluded Middle: can be quite difficult for
% 0.20/0.65  %            'natural' systems.
% 0.20/0.65  
% 0.20/0.65  % Refs     : [NS72]  Newell & Simon (1972), Human Problem Solving
% 0.20/0.65  %          : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au
% 0.20/0.65  %          : [Hah94] Haehnle (1994), Email to G. Sutcliffe
% 0.20/0.65  % Source   : [Hah94]
% 0.20/0.65  % Names    : Pelletier 6 [Pel86]
% 0.20/0.65  
% 0.20/0.65  % Status   : Theorem
% 0.20/0.65  % Rating   : 0.00 v2.1.0
% 0.20/0.65  % Syntax   : Number of formulae    :    1 (   0 unt;   0 def)
% 0.20/0.65  %            Number of atoms       :    2 (   0 equ)
% 0.20/0.65  %            Maximal formula atoms :    2 (   2 avg)
% 0.20/0.65  %            Number of connectives :    2 (   1   ~;   1   |;   0   &)
% 0.20/0.65  %                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
% 0.20/0.65  %            Maximal formula depth :    3 (   3 avg)
% 0.20/0.65  %            Maximal term depth    :    0 (   0 avg)
% 0.20/0.65  %            Number of predicates  :    1 (   1 usr;   1 prp; 0-0 aty)
% 0.20/0.65  %            Number of functors    :    0 (   0 usr;   0 con; --- aty)
% 0.20/0.65  %            Number of variables   :    0 (   0   !;   0   ?)
% 0.20/0.65  % SPC      : FOF_THM_PRP
% 0.20/0.65  
% 0.20/0.65  % Comments : The clausal form of this problem is the same as SYN001+1.p.
% 0.20/0.65  %--------------------------------------------------------------------------
% 0.20/0.65  fof(pel6,conjecture,
% 0.20/0.65      ( p
% 0.20/0.65      | ~ p ) ).
% 0.20/0.65  
% 0.20/0.65  %--------------------------------------------------------------------------
% 0.20/0.65  %-------------------------------------------
% 0.20/0.65  % Proof found
% 0.20/0.65  % SZS status Theorem for theBenchmark
% 0.20/0.65  % SZS output start Proof
% 0.20/0.65  %ClaNum:2(EqnAxiom:0)
% 0.20/0.65  %VarNum:0(SingletonVarNum:0)
% 0.20/0.65  %MaxLitNum:1
% 0.20/0.65  %MaxfuncDepth:0
% 0.20/0.65  %SharedTerms:3
% 0.20/0.65  %goalClause: 1 2
% 0.20/0.65  %singleGoalClaCount:2
% 0.20/0.65  [1]P1(a500)
% 0.20/0.65  [2]~P1(a500)
% 0.20/0.65  %EqnAxiom
% 0.20/0.65  
% 0.20/0.65  %-------------------------------------------
% 0.20/0.65  cnf(3,plain,
% 0.20/0.65     ($false),
% 0.20/0.65     inference(scs_inference,[],[1,2]),
% 0.20/0.65     ['proof']).
% 0.20/0.65  % SZS output end Proof
% 0.20/0.65  % Total time :0.000000s
%------------------------------------------------------------------------------