↑ Up

CSE---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE---1.7
% Problem  : SYN403+1 : TPTP v8.2.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% Computer : n028.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 : Mon Jun 24 19:05:27 EDT 2024

% Result   : Theorem 0.53s 0.58s
% Output   : CNFRefutation 0.53s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SYN403+1 : TPTP v8.2.0. Released v2.0.0.
% 0.07/0.12  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33  % Computer : n028.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Sun Jun 23 23:03:09 EDT 2024
% 0.12/0.34  % CPUTime    : 
% 0.53/0.54  start to proof:theBenchmark
% 0.53/0.57  %-------------------------------------------
% 0.53/0.57  % File        :CSE---1.7
% 0.53/0.57  % Problem     :theBenchmark
% 0.53/0.57  % Transform   :cnf
% 0.53/0.57  % Format      :tptp:raw
% 0.53/0.57  % Command     :java -jar mcs_scs.jar %d %s
% 0.53/0.57  
% 0.53/0.57  % Result      :Theorem 0.000000s
% 0.53/0.57  % Output      :CNFRefutation 0.000000s
% 0.53/0.57  %-------------------------------------------
% 0.53/0.58  %--------------------------------------------------------------------------
% 0.53/0.58  % File     : SYN403+1 : TPTP v8.2.0. Released v2.0.0.
% 0.53/0.58  % Domain   : Syntactic
% 0.53/0.58  % Problem  : Kalish and Montague Problem 234
% 0.53/0.58  % Version  : Especial.
% 0.53/0.58  % English  : Laws of alphabetic variance.
% 0.53/0.58  
% 0.53/0.58  % Refs     : [KM64]  Kalish & Montegue (1964), Logic: Techniques of Formal
% 0.53/0.58  %          : [Hah94] Haehnle (1994), Email to G. Sutcliffe
% 0.53/0.58  % Source   : [Hah94]
% 0.53/0.58  % Names    : kalish234 [Hah94]
% 0.53/0.58  
% 0.53/0.58  % Status   : Theorem
% 0.53/0.58  % Rating   : 0.00 v5.3.0, 0.09 v5.2.0, 0.00 v2.1.0
% 0.53/0.58  % Syntax   : Number of formulae    :    1 (   0 unt;   0 def)
% 0.53/0.58  %            Number of atoms       :    6 (   0 equ)
% 0.53/0.58  %            Maximal formula atoms :    6 (   6 avg)
% 0.53/0.58  %            Number of connectives :    5 (   0   ~;   0   |;   1   &)
% 0.53/0.58  %                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
% 0.53/0.58  %            Maximal formula depth :    5 (   5 avg)
% 0.53/0.58  %            Maximal term depth    :    1 (   1 avg)
% 0.53/0.58  %            Number of predicates  :    3 (   3 usr;   0 prp; 1-1 aty)
% 0.53/0.58  %            Number of functors    :    0 (   0 usr;   0 con; --- aty)
% 0.53/0.58  %            Number of variables   :    1 (   1   !;   0   ?)
% 0.53/0.58  % SPC      : FOF_THM_EPR_NEQ
% 0.53/0.58  
% 0.53/0.58  % Comments :
% 0.53/0.58  %--------------------------------------------------------------------------
% 0.53/0.58  fof(kalish234,conjecture,
% 0.53/0.58      ! [X] :
% 0.53/0.58        ( ( ( f(X)
% 0.53/0.58           => g(X) )
% 0.53/0.58          & ( g(X)
% 0.53/0.58           => h(X) ) )
% 0.53/0.58       => ( f(X)
% 0.53/0.58         => h(X) ) ) ).
% 0.53/0.58  
% 0.53/0.58  %--------------------------------------------------------------------------
% 0.53/0.58  %-------------------------------------------
% 0.53/0.58  % Proof found
% 0.53/0.58  % SZS status Theorem for theBenchmark
% 0.53/0.58  % SZS output start Proof
% 0.53/0.58  %ClaNum:4(EqnAxiom:0)
% 0.53/0.58  %VarNum:0(SingletonVarNum:0)
% 0.53/0.58  %MaxLitNum:2
% 0.53/0.58  %MaxfuncDepth:0
% 0.53/0.58  %SharedTerms:7
% 0.53/0.58  %goalClause: 1 2 3 4
% 0.53/0.58  %singleGoalClaCount:2
% 0.53/0.58  [1]P1(a1)
% 0.53/0.58  [2]~P2(a1)
% 0.53/0.58  [3]P3(a1)+~P1(a1)
% 0.53/0.58  [4]P2(a1)+~P3(a1)
% 0.53/0.58  %EqnAxiom
% 0.53/0.58  
% 0.53/0.58  %-------------------------------------------
% 0.53/0.58  cnf(6,plain,
% 0.53/0.58     ($false),
% 0.53/0.58     inference(scs_inference,[],[1,2,4,3]),
% 0.53/0.58     ['proof']).
% 0.53/0.58  % SZS output end Proof
% 0.53/0.58  % Total time :0.000000s
%------------------------------------------------------------------------------