↑ Up

CSE---1.7.THM-CRf.s

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

% Computer : n018.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:19 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem    : SYN358+1 : TPTP v8.2.0. Released v2.0.0.
% 0.06/0.11  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.31  % Computer : n018.cluster.edu
% 0.12/0.31  % Model    : x86_64 x86_64
% 0.12/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31  % Memory   : 8042.1875MB
% 0.12/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31  % CPULimit   : 300
% 0.12/0.31  % WCLimit    : 300
% 0.12/0.31  % DateTime   : Sun Jun 23 21:52:54 EDT 2024
% 0.12/0.31  % CPUTime    : 
% 0.45/0.54  start to proof:theBenchmark
% 0.51/0.58  %-------------------------------------------
% 0.51/0.58  % File        :CSE---1.7
% 0.51/0.58  % Problem     :theBenchmark
% 0.51/0.58  % Transform   :cnf
% 0.51/0.58  % Format      :tptp:raw
% 0.51/0.58  % Command     :java -jar mcs_scs.jar %d %s
% 0.51/0.58  
% 0.51/0.58  % Result      :Theorem 0.000000s
% 0.51/0.58  % Output      :CNFRefutation 0.000000s
% 0.51/0.58  %-------------------------------------------
% 0.51/0.58  %--------------------------------------------------------------------------
% 0.51/0.58  % File     : SYN358+1 : TPTP v8.2.0. Released v2.0.0.
% 0.51/0.58  % Domain   : Syntactic
% 0.51/0.58  % Problem  : Peter Andrews Problem X2109
% 0.51/0.58  % Version  : Especial.
% 0.51/0.58  % English  :
% 0.51/0.58  
% 0.51/0.58  % Refs     : [And86] Andrews (1986), An Introduction to Mathematical Logic
% 0.51/0.58  %          : [And94] Andrews (1994), Email to G. Sutcliffe
% 0.51/0.58  % Source   : [And94]
% 0.51/0.58  % Names    : X2109 [And86]
% 0.51/0.58  
% 0.51/0.58  % Status   : Theorem
% 0.51/0.58  % Rating   : 0.00 v6.0.0, 0.33 v5.5.0, 0.11 v5.4.0, 0.00 v5.3.0, 0.09 v5.2.0, 0.00 v2.1.0
% 0.51/0.58  % Syntax   : Number of formulae    :    1 (   0 unt;   0 def)
% 0.51/0.58  %            Number of atoms       :    4 (   0 equ)
% 0.51/0.58  %            Maximal formula atoms :    4 (   4 avg)
% 0.51/0.58  %            Number of connectives :    3 (   0   ~;   0   |;   2   &)
% 0.51/0.58  %                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
% 0.51/0.58  %            Maximal formula depth :    4 (   4 avg)
% 0.51/0.58  %            Maximal term depth    :    1 (   1 avg)
% 0.51/0.58  %            Number of predicates  :    2 (   2 usr;   1 prp; 0-1 aty)
% 0.51/0.58  %            Number of functors    :    0 (   0 usr;   0 con; --- aty)
% 0.51/0.58  %            Number of variables   :    2 (   0   !;   2   ?)
% 0.51/0.58  % SPC      : FOF_THM_EPR_NEQ
% 0.51/0.58  
% 0.51/0.58  % Comments :
% 0.51/0.58  %--------------------------------------------------------------------------
% 0.51/0.58  fof(x2109,conjecture,
% 0.51/0.58      ( ? [X] :
% 0.51/0.58          ( p
% 0.51/0.58          & big_q(X) )
% 0.51/0.58    <=> ( p
% 0.51/0.58        & ? [X] : big_q(X) ) ) ).
% 0.51/0.58  
% 0.51/0.58  %--------------------------------------------------------------------------
% 0.51/0.58  %-------------------------------------------
% 0.51/0.58  % Proof found
% 0.51/0.58  % SZS status Theorem for theBenchmark
% 0.51/0.58  % SZS output start Proof
% 0.51/0.58  %ClaNum:5(EqnAxiom:0)
% 0.51/0.58  %VarNum:2(SingletonVarNum:2)
% 0.51/0.58  %MaxLitNum:3
% 0.51/0.58  %MaxfuncDepth:0
% 0.51/0.58  %SharedTerms:7
% 0.51/0.58  %goalClause: 1 4 5
% 0.51/0.58  %singleGoalClaCount:1
% 0.51/0.58  [1]P1(a5000)
% 0.51/0.58  [4]P2(a1)+P2(a2)
% 0.51/0.58  [5]~P2(x51)+~P2(x52)+~P1(a5000)
% 0.51/0.58  %EqnAxiom
% 0.51/0.58  
% 0.51/0.58  %-------------------------------------------
% 0.51/0.59  cnf(6,plain,
% 0.51/0.59     (~P2(x61)+~P2(x62)),
% 0.51/0.59     inference(scs_inference,[],[1,5])).
% 0.51/0.59  cnf(7,plain,
% 0.51/0.59     (P2(a2)),
% 0.51/0.59     inference(scs_inference,[],[4,6])).
% 0.51/0.59  cnf(9,plain,
% 0.51/0.59     ($false),
% 0.51/0.59     inference(scs_inference,[],[7,6]),
% 0.51/0.59     ['proof']).
% 0.51/0.59  % SZS output end Proof
% 0.51/0.59  % Total time :0.000000s
%------------------------------------------------------------------------------