↑ Up

CSE---1.7.THM-CRf.s

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

% Computer : n029.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 15:01:08 EDT 2024

% Result   : Theorem 0.48s 0.82s
% Output   : CNFRefutation 0.48s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem    : SEU121+1 : TPTP v8.2.0. Released v3.3.0.
% 0.03/0.11  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.11/0.32  % Computer : n029.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 300
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Fri Jun 21 16:57:09 EDT 2024
% 0.11/0.32  % CPUTime    : 
% 0.17/0.55  start to proof:theBenchmark
% 0.48/0.81  %-------------------------------------------
% 0.48/0.81  % File        :CSE---1.7
% 0.48/0.81  % Problem     :theBenchmark
% 0.48/0.81  % Transform   :cnf
% 0.48/0.81  % Format      :tptp:raw
% 0.48/0.81  % Command     :java -jar mcs_scs.jar %d %s
% 0.48/0.81  
% 0.48/0.81  % Result      :Theorem 0.230000s
% 0.48/0.81  % Output      :CNFRefutation 0.230000s
% 0.48/0.81  %-------------------------------------------
% 0.48/0.82  %------------------------------------------------------------------------------
% 0.48/0.82  % File     : SEU121+1 : TPTP v8.2.0. Released v3.3.0.
% 0.48/0.82  % Domain   : Set theory
% 0.48/0.82  % Problem  : MPTP bushy problem t1_xboole_1
% 0.48/0.82  % Version  : [Urb07] axioms : Especial.
% 0.48/0.82  % English  :
% 0.48/0.82  
% 0.48/0.82  % Refs     : [Ban01] Bancerek et al. (2001), On the Characterizations of Co
% 0.48/0.82  %          : [Urb07] Urban (2006), Email to G. Sutcliffe
% 0.48/0.82  % Source   : [Urb07]
% 0.48/0.82  % Names    : bushy-t1_xboole_1 [Urb07]
% 0.48/0.82  
% 0.48/0.82  % Status   : Theorem
% 0.48/0.82  % Rating   : 0.06 v8.1.0, 0.03 v7.2.0, 0.00 v6.4.0, 0.04 v6.3.0, 0.08 v6.1.0, 0.03 v6.0.0, 0.04 v5.5.0, 0.00 v5.4.0, 0.04 v5.3.0, 0.07 v5.2.0, 0.00 v4.0.0, 0.04 v3.7.0, 0.00 v3.3.0
% 0.48/0.82  % Syntax   : Number of formulae    :   11 (   5 unt;   0 def)
% 0.48/0.82  %            Number of atoms       :   20 (   2 equ)
% 0.48/0.82  %            Maximal formula atoms :    3 (   1 avg)
% 0.48/0.82  %            Number of connectives :   14 (   5   ~;   0   |;   4   &)
% 0.48/0.82  %                                         (   1 <=>;   4  =>;   0  <=;   0 <~>)
% 0.48/0.82  %            Maximal formula depth :    7 (   4 avg)
% 0.48/0.82  %            Maximal term depth    :    1 (   1 avg)
% 0.48/0.82  %            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
% 0.48/0.82  %            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
% 0.48/0.82  %            Number of variables   :   17 (  15   !;   2   ?)
% 0.48/0.82  % SPC      : FOF_THM_RFO_SEQ
% 0.48/0.82  
% 0.48/0.82  % Comments : Translated by MPTP 0.2 from the original problem in the Mizar
% 0.48/0.82  %            library, www.mizar.org
% 0.48/0.82  %------------------------------------------------------------------------------
% 0.48/0.82  fof(antisymmetry_r2_hidden,axiom,
% 0.48/0.82      ! [A,B] :
% 0.48/0.82        ( in(A,B)
% 0.48/0.82       => ~ in(B,A) ) ).
% 0.48/0.82  
% 0.48/0.82  fof(d3_tarski,axiom,
% 0.48/0.82      ! [A,B] :
% 0.48/0.82        ( subset(A,B)
% 0.48/0.82      <=> ! [C] :
% 0.48/0.82            ( in(C,A)
% 0.48/0.82           => in(C,B) ) ) ).
% 0.48/0.82  
% 0.48/0.82  fof(dt_k1_xboole_0,axiom,
% 0.48/0.82      $true ).
% 0.48/0.82  
% 0.48/0.82  fof(fc1_xboole_0,axiom,
% 0.48/0.82      empty(empty_set) ).
% 0.48/0.82  
% 0.48/0.82  fof(rc1_xboole_0,axiom,
% 0.48/0.82      ? [A] : empty(A) ).
% 0.48/0.82  
% 0.48/0.82  fof(rc2_xboole_0,axiom,
% 0.48/0.82      ? [A] : ~ empty(A) ).
% 0.48/0.82  
% 0.48/0.82  fof(reflexivity_r1_tarski,axiom,
% 0.48/0.82      ! [A,B] : subset(A,A) ).
% 0.48/0.82  
% 0.48/0.82  fof(t1_xboole_1,conjecture,
% 0.48/0.82      ! [A,B,C] :
% 0.48/0.82        ( ( subset(A,B)
% 0.48/0.82          & subset(B,C) )
% 0.48/0.82       => subset(A,C) ) ).
% 0.48/0.82  
% 0.48/0.82  fof(t6_boole,axiom,
% 0.48/0.82      ! [A] :
% 0.48/0.82        ( empty(A)
% 0.48/0.82       => A = empty_set ) ).
% 0.48/0.82  
% 0.48/0.82  fof(t7_boole,axiom,
% 0.48/0.82      ! [A,B] :
% 0.48/0.82        ~ ( in(A,B)
% 0.48/0.82          & empty(B) ) ).
% 0.48/0.82  
% 0.48/0.82  fof(t8_boole,axiom,
% 0.48/0.82      ! [A,B] :
% 0.48/0.82        ~ ( empty(A)
% 0.48/0.82          & A != B
% 0.48/0.82          & empty(B) ) ).
% 0.48/0.82  
% 0.48/0.82  %------------------------------------------------------------------------------
% 0.48/0.82  %-------------------------------------------
% 0.48/0.82  % Proof found
% 0.48/0.82  % SZS status Theorem for theBenchmark
% 0.48/0.82  % SZS output start Proof
% 0.48/0.82  %ClaNum:24(EqnAxiom:10)
% 0.48/0.82  %VarNum:31(SingletonVarNum:15)
% 0.48/0.82  %MaxLitNum:3
% 0.48/0.82  %MaxfuncDepth:1
% 0.48/0.82  %SharedTerms:12
% 0.48/0.82  %goalClause: 13 14 17
% 0.48/0.82  %singleGoalClaCount:3
% 0.48/0.82  [11]P1(a1)
% 0.48/0.82  [12]P1(a2)
% 0.48/0.82  [13]P2(a4,a6)
% 0.48/0.82  [14]P2(a6,a7)
% 0.48/0.82  [16]~P1(a5)
% 0.48/0.82  [17]~P2(a4,a7)
% 0.48/0.82  [15]P2(x151,x151)
% 0.48/0.82  [18]~P1(x181)+E(x181,a1)
% 0.48/0.82  [20]~P1(x201)+~P3(x202,x201)
% 0.48/0.82  [21]~P3(x212,x211)+~P3(x211,x212)
% 0.48/0.82  [22]P2(x221,x222)+P3(f3(x221,x222),x221)
% 0.48/0.82  [24]P2(x241,x242)+~P3(f3(x241,x242),x242)
% 0.48/0.82  [19]~P1(x192)+~P1(x191)+E(x191,x192)
% 0.48/0.83  [23]~P2(x233,x232)+P3(x231,x232)+~P3(x231,x233)
% 0.48/0.83  %EqnAxiom
% 0.48/0.83  [1]E(x11,x11)
% 0.48/0.83  [2]E(x22,x21)+~E(x21,x22)
% 0.48/0.83  [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 0.48/0.83  [4]~E(x41,x42)+E(f3(x41,x43),f3(x42,x43))
% 0.48/0.83  [5]~E(x51,x52)+E(f3(x53,x51),f3(x53,x52))
% 0.48/0.83  [6]~P1(x61)+P1(x62)+~E(x61,x62)
% 0.48/0.83  [7]P3(x72,x73)+~E(x71,x72)+~P3(x71,x73)
% 0.48/0.83  [8]P3(x83,x82)+~E(x81,x82)+~P3(x83,x81)
% 0.48/0.83  [9]P2(x92,x93)+~E(x91,x92)+~P2(x91,x93)
% 0.48/0.83  [10]P2(x103,x102)+~E(x101,x102)+~P2(x103,x101)
% 0.48/0.83  
% 0.48/0.83  %-------------------------------------------
% 0.48/0.83  cnf(53,plain,
% 0.48/0.83     (P2(x531,a6)+~E(a4,x531)),
% 0.48/0.83     inference(scs_inference,[],[13,9])).
% 0.48/0.83  cnf(64,plain,
% 0.48/0.83     (~E(x641,a4)+~P3(f3(x641,a7),a7)),
% 0.48/0.83     inference(scs_inference,[],[17,24,9])).
% 0.48/0.83  cnf(65,plain,
% 0.48/0.83     (~P3(f3(a4,a7),a7)),
% 0.48/0.83     inference(equality_inference,[],[64])).
% 0.48/0.83  cnf(148,plain,
% 0.48/0.83     (~P3(x1481,x1482)+P3(x1481,a6)+~E(a4,x1482)),
% 0.48/0.83     inference(scs_inference,[],[53,23])).
% 0.48/0.83  cnf(149,plain,
% 0.48/0.83     (~P3(x1491,a4)+P3(x1491,a6)),
% 0.48/0.83     inference(equality_inference,[],[148])).
% 0.48/0.83  cnf(150,plain,
% 0.48/0.83     (~P3(f3(a4,a7),a4)),
% 0.48/0.83     inference(scs_inference,[],[14,65,149,23])).
% 0.48/0.83  cnf(151,plain,
% 0.48/0.83     ($false),
% 0.48/0.83     inference(scs_inference,[],[17,150,22]),
% 0.48/0.83     ['proof']).
% 0.48/0.83  % SZS output end Proof
% 0.48/0.83  % Total time :0.230000s
%------------------------------------------------------------------------------