↑ Up

CSE---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE---1.7
% Problem  : SYN061+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 : n025.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:04:24 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SYN061+1 : TPTP v8.2.0. Released v2.0.0.
% 0.11/0.12  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.33  % Computer : n025.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Sun Jun 23 20:24:09 EDT 2024
% 0.13/0.33  % CPUTime    : 
% 0.19/0.54  start to proof:theBenchmark
% 0.19/0.57  %-------------------------------------------
% 0.19/0.57  % File        :CSE---1.7
% 0.19/0.57  % Problem     :theBenchmark
% 0.19/0.57  % Transform   :cnf
% 0.19/0.57  % Format      :tptp:raw
% 0.19/0.57  % Command     :java -jar mcs_scs.jar %d %s
% 0.19/0.57  
% 0.19/0.57  % Result      :Theorem 0.000000s
% 0.19/0.57  % Output      :CNFRefutation 0.000000s
% 0.19/0.57  %-------------------------------------------
% 0.19/0.57  %--------------------------------------------------------------------------
% 0.19/0.57  % File     : SYN061+1 : TPTP v8.2.0. Released v2.0.0.
% 0.19/0.57  % Domain   : Syntactic
% 0.19/0.57  % Problem  : Pelletier Problem 31
% 0.19/0.57  % Version  : Especial.
% 0.19/0.58  % English  :
% 0.19/0.58  
% 0.19/0.58  % Refs     : [KM64]  Kalish & Montegue (1964), Logic: Techniques of Formal
% 0.19/0.58  %          : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au
% 0.19/0.58  %          : [Hah94] Haehnle (1994), Email to G. Sutcliffe
% 0.19/0.58  % Source   : [Hah94]
% 0.19/0.58  % Names    : Pelletier 31 [Pel86]
% 0.19/0.58  
% 0.19/0.58  % Status   : Theorem
% 0.19/0.58  % Rating   : 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.58  % Syntax   : Number of formulae    :    4 (   0 unt;   0 def)
% 0.19/0.58  %            Number of atoms       :    9 (   0 equ)
% 0.19/0.58  %            Maximal formula atoms :    3 (   2 avg)
% 0.19/0.58  %            Number of connectives :    7 (   2   ~;   1   |;   3   &)
% 0.19/0.58  %                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
% 0.19/0.58  %            Maximal formula depth :    5 (   4 avg)
% 0.19/0.58  %            Maximal term depth    :    1 (   1 avg)
% 0.19/0.58  %            Number of predicates  :    5 (   5 usr;   0 prp; 1-1 aty)
% 0.19/0.58  %            Number of functors    :    0 (   0 usr;   0 con; --- aty)
% 0.19/0.58  %            Number of variables   :    4 (   1   !;   3   ?)
% 0.19/0.58  % SPC      : FOF_THM_EPR_NEQ
% 0.19/0.58  
% 0.19/0.58  % Comments :
% 0.19/0.58  %--------------------------------------------------------------------------
% 0.19/0.58  fof(pel31_1,axiom,
% 0.19/0.58      ~ ? [X] :
% 0.19/0.58          ( big_f(X)
% 0.19/0.58          & ( big_g(X)
% 0.19/0.58            | big_h(X) ) ) ).
% 0.19/0.58  
% 0.19/0.58  fof(pel31_2,axiom,
% 0.19/0.58      ? [X] :
% 0.19/0.58        ( big_i(X)
% 0.19/0.58        & big_f(X) ) ).
% 0.19/0.58  
% 0.19/0.58  fof(pel31_3,axiom,
% 0.19/0.58      ! [X] :
% 0.19/0.58        ( ~ big_h(X)
% 0.19/0.58       => big_j(X) ) ).
% 0.19/0.58  
% 0.19/0.58  fof(pel31,conjecture,
% 0.19/0.58      ? [X] :
% 0.19/0.58        ( big_i(X)
% 0.19/0.58        & big_j(X) ) ).
% 0.19/0.58  
% 0.19/0.58  %--------------------------------------------------------------------------
% 0.19/0.58  %-------------------------------------------
% 0.19/0.58  % Proof found
% 0.19/0.58  % SZS status Theorem for theBenchmark
% 0.19/0.58  % SZS output start Proof
% 0.19/0.58  %ClaNum:6(EqnAxiom:0)
% 0.19/0.58  %VarNum:8(SingletonVarNum:4)
% 0.19/0.58  %MaxLitNum:2
% 0.19/0.58  %MaxfuncDepth:0
% 0.19/0.58  %SharedTerms:3
% 0.19/0.58  %goalClause: 6
% 0.19/0.58  [1]P1(a1)
% 0.19/0.58  [2]P2(a1)
% 0.19/0.58  [3]P5(x31)+P3(x31)
% 0.19/0.58  [4]~P4(x41)+~P1(x41)
% 0.19/0.58  [5]~P3(x51)+~P1(x51)
% 0.19/0.58  [6]~P5(x61)+~P2(x61)
% 0.19/0.58  %EqnAxiom
% 0.19/0.58  
% 0.19/0.58  %-------------------------------------------
% 0.19/0.58  cnf(11,plain,
% 0.19/0.58     ($false),
% 0.19/0.58     inference(scs_inference,[],[1,2,6,5,3]),
% 0.19/0.58     ['proof']).
% 0.19/0.58  % SZS output end Proof
% 0.19/0.58  % Total time :0.000000s
%------------------------------------------------------------------------------