↑ Up

CSE---1.7.THM-CRf.s

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

% Computer : n032.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:20 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.08  % Problem    : SEU148+3 : TPTP v8.2.0. Released v3.2.0.
% 0.02/0.08  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.07/0.26  % Computer : n032.cluster.edu
% 0.07/0.26  % Model    : x86_64 x86_64
% 0.07/0.26  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26  % Memory   : 8042.1875MB
% 0.07/0.26  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26  % CPULimit   : 300
% 0.07/0.26  % WCLimit    : 300
% 0.07/0.26  % DateTime   : Fri Jun 21 13:49:38 EDT 2024
% 0.07/0.26  % CPUTime    : 
% 0.11/0.44  start to proof:theBenchmark
% 0.11/0.47  %-------------------------------------------
% 0.11/0.47  % File        :CSE---1.7
% 0.11/0.47  % Problem     :theBenchmark
% 0.11/0.47  % Transform   :cnf
% 0.11/0.47  % Format      :tptp:raw
% 0.11/0.47  % Command     :java -jar mcs_scs.jar %d %s
% 0.11/0.47  
% 0.11/0.47  % Result      :Theorem 0.000000s
% 0.11/0.47  % Output      :CNFRefutation 0.000000s
% 0.11/0.47  %-------------------------------------------
% 0.11/0.47  %------------------------------------------------------------------------------
% 0.11/0.47  % File     : SEU148+3 : TPTP v8.2.0. Released v3.2.0.
% 0.11/0.47  % Domain   : Set theory
% 0.11/0.47  % Problem  : Basic properties of sets, theorem 6
% 0.11/0.47  % Version  : [Urb06] axioms : Especial.
% 0.11/0.47  % English  :
% 0.11/0.47  
% 0.11/0.47  % Refs     : [Byl90] Bylinski (1990), Some Basic Properties of Sets
% 0.11/0.47  %          : [Urb06] Urban (2006), Email to G. Sutcliffe
% 0.11/0.47  % Source   : [Urb06]
% 0.11/0.47  % Names    : zfmisc_1__t6_zfmisc_1 [Urb06]
% 0.11/0.47  
% 0.11/0.47  % Status   : Theorem
% 0.11/0.47  % Rating   : 0.11 v7.5.0, 0.12 v7.4.0, 0.10 v7.2.0, 0.07 v7.1.0, 0.09 v7.0.0, 0.03 v6.4.0, 0.08 v6.3.0, 0.12 v6.2.0, 0.20 v6.1.0, 0.30 v5.5.0, 0.19 v5.4.0, 0.21 v5.3.0, 0.22 v5.2.0, 0.00 v5.0.0, 0.12 v4.1.0, 0.13 v4.0.0, 0.12 v3.7.0, 0.10 v3.5.0, 0.11 v3.3.0, 0.14 v3.2.0
% 0.11/0.47  % Syntax   : Number of formulae    :    9 (   5 unt;   0 def)
% 0.11/0.47  %            Number of atoms       :   15 (   6 equ)
% 0.11/0.47  %            Maximal formula atoms :    3 (   1 avg)
% 0.11/0.47  %            Number of connectives :    9 (   3   ~;   1   |;   0   &)
% 0.11/0.47  %                                         (   3 <=>;   2  =>;   0  <=;   0 <~>)
% 0.11/0.47  %            Maximal formula depth :    6 (   4 avg)
% 0.11/0.47  %            Maximal term depth    :    2 (   1 avg)
% 0.11/0.47  %            Number of predicates  :    4 (   3 usr;   0 prp; 1-2 aty)
% 0.11/0.47  %            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
% 0.11/0.47  %            Number of variables   :   14 (  12   !;   2   ?)
% 0.11/0.47  % SPC      : FOF_THM_RFO_SEQ
% 0.11/0.47  
% 0.11/0.47  % Comments : Translated by MPTP 0.2 from the original problem in the Mizar
% 0.11/0.47  %            library, www.mizar.org
% 0.11/0.47  %------------------------------------------------------------------------------
% 0.11/0.47  fof(antisymmetry_r2_hidden,axiom,
% 0.11/0.47      ! [A,B] :
% 0.11/0.47        ( in(A,B)
% 0.11/0.47       => ~ in(B,A) ) ).
% 0.11/0.47  
% 0.11/0.47  fof(d1_tarski,axiom,
% 0.11/0.47      ! [A,B] :
% 0.11/0.47        ( B = singleton(A)
% 0.11/0.47      <=> ! [C] :
% 0.11/0.47            ( in(C,B)
% 0.11/0.47          <=> C = A ) ) ).
% 0.11/0.47  
% 0.11/0.47  fof(fc1_xboole_0,axiom,
% 0.11/0.47      empty(empty_set) ).
% 0.11/0.47  
% 0.11/0.47  fof(l1_zfmisc_1,axiom,
% 0.11/0.47      ! [A] : singleton(A) != empty_set ).
% 0.11/0.47  
% 0.11/0.47  fof(l4_zfmisc_1,axiom,
% 0.11/0.47      ! [A,B] :
% 0.11/0.47        ( subset(A,singleton(B))
% 0.11/0.47      <=> ( A = empty_set
% 0.11/0.47          | A = singleton(B) ) ) ).
% 0.11/0.48  
% 0.11/0.48  fof(rc1_xboole_0,axiom,
% 0.11/0.48      ? [A] : empty(A) ).
% 0.11/0.48  
% 0.11/0.48  fof(rc2_xboole_0,axiom,
% 0.11/0.48      ? [A] : ~ empty(A) ).
% 0.11/0.48  
% 0.11/0.48  fof(reflexivity_r1_tarski,axiom,
% 0.11/0.48      ! [A,B] : subset(A,A) ).
% 0.11/0.48  
% 0.11/0.48  fof(t6_zfmisc_1,conjecture,
% 0.11/0.48      ! [A,B] :
% 0.11/0.48        ( subset(singleton(A),singleton(B))
% 0.11/0.48       => A = B ) ).
% 0.11/0.48  
% 0.11/0.48  %------------------------------------------------------------------------------
% 0.11/0.48  %-------------------------------------------
% 0.11/0.48  % Proof found
% 0.11/0.48  % SZS status Theorem for theBenchmark
% 0.11/0.48  % SZS output start Proof
% 0.11/0.48  %ClaNum:26(EqnAxiom:11)
% 0.11/0.48  %VarNum:47(SingletonVarNum:20)
% 0.11/0.48  %MaxLitNum:3
% 0.11/0.48  %MaxfuncDepth:1
% 0.11/0.48  %SharedTerms:12
% 0.11/0.48  %goalClause: 15 16
% 0.11/0.48  %singleGoalClaCount:2
% 0.11/0.48  [12]P1(a1)
% 0.11/0.48  [13]P1(a2)
% 0.11/0.48  [16]~E(a7,a4)
% 0.11/0.48  [17]~P1(a5)
% 0.11/0.48  [15]P2(f6(a4),f6(a7))
% 0.11/0.48  [14]P2(x141,x141)
% 0.11/0.48  [18]~E(f6(x181),a1)
% 0.11/0.48  [24]~P3(x242,x241)+~P3(x241,x242)
% 0.11/0.48  [19]~E(x191,a1)+P2(x191,f6(x192))
% 0.11/0.48  [21]P2(x211,f6(x212))+~E(x211,f6(x212))
% 0.11/0.48  [23]E(x231,a1)+E(x231,f6(x232))+~P2(x231,f6(x232))
% 0.11/0.48  [25]E(f3(x252,x251),x252)+P3(f3(x252,x251),x251)+E(x251,f6(x252))
% 0.11/0.48  [26]~E(f3(x262,x261),x262)+~P3(f3(x262,x261),x261)+E(x261,f6(x262))
% 0.11/0.48  [20]P3(x201,x202)+~E(x201,x203)+~E(x202,f6(x203))
% 0.11/0.48  [22]~P3(x221,x223)+E(x221,x222)+~E(x223,f6(x222))
% 0.11/0.48  %EqnAxiom
% 0.11/0.48  [1]E(x11,x11)
% 0.11/0.48  [2]E(x22,x21)+~E(x21,x22)
% 0.11/0.48  [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 0.11/0.48  [4]~E(x41,x42)+E(f6(x41),f6(x42))
% 0.11/0.48  [5]~E(x51,x52)+E(f3(x51,x53),f3(x52,x53))
% 0.11/0.48  [6]~E(x61,x62)+E(f3(x63,x61),f3(x63,x62))
% 0.11/0.48  [7]~P1(x71)+P1(x72)+~E(x71,x72)
% 0.11/0.48  [8]P3(x82,x83)+~E(x81,x82)+~P3(x81,x83)
% 0.11/0.48  [9]P3(x93,x92)+~E(x91,x92)+~P3(x93,x91)
% 0.11/0.48  [10]P2(x102,x103)+~E(x101,x102)+~P2(x101,x103)
% 0.11/0.48  [11]P2(x113,x112)+~E(x111,x112)+~P2(x113,x111)
% 0.11/0.48  
% 0.11/0.48  %-------------------------------------------
% 0.11/0.48  cnf(29,plain,
% 0.11/0.48     (~P3(x291,f6(x292))+E(x291,x292)),
% 0.11/0.48     inference(equality_inference,[],[22])).
% 0.11/0.48  cnf(30,plain,
% 0.11/0.48     (~P3(a7,f6(a4))),
% 0.11/0.48     inference(scs_inference,[],[16,29])).
% 0.11/0.48  cnf(32,plain,
% 0.11/0.48     (E(f6(a4),f6(a7))),
% 0.11/0.48     inference(scs_inference,[],[15,16,18,29,23])).
% 0.11/0.48  cnf(51,plain,
% 0.11/0.48     ($false),
% 0.11/0.48     inference(scs_inference,[],[32,30,20]),
% 0.11/0.48     ['proof']).
% 0.11/0.48  % SZS output end Proof
% 0.11/0.48  % Total time :0.000000s
%------------------------------------------------------------------------------