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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE---1.6
% Problem  : SYN398+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d

% Computer : n016.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:36 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN398+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.17/0.34  % Computer : n016.cluster.edu
% 0.17/0.34  % Model    : x86_64 x86_64
% 0.17/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34  % Memory   : 8042.1875MB
% 0.17/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34  % CPULimit   : 300
% 0.17/0.34  % WCLimit    : 300
% 0.17/0.34  % DateTime   : Sat Aug 26 19:22:42 EDT 2023
% 0.17/0.34  % CPUTime    : 
% 0.20/0.54  start to proof:theBenchmark
% 0.20/0.59  %-------------------------------------------
% 0.20/0.59  % File        :CSE---1.6
% 0.20/0.59  % Problem     :theBenchmark
% 0.20/0.59  % Transform   :cnf
% 0.20/0.59  % Format      :tptp:raw
% 0.20/0.59  % Command     :java -jar mcs_scs.jar %d %s
% 0.20/0.59  
% 0.20/0.59  % Result      :Theorem 0.000000s
% 0.20/0.59  % Output      :CNFRefutation 0.000000s
% 0.20/0.59  %-------------------------------------------
% 0.20/0.59  %--------------------------------------------------------------------------
% 0.20/0.59  % File     : SYN398+1 : TPTP v8.1.2. Released v2.0.0.
% 0.20/0.59  % Domain   : Syntactic
% 0.20/0.59  % Problem  : Kalish and Montague Problem 215
% 0.20/0.59  % Version  : Especial.
% 0.20/0.59  % English  : Laws of confinement.
% 0.20/0.59  
% 0.20/0.59  % Refs     : [KM64]  Kalish & Montegue (1964), Logic: Techniques of Formal
% 0.20/0.59  %          : [Hah94] Haehnle (1994), Email to G. Sutcliffe
% 0.20/0.59  % Source   : [Hah94]
% 0.20/0.59  % Names    : kalish215 [Hah94]
% 0.20/0.59  
% 0.20/0.59  % Status   : Theorem
% 0.20/0.59  % Rating   : 0.00 v5.3.0, 0.09 v5.2.0, 0.00 v4.0.1, 0.05 v3.7.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.20/0.59  % Syntax   : Number of formulae    :    1 (   0 unt;   0 def)
% 0.20/0.59  %            Number of atoms       :    4 (   0 equ)
% 0.20/0.59  %            Maximal formula atoms :    4 (   4 avg)
% 0.20/0.59  %            Number of connectives :    3 (   0   ~;   0   |;   2   &)
% 0.20/0.59  %                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
% 0.20/0.59  %            Maximal formula depth :    4 (   4 avg)
% 0.20/0.59  %            Maximal term depth    :    1 (   1 avg)
% 0.20/0.59  %            Number of predicates  :    2 (   2 usr;   1 prp; 0-1 aty)
% 0.20/0.59  %            Number of functors    :    0 (   0 usr;   0 con; --- aty)
% 0.20/0.59  %            Number of variables   :    2 (   2   !;   0   ?)
% 0.20/0.59  % SPC      : FOF_THM_EPR_NEQ
% 0.20/0.59  
% 0.20/0.59  % Comments :
% 0.20/0.59  %--------------------------------------------------------------------------
% 0.20/0.59  fof(kalish215,conjecture,
% 0.20/0.59      ( ! [X] :
% 0.20/0.59          ( p
% 0.20/0.59          & f(X) )
% 0.20/0.59    <=> ( p
% 0.20/0.59        & ! [Y] : f(Y) ) ) ).
% 0.20/0.59  
% 0.20/0.59  %--------------------------------------------------------------------------
% 0.20/0.59  %-------------------------------------------
% 0.20/0.59  % Proof found
% 0.20/0.59  % SZS status Theorem for theBenchmark
% 0.20/0.59  % SZS output start Proof
% 0.20/0.59  %ClaNum:5(EqnAxiom:0)
% 0.20/0.59  %VarNum:2(SingletonVarNum:2)
% 0.20/0.59  %MaxLitNum:3
% 0.20/0.59  %MaxfuncDepth:0
% 0.20/0.59  %SharedTerms:7
% 0.20/0.59  %goalClause: 1 4 5
% 0.20/0.59  %singleGoalClaCount:1
% 0.20/0.59  [1]P1(a500)
% 0.20/0.59  [4]P2(x41)+P2(x42)
% 0.20/0.59  [5]~P1(a500)+~P2(a1)+~P2(a2)
% 0.20/0.59  %EqnAxiom
% 0.20/0.59  
% 0.20/0.59  %-------------------------------------------
% 0.20/0.60  cnf(6,plain,
% 0.20/0.60     (~P2(a2)+~P2(a1)),
% 0.20/0.60     inference(scs_inference,[],[1,5])).
% 0.20/0.60  cnf(7,plain,
% 0.20/0.60     (~P2(a1)),
% 0.20/0.60     inference(scs_inference,[],[4,6])).
% 0.20/0.60  cnf(9,plain,
% 0.20/0.60     ($false),
% 0.20/0.60     inference(scs_inference,[],[7,4]),
% 0.20/0.60     ['proof']).
% 0.20/0.60  % SZS output end Proof
% 0.20/0.60  % Total time :0.000000s
%------------------------------------------------------------------------------