↑ Up

CSE---1.7.THM-CRf.s

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

% Computer : n017.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:00:55 EDT 2024

% Result   : Theorem 17.16s 17.20s
% Output   : CNFRefutation 17.16s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : SEU047+1 : TPTP v8.2.0. Released v3.2.0.
% 0.03/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34  % Computer : n017.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Fri Jun 21 16:54:54 EDT 2024
% 0.14/0.34  % CPUTime    : 
% 0.54/0.58  start to proof:theBenchmark
% 17.16/17.18  %-------------------------------------------
% 17.16/17.18  % File        :CSE---1.7
% 17.16/17.18  % Problem     :theBenchmark
% 17.16/17.18  % Transform   :cnf
% 17.16/17.18  % Format      :tptp:raw
% 17.16/17.18  % Command     :java -jar mcs_scs.jar %d %s
% 17.16/17.18  
% 17.16/17.18  % Result      :Theorem 16.570000s
% 17.16/17.18  % Output      :CNFRefutation 16.570000s
% 17.16/17.18  %-------------------------------------------
% 17.16/17.19  %------------------------------------------------------------------------------
% 17.16/17.19  % File     : SEU047+1 : TPTP v8.2.0. Released v3.2.0.
% 17.16/17.19  % Domain   : Set theory
% 17.16/17.19  % Problem  : Functions and their basic properties, theorem 97
% 17.16/17.19  % Version  : [Urb06] axioms : Especial.
% 17.16/17.19  % English  :
% 17.16/17.19  
% 17.16/17.19  % Refs     : [Byl90] Bylinski (1990), Functions and Their Basic Properties
% 17.16/17.19  %          : [Urb06] Urban (2006), Email to G. Sutcliffe
% 17.16/17.19  % Source   : [Urb06]
% 17.16/17.19  % Names    : funct_1__t97_funct_1 [Urb06]
% 17.16/17.19  
% 17.16/17.19  % Status   : Theorem
% 17.16/17.19  % Rating   : 0.06 v8.1.0, 0.08 v7.5.0, 0.09 v7.4.0, 0.00 v6.4.0, 0.04 v6.3.0, 0.08 v6.2.0, 0.12 v6.1.0, 0.17 v6.0.0, 0.13 v5.5.0, 0.11 v5.4.0, 0.14 v5.3.0, 0.22 v5.2.0, 0.00 v4.1.0, 0.04 v4.0.1, 0.09 v4.0.0, 0.08 v3.7.0, 0.00 v3.4.0, 0.05 v3.3.0, 0.00 v3.2.0
% 17.16/17.19  % Syntax   : Number of formulae    :   33 (   6 unt;   0 def)
% 17.16/17.19  %            Number of atoms       :   79 (   6 equ)
% 17.16/17.19  %            Maximal formula atoms :    6 (   2 avg)
% 17.16/17.19  %            Number of connectives :   56 (  10   ~;   1   |;  27   &)
% 17.16/17.19  %                                         (   1 <=>;  17  =>;   0  <=;   0 <~>)
% 17.16/17.19  %            Maximal formula depth :    7 (   4 avg)
% 17.16/17.19  %            Maximal term depth    :    3 (   1 avg)
% 17.16/17.19  %            Number of predicates  :    9 (   8 usr;   0 prp; 1-2 aty)
% 17.16/17.19  %            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
% 17.16/17.19  %            Number of variables   :   52 (  41   !;  11   ?)
% 17.16/17.19  % SPC      : FOF_THM_RFO_SEQ
% 17.16/17.19  
% 17.16/17.19  % Comments : Translated by MPTP 0.2 from the original problem in the Mizar
% 17.16/17.19  %            library, www.mizar.org
% 17.16/17.19  %------------------------------------------------------------------------------
% 17.16/17.19  fof(antisymmetry_r2_hidden,axiom,
% 17.16/17.19      ! [A,B] :
% 17.16/17.19        ( in(A,B)
% 17.16/17.19       => ~ in(B,A) ) ).
% 17.16/17.19  
% 17.16/17.19  fof(fc4_relat_1,axiom,
% 17.16/17.19      ( empty(empty_set)
% 17.16/17.19      & relation(empty_set) ) ).
% 17.16/17.19  
% 17.16/17.19  fof(fc12_relat_1,axiom,
% 17.16/17.19      ( empty(empty_set)
% 17.16/17.19      & relation(empty_set)
% 17.16/17.19      & relation_empty_yielding(empty_set) ) ).
% 17.16/17.19  
% 17.16/17.19  fof(fc1_xboole_0,axiom,
% 17.16/17.19      empty(empty_set) ).
% 17.16/17.19  
% 17.16/17.19  fof(t1_subset,axiom,
% 17.16/17.19      ! [A,B] :
% 17.16/17.19        ( in(A,B)
% 17.16/17.19       => element(A,B) ) ).
% 17.16/17.19  
% 17.16/17.19  fof(t4_subset,axiom,
% 17.16/17.19      ! [A,B,C] :
% 17.16/17.19        ( ( in(A,B)
% 17.16/17.19          & element(B,powerset(C)) )
% 17.16/17.19       => element(A,C) ) ).
% 17.16/17.19  
% 17.16/17.19  fof(t5_subset,axiom,
% 17.16/17.19      ! [A,B,C] :
% 17.16/17.19        ~ ( in(A,B)
% 17.16/17.19          & element(B,powerset(C))
% 17.16/17.19          & empty(C) ) ).
% 17.16/17.19  
% 17.16/17.19  fof(existence_m1_subset_1,axiom,
% 17.16/17.19      ! [A] :
% 17.16/17.19      ? [B] : element(B,A) ).
% 17.16/17.19  
% 17.16/17.19  fof(cc1_funct_1,axiom,
% 17.16/17.19      ! [A] :
% 17.16/17.19        ( empty(A)
% 17.16/17.19       => function(A) ) ).
% 17.16/17.19  
% 17.16/17.19  fof(cc2_funct_1,axiom,
% 17.16/17.19      ! [A] :
% 17.16/17.19        ( ( relation(A)
% 17.16/17.19          & empty(A)
% 17.16/17.19          & function(A) )
% 17.16/17.19       => ( relation(A)
% 17.16/17.19          & function(A)
% 17.16/17.19          & one_to_one(A) ) ) ).
% 17.16/17.19  
% 17.16/17.19  fof(fc1_subset_1,axiom,
% 17.16/17.19      ! [A] : ~ empty(powerset(A)) ).
% 17.16/17.19  
% 17.16/17.19  fof(cc1_relat_1,axiom,
% 17.16/17.19      ! [A] :
% 17.16/17.19        ( empty(A)
% 17.16/17.19       => relation(A) ) ).
% 17.16/17.19  
% 17.16/17.19  fof(t2_subset,axiom,
% 17.16/17.19      ! [A,B] :
% 17.16/17.19        ( element(A,B)
% 17.16/17.19       => ( empty(B)
% 17.16/17.19          | in(A,B) ) ) ).
% 17.16/17.19  
% 17.16/17.19  fof(t6_boole,axiom,
% 17.16/17.19      ! [A] :
% 17.16/17.20        ( empty(A)
% 17.16/17.20       => A = empty_set ) ).
% 17.16/17.20  
% 17.16/17.20  fof(t7_boole,axiom,
% 17.16/17.20      ! [A,B] :
% 17.16/17.20        ~ ( in(A,B)
% 17.16/17.20          & empty(B) ) ).
% 17.16/17.20  
% 17.16/17.20  fof(t8_boole,axiom,
% 17.16/17.20      ! [A,B] :
% 17.16/17.20        ~ ( empty(A)
% 17.16/17.20          & A != B
% 17.16/17.20          & empty(B) ) ).
% 17.16/17.20  
% 17.16/17.20  fof(reflexivity_r1_tarski,axiom,
% 17.16/17.20      ! [A,B] : subset(A,A) ).
% 17.16/17.20  
% 17.16/17.20  fof(dt_k8_relat_1,axiom,
% 17.16/17.20      ! [A,B] :
% 17.16/17.20        ( relation(B)
% 17.16/17.20       => relation(relation_rng_restriction(A,B)) ) ).
% 17.16/17.20  
% 17.16/17.20  fof(fc5_funct_1,axiom,
% 17.16/17.20      ! [A,B] :
% 17.16/17.20        ( ( relation(B)
% 17.16/17.20          & function(B) )
% 17.16/17.20       => ( relation(relation_rng_restriction(A,B))
% 17.16/17.20          & function(relation_rng_restriction(A,B)) ) ) ).
% 17.16/17.20  
% 17.16/17.20  fof(rc1_funct_1,axiom,
% 17.16/17.20      ? [A] :
% 17.16/17.20        ( relation(A)
% 17.16/17.20        & function(A) ) ).
% 17.16/17.20  
% 17.16/17.20  fof(rc2_funct_1,axiom,
% 17.16/17.20      ? [A] :
% 17.16/17.20        ( relation(A)
% 17.16/17.20        & empty(A)
% 17.16/17.20        & function(A) ) ).
% 17.16/17.20  
% 17.16/17.20  fof(rc3_funct_1,axiom,
% 17.16/17.20      ? [A] :
% 17.16/17.20        ( relation(A)
% 17.16/17.20        & function(A)
% 17.16/17.20        & one_to_one(A) ) ).
% 17.16/17.20  
% 17.16/17.20  fof(rc1_subset_1,axiom,
% 17.16/17.20      ! [A] :
% 17.16/17.20        ( ~ empty(A)
% 17.16/17.20       => ? [B] :
% 17.16/17.20            ( element(B,powerset(A))
% 17.16/17.20            & ~ empty(B) ) ) ).
% 17.16/17.20  
% 17.16/17.20  fof(rc2_subset_1,axiom,
% 17.16/17.20      ! [A] :
% 17.16/17.20      ? [B] :
% 17.16/17.20        ( element(B,powerset(A))
% 17.16/17.20        & empty(B) ) ).
% 17.16/17.20  
% 17.16/17.20  fof(rc1_relat_1,axiom,
% 17.16/17.20      ? [A] :
% 17.16/17.20        ( empty(A)
% 17.16/17.20        & relation(A) ) ).
% 17.16/17.20  
% 17.16/17.20  fof(rc2_relat_1,axiom,
% 17.16/17.20      ? [A] :
% 17.16/17.20        ( ~ empty(A)
% 17.16/17.20        & relation(A) ) ).
% 17.16/17.20  
% 17.16/17.20  fof(rc3_relat_1,axiom,
% 17.16/17.20      ? [A] :
% 17.16/17.20        ( relation(A)
% 17.16/17.20        & relation_empty_yielding(A) ) ).
% 17.16/17.20  
% 17.16/17.20  fof(rc1_xboole_0,axiom,
% 17.16/17.20      ? [A] : empty(A) ).
% 17.16/17.20  
% 17.16/17.20  fof(rc2_xboole_0,axiom,
% 17.16/17.20      ? [A] : ~ empty(A) ).
% 17.16/17.20  
% 17.16/17.20  fof(t3_subset,axiom,
% 17.16/17.20      ! [A,B] :
% 17.16/17.20        ( element(A,powerset(B))
% 17.16/17.20      <=> subset(A,B) ) ).
% 17.16/17.20  
% 17.16/17.20  fof(t97_funct_1,conjecture,
% 17.16/17.20      ! [A,B,C] :
% 17.16/17.20        ( ( relation(C)
% 17.16/17.20          & function(C) )
% 17.16/17.20       => ( subset(A,B)
% 17.16/17.20         => ( relation_rng_restriction(B,relation_rng_restriction(A,C)) = relation_rng_restriction(A,C)
% 17.16/17.20            & relation_rng_restriction(A,relation_rng_restriction(B,C)) = relation_rng_restriction(A,C) ) ) ) ).
% 17.16/17.20  
% 17.16/17.20  fof(t129_relat_1,axiom,
% 17.16/17.20      ! [A,B,C] :
% 17.16/17.20        ( relation(C)
% 17.16/17.20       => ( subset(A,B)
% 17.16/17.20         => relation_rng_restriction(B,relation_rng_restriction(A,C)) = relation_rng_restriction(A,C) ) ) ).
% 17.16/17.20  
% 17.16/17.20  fof(t130_relat_1,axiom,
% 17.16/17.20      ! [A,B,C] :
% 17.16/17.20        ( relation(C)
% 17.16/17.20       => ( subset(A,B)
% 17.16/17.20         => relation_rng_restriction(A,relation_rng_restriction(B,C)) = relation_rng_restriction(A,C) ) ) ).
% 17.16/17.20  
% 17.16/17.20  %------------------------------------------------------------------------------
% 17.16/17.20  %-------------------------------------------
% 17.16/17.20  % Proof found
% 17.16/17.20  % SZS status Theorem for theBenchmark
% 17.16/17.20  % SZS output start Proof
% 17.16/17.20  %ClaNum:71(EqnAxiom:20)
% 17.16/17.20  %VarNum:85(SingletonVarNum:41)
% 17.16/17.20  %MaxLitNum:4
% 17.16/17.20  %MaxfuncDepth:2
% 17.16/17.20  %SharedTerms:38
% 17.16/17.20  %goalClause: 35 41 44 71
% 17.16/17.20  %singleGoalClaCount:3
% 17.16/17.20  [23]P1(a1)
% 17.16/17.20  [24]P1(a2)
% 17.16/17.20  [25]P1(a10)
% 17.16/17.20  [26]P1(a3)
% 17.16/17.20  [28]P3(a1)
% 17.16/17.20  [29]P3(a4)
% 17.16/17.20  [30]P3(a2)
% 17.16/17.20  [31]P3(a11)
% 17.16/17.20  [32]P3(a10)
% 17.16/17.20  [33]P3(a14)
% 17.16/17.20  [34]P3(a15)
% 17.16/17.20  [35]P3(a5)
% 17.16/17.20  [36]P7(a1)
% 17.16/17.20  [37]P7(a15)
% 17.16/17.20  [38]P4(a4)
% 17.16/17.20  [39]P4(a2)
% 17.16/17.20  [40]P4(a11)
% 17.16/17.20  [41]P4(a5)
% 17.16/17.20  [42]P5(a11)
% 17.16/17.20  [44]P8(a6,a8)
% 17.16/17.20  [48]~P1(a14)
% 17.16/17.20  [49]~P1(a7)
% 17.16/17.20  [45]P8(x451,x451)
% 17.16/17.20  [43]P1(f12(x431))
% 17.16/17.20  [46]P2(f9(x461),x461)
% 17.16/17.20  [47]P2(f12(x471),f16(x471))
% 17.16/17.20  [50]~P1(f16(x501))
% 17.16/17.20  [71]~E(f17(a8,f17(a6,a5)),f17(a6,a5))+~E(f17(a6,f17(a8,a5)),f17(a6,a5))
% 17.16/17.20  [51]~P1(x511)+E(x511,a1)
% 17.16/17.20  [52]~P1(x521)+P3(x521)
% 17.16/17.20  [53]~P1(x531)+P4(x531)
% 17.16/17.20  [55]P1(x551)+~P1(f13(x551))
% 17.16/17.20  [58]P1(x581)+P2(f13(x581),f16(x581))
% 17.16/17.20  [57]~P1(x571)+~P6(x572,x571)
% 17.16/17.20  [59]~P6(x591,x592)+P2(x591,x592)
% 17.16/17.20  [65]~P6(x652,x651)+~P6(x651,x652)
% 17.16/17.20  [60]~P3(x602)+P3(f17(x601,x602))
% 17.16/17.20  [62]~P8(x621,x622)+P2(x621,f16(x622))
% 17.16/17.20  [66]P8(x661,x662)+~P2(x661,f16(x662))
% 17.16/17.20  [54]~P1(x542)+~P1(x541)+E(x541,x542)
% 17.16/17.20  [61]~P2(x612,x611)+P1(x611)+P6(x612,x611)
% 17.16/17.20  [64]~P3(x642)+~P4(x642)+P4(f17(x641,x642))
% 17.16/17.20  [67]~P1(x671)+~P6(x672,x673)+~P2(x673,f16(x671))
% 17.16/17.20  [68]P2(x681,x682)+~P6(x681,x683)+~P2(x683,f16(x682))
% 17.16/17.20  [69]~P3(x693)+~P8(x692,x691)+E(f17(x691,f17(x692,x693)),f17(x692,x693))
% 17.16/17.20  [70]~P3(x703)+~P8(x701,x702)+E(f17(x701,f17(x702,x703)),f17(x701,x703))
% 17.16/17.20  [56]~P1(x561)+~P3(x561)+~P4(x561)+P5(x561)
% 17.16/17.20  %EqnAxiom
% 17.16/17.20  [1]E(x11,x11)
% 17.16/17.20  [2]E(x22,x21)+~E(x21,x22)
% 17.16/17.20  [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 17.16/17.20  [4]~E(x41,x42)+E(f12(x41),f12(x42))
% 17.16/17.20  [5]~E(x51,x52)+E(f9(x51),f9(x52))
% 17.16/17.20  [6]~E(x61,x62)+E(f17(x61,x63),f17(x62,x63))
% 17.16/17.20  [7]~E(x71,x72)+E(f17(x73,x71),f17(x73,x72))
% 17.16/17.20  [8]~E(x81,x82)+E(f16(x81),f16(x82))
% 17.16/17.20  [9]~E(x91,x92)+E(f13(x91),f13(x92))
% 17.16/17.20  [10]~P1(x101)+P1(x102)+~E(x101,x102)
% 17.16/17.20  [11]P8(x112,x113)+~E(x111,x112)+~P8(x111,x113)
% 17.16/17.20  [12]P8(x123,x122)+~E(x121,x122)+~P8(x123,x121)
% 17.16/17.20  [13]~P3(x131)+P3(x132)+~E(x131,x132)
% 17.16/17.20  [14]P2(x142,x143)+~E(x141,x142)+~P2(x141,x143)
% 17.16/17.20  [15]P2(x153,x152)+~E(x151,x152)+~P2(x153,x151)
% 17.16/17.20  [16]P6(x162,x163)+~E(x161,x162)+~P6(x161,x163)
% 17.16/17.20  [17]P6(x173,x172)+~E(x171,x172)+~P6(x173,x171)
% 17.16/17.20  [18]~P4(x181)+P4(x182)+~E(x181,x182)
% 17.16/17.20  [19]~P5(x191)+P5(x192)+~E(x191,x192)
% 17.16/17.20  [20]~P7(x201)+P7(x202)+~E(x201,x202)
% 17.16/17.20  
% 17.16/17.20  %-------------------------------------------
% 17.16/17.20  cnf(2232,plain,
% 17.16/17.20     (~E(f17(a8,f17(a6,a5)),f17(a6,a5))),
% 17.16/17.20     inference(scs_inference,[],[35,44,71,70])).
% 17.16/17.20  cnf(2233,plain,
% 17.16/17.20     ($false),
% 17.16/17.20     inference(scs_inference,[],[44,35,2232,69]),
% 17.16/17.20     ['proof']).
% 17.16/17.20  % SZS output end Proof
% 17.16/17.20  % Total time :16.570000s
%------------------------------------------------------------------------------