↑ Up

CSE---1.7.THM-CRf.s

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

% Computer : n027.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:02:08 EDT 2024

% Result   : Theorem 0.74s 0.86s
% Output   : CNFRefutation 0.84s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SEU263+1 : TPTP v8.2.0. Released v3.3.0.
% 0.07/0.12  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33  % Computer : n027.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.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Fri Jun 21 15:10:09 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.19/0.58  start to proof:theBenchmark
% 0.74/0.85  %-------------------------------------------
% 0.74/0.85  % File        :CSE---1.7
% 0.74/0.85  % Problem     :theBenchmark
% 0.74/0.85  % Transform   :cnf
% 0.74/0.85  % Format      :tptp:raw
% 0.74/0.85  % Command     :java -jar mcs_scs.jar %d %s
% 0.74/0.85  
% 0.74/0.85  % Result      :Theorem 0.230000s
% 0.74/0.85  % Output      :CNFRefutation 0.230000s
% 0.74/0.85  %-------------------------------------------
% 0.74/0.86  %------------------------------------------------------------------------------
% 0.74/0.86  % File     : SEU263+1 : TPTP v8.2.0. Released v3.3.0.
% 0.74/0.86  % Domain   : Set theory
% 0.74/0.86  % Problem  : MPTP bushy problem t14_relset_1
% 0.74/0.86  % Version  : [Urb07] axioms : Especial.
% 0.74/0.86  % English  :
% 0.74/0.86  
% 0.74/0.86  % Refs     : [Ban01] Bancerek et al. (2001), On the Characterizations of Co
% 0.74/0.86  %          : [Urb07] Urban (2006), Email to G. Sutcliffe
% 0.74/0.86  % Source   : [Urb07]
% 0.74/0.86  % Names    : bushy-t14_relset_1 [Urb07]
% 0.74/0.86  
% 0.74/0.86  % Status   : Theorem
% 0.74/0.86  % Rating   : 0.06 v8.2.0, 0.00 v8.1.0, 0.07 v7.5.0, 0.10 v7.4.0, 0.00 v7.0.0, 0.07 v6.3.0, 0.15 v6.2.0, 0.09 v6.1.0, 0.16 v6.0.0, 0.25 v5.5.0, 0.21 v5.4.0, 0.26 v5.3.0, 0.30 v5.2.0, 0.07 v5.0.0, 0.15 v4.1.0, 0.17 v4.0.1, 0.26 v4.0.0, 0.25 v3.7.0, 0.14 v3.5.0, 0.25 v3.4.0, 0.00 v3.3.0
% 0.74/0.86  % Syntax   : Number of formulae    :   20 (  10 unt;   0 def)
% 0.74/0.86  %            Number of atoms       :   34 (   0 equ)
% 0.74/0.86  %            Maximal formula atoms :    3 (   1 avg)
% 0.74/0.86  %            Number of connectives :   14 (   0   ~;   0   |;   3   &)
% 0.74/0.86  %                                         (   3 <=>;   8  =>;   0  <=;   0 <~>)
% 0.74/0.86  %            Maximal formula depth :    7 (   4 avg)
% 0.74/0.86  %            Maximal term depth    :    3 (   1 avg)
% 0.74/0.86  %            Number of predicates  :    6 (   5 usr;   1 prp; 0-3 aty)
% 0.74/0.86  %            Number of functors    :    4 (   4 usr;   0 con; 1-2 aty)
% 0.74/0.86  %            Number of variables   :   39 (  36   !;   3   ?)
% 0.74/0.86  % SPC      : FOF_THM_RFO_NEQ
% 0.74/0.86  
% 0.74/0.86  % Comments : Translated by MPTP 0.2 from the original problem in the Mizar
% 0.74/0.86  %            library, www.mizar.org
% 0.74/0.86  %------------------------------------------------------------------------------
% 0.74/0.86  fof(cc1_relset_1,axiom,
% 0.74/0.86      ! [A,B,C] :
% 0.74/0.86        ( element(C,powerset(cartesian_product2(A,B)))
% 0.74/0.86       => relation(C) ) ).
% 0.74/0.86  
% 0.74/0.86  fof(d1_relset_1,axiom,
% 0.74/0.86      ! [A,B,C] :
% 0.74/0.86        ( relation_of2(C,A,B)
% 0.74/0.86      <=> subset(C,cartesian_product2(A,B)) ) ).
% 0.74/0.86  
% 0.74/0.86  fof(dt_k1_relat_1,axiom,
% 0.74/0.86      $true ).
% 0.74/0.86  
% 0.74/0.86  fof(dt_k1_zfmisc_1,axiom,
% 0.74/0.86      $true ).
% 0.74/0.86  
% 0.74/0.86  fof(dt_k2_relat_1,axiom,
% 0.74/0.86      $true ).
% 0.74/0.86  
% 0.74/0.86  fof(dt_k2_zfmisc_1,axiom,
% 0.74/0.86      $true ).
% 0.74/0.86  
% 0.74/0.86  fof(dt_m1_relset_1,axiom,
% 0.74/0.86      $true ).
% 0.74/0.86  
% 0.74/0.86  fof(dt_m1_subset_1,axiom,
% 0.74/0.86      $true ).
% 0.74/0.86  
% 0.74/0.86  fof(dt_m2_relset_1,axiom,
% 0.74/0.86      ! [A,B,C] :
% 0.74/0.86        ( relation_of2_as_subset(C,A,B)
% 0.74/0.86       => element(C,powerset(cartesian_product2(A,B))) ) ).
% 0.74/0.86  
% 0.74/0.86  fof(existence_m1_relset_1,axiom,
% 0.74/0.86      ! [A,B] :
% 0.74/0.86      ? [C] : relation_of2(C,A,B) ).
% 0.74/0.86  
% 0.74/0.86  fof(existence_m1_subset_1,axiom,
% 0.74/0.86      ! [A] :
% 0.74/0.86      ? [B] : element(B,A) ).
% 0.74/0.86  
% 0.74/0.86  fof(existence_m2_relset_1,axiom,
% 0.74/0.86      ! [A,B] :
% 0.74/0.86      ? [C] : relation_of2_as_subset(C,A,B) ).
% 0.74/0.86  
% 0.74/0.86  fof(redefinition_m2_relset_1,axiom,
% 0.74/0.86      ! [A,B,C] :
% 0.74/0.86        ( relation_of2_as_subset(C,A,B)
% 0.74/0.86      <=> relation_of2(C,A,B) ) ).
% 0.74/0.86  
% 0.74/0.86  fof(reflexivity_r1_tarski,axiom,
% 0.74/0.86      ! [A,B] : subset(A,A) ).
% 0.74/0.86  
% 0.74/0.86  fof(t119_zfmisc_1,axiom,
% 0.74/0.86      ! [A,B,C,D] :
% 0.74/0.86        ( ( subset(A,B)
% 0.74/0.86          & subset(C,D) )
% 0.74/0.86       => subset(cartesian_product2(A,C),cartesian_product2(B,D)) ) ).
% 0.74/0.86  
% 0.74/0.86  fof(t12_relset_1,axiom,
% 0.74/0.86      ! [A,B,C] :
% 0.74/0.86        ( relation_of2_as_subset(C,A,B)
% 0.74/0.86       => ( subset(relation_dom(C),A)
% 0.74/0.86          & subset(relation_rng(C),B) ) ) ).
% 0.74/0.86  
% 0.74/0.86  fof(t14_relset_1,conjecture,
% 0.74/0.86      ! [A,B,C,D] :
% 0.74/0.86        ( relation_of2_as_subset(D,C,A)
% 0.74/0.86       => ( subset(relation_rng(D),B)
% 0.74/0.86         => relation_of2_as_subset(D,C,B) ) ) ).
% 0.74/0.86  
% 0.74/0.86  fof(t1_xboole_1,axiom,
% 0.74/0.86      ! [A,B,C] :
% 0.74/0.86        ( ( subset(A,B)
% 0.74/0.86          & subset(B,C) )
% 0.74/0.86       => subset(A,C) ) ).
% 0.74/0.86  
% 0.74/0.86  fof(t21_relat_1,axiom,
% 0.74/0.86      ! [A] :
% 0.74/0.86        ( relation(A)
% 0.74/0.86       => subset(A,cartesian_product2(relation_dom(A),relation_rng(A))) ) ).
% 0.74/0.86  
% 0.74/0.86  fof(t3_subset,axiom,
% 0.74/0.86      ! [A,B] :
% 0.74/0.86        ( element(A,powerset(B))
% 0.74/0.86      <=> subset(A,B) ) ).
% 0.74/0.86  
% 0.74/0.86  %------------------------------------------------------------------------------
% 0.74/0.86  %-------------------------------------------
% 0.74/0.86  % Proof found
% 0.74/0.86  % SZS status Theorem for theBenchmark
% 0.74/0.86  % SZS output start Proof
% 0.74/0.86  %ClaNum:20(EqnAxiom:0)
% 0.74/0.86  %VarNum:82(SingletonVarNum:42)
% 0.74/0.86  %MaxLitNum:3
% 0.74/0.86  %MaxfuncDepth:2
% 0.74/0.86  %SharedTerms:8
% 0.74/0.86  %goalClause: 2 4 7
% 0.74/0.86  %singleGoalClaCount:3
% 0.74/0.86  [4]P3(a1,a8,a6)
% 0.74/0.86  [7]~P3(a1,a8,a2)
% 0.84/0.86  [2]P1(f9(a1),a2)
% 0.84/0.86  [1]P1(x11,x11)
% 0.84/0.86  [3]P2(f3(x31),x31)
% 0.84/0.86  [5]P4(f4(x51,x52),x51,x52)
% 0.84/0.86  [6]P3(f7(x61,x62),x61,x62)
% 0.84/0.86  [11]~P5(x111)+P1(x111,f5(f11(x111),f9(x111)))
% 0.84/0.86  [8]~P1(x81,x82)+P2(x81,f10(x82))
% 0.84/0.86  [9]P1(x91,x92)+~P2(x91,f10(x92))
% 0.84/0.86  [18]~P3(x181,x182,x183)+P4(x181,x182,x183)
% 0.84/0.86  [19]~P4(x191,x192,x193)+P3(x191,x192,x193)
% 0.84/0.86  [12]~P3(x121,x122,x123)+P1(f11(x121),x122)
% 0.84/0.86  [13]~P3(x131,x133,x132)+P1(f9(x131),x132)
% 0.84/0.86  [16]P4(x161,x162,x163)+~P1(x161,f5(x162,x163))
% 0.84/0.86  [17]~P4(x171,x172,x173)+P1(x171,f5(x172,x173))
% 0.84/0.86  [15]P5(x151)+~P2(x151,f10(f5(x152,x153)))
% 0.84/0.86  [20]~P3(x201,x202,x203)+P2(x201,f10(f5(x202,x203)))
% 0.84/0.86  [10]~P1(x101,x103)+P1(x101,x102)+~P1(x103,x102)
% 0.84/0.86  [14]~P1(x142,x144)+~P1(x141,x143)+P1(f5(x141,x142),f5(x143,x144))
% 0.84/0.86  %EqnAxiom
% 0.84/0.86  
% 0.84/0.86  %-------------------------------------------
% 0.84/0.86  cnf(34,plain,
% 0.84/0.86     (P1(a1,f5(a8,a6))),
% 0.84/0.86     inference(scs_inference,[],[4,18,17])).
% 0.84/0.86  cnf(35,plain,
% 0.84/0.86     (P4(a1,a8,a6)),
% 0.84/0.86     inference(scs_inference,[],[34,16])).
% 0.84/0.86  cnf(37,plain,
% 0.84/0.86     (P2(a1,f10(f5(a8,a6)))),
% 0.84/0.86     inference(scs_inference,[],[35,20,19])).
% 0.84/0.86  cnf(38,plain,
% 0.84/0.86     (P5(a1)),
% 0.84/0.86     inference(scs_inference,[],[37,15])).
% 0.84/0.86  cnf(112,plain,
% 0.84/0.86     (~P1(a1,f5(a8,a2))),
% 0.84/0.86     inference(scs_inference,[],[7,19,16])).
% 0.84/0.86  cnf(125,plain,
% 0.84/0.86     (P1(a1,f5(f11(a1),f9(a1)))),
% 0.84/0.86     inference(scs_inference,[],[38,1,11,10])).
% 0.84/0.86  cnf(153,plain,
% 0.84/0.86     (P1(f5(f11(a1),f9(a1)),f5(a8,a2))),
% 0.84/0.86     inference(scs_inference,[],[2,4,14,12])).
% 0.84/0.86  cnf(156,plain,
% 0.84/0.86     ($false),
% 0.84/0.86     inference(scs_inference,[],[153,125,112,16,10]),
% 0.84/0.86     ['proof']).
% 0.84/0.86  % SZS output end Proof
% 0.84/0.86  % Total time :0.230000s
%------------------------------------------------------------------------------