↑ Up

CSE---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE---1.7
% Problem  : SEU173+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:01:33 EDT 2024

% Result   : Theorem 12.07s 12.16s
% Output   : CNFRefutation 12.07s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SEU173+1 : TPTP v8.2.0. Released v3.3.0.
% 0.12/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 14:24:54 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.56/0.59  start to proof:theBenchmark
% 12.07/12.14  %-------------------------------------------
% 12.07/12.14  % File        :CSE---1.7
% 12.07/12.14  % Problem     :theBenchmark
% 12.07/12.14  % Transform   :cnf
% 12.07/12.15  % Format      :tptp:raw
% 12.07/12.15  % Command     :java -jar mcs_scs.jar %d %s
% 12.07/12.15  
% 12.07/12.15  % Result      :Theorem 11.520000s
% 12.07/12.15  % Output      :CNFRefutation 11.520000s
% 12.07/12.15  %-------------------------------------------
% 12.07/12.15  %------------------------------------------------------------------------------
% 12.07/12.15  % File     : SEU173+1 : TPTP v8.2.0. Released v3.3.0.
% 12.07/12.15  % Domain   : Set theory
% 12.07/12.15  % Problem  : MPTP bushy problem l71_subset_1
% 12.07/12.15  % Version  : [Urb07] axioms : Especial.
% 12.07/12.15  % English  :
% 12.07/12.15  
% 12.07/12.15  % Refs     : [Ban01] Bancerek et al. (2001), On the Characterizations of Co
% 12.07/12.15  %          : [Urb07] Urban (2006), Email to G. Sutcliffe
% 12.07/12.15  % Source   : [Urb07]
% 12.07/12.15  % Names    : bushy-l71_subset_1 [Urb07]
% 12.07/12.15  
% 12.07/12.15  % Status   : Theorem
% 12.07/12.15  % Rating   : 0.25 v8.2.0, 0.22 v7.5.0, 0.25 v7.4.0, 0.17 v7.2.0, 0.14 v7.1.0, 0.13 v7.0.0, 0.07 v6.4.0, 0.12 v6.2.0, 0.20 v6.1.0, 0.27 v6.0.0, 0.26 v5.5.0, 0.22 v5.4.0, 0.25 v5.3.0, 0.26 v5.2.0, 0.05 v5.0.0, 0.25 v4.1.0, 0.26 v4.0.0, 0.29 v3.7.0, 0.25 v3.5.0, 0.26 v3.3.0
% 12.07/12.15  % Syntax   : Number of formulae    :   19 (   9 unt;   0 def)
% 12.07/12.15  %            Number of atoms       :   38 (   3 equ)
% 12.07/12.15  %            Maximal formula atoms :    6 (   2 avg)
% 12.07/12.15  %            Number of connectives :   28 (   9   ~;   0   |;   6   &)
% 12.07/12.15  %                                         (   5 <=>;   8  =>;   0  <=;   0 <~>)
% 12.07/12.15  %            Maximal formula depth :    7 (   4 avg)
% 12.07/12.15  %            Maximal term depth    :    2 (   1 avg)
% 12.07/12.15  %            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
% 12.07/12.15  %            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
% 12.07/12.15  %            Number of variables   :   29 (  24   !;   5   ?)
% 12.07/12.15  % SPC      : FOF_THM_RFO_SEQ
% 12.07/12.15  
% 12.07/12.15  % Comments : Translated by MPTP 0.2 from the original problem in the Mizar
% 12.07/12.15  %            library, www.mizar.org
% 12.07/12.15  %------------------------------------------------------------------------------
% 12.07/12.15  fof(antisymmetry_r2_hidden,axiom,
% 12.07/12.15      ! [A,B] :
% 12.07/12.15        ( in(A,B)
% 12.07/12.15       => ~ in(B,A) ) ).
% 12.07/12.15  
% 12.07/12.15  fof(d1_zfmisc_1,axiom,
% 12.07/12.15      ! [A,B] :
% 12.07/12.15        ( B = powerset(A)
% 12.07/12.15      <=> ! [C] :
% 12.07/12.15            ( in(C,B)
% 12.07/12.15          <=> subset(C,A) ) ) ).
% 12.07/12.15  
% 12.07/12.15  fof(d2_subset_1,axiom,
% 12.07/12.15      ! [A,B] :
% 12.07/12.15        ( ( ~ empty(A)
% 12.07/12.15         => ( element(B,A)
% 12.07/12.15          <=> in(B,A) ) )
% 12.07/12.15        & ( empty(A)
% 12.07/12.15         => ( element(B,A)
% 12.07/12.15          <=> empty(B) ) ) ) ).
% 12.07/12.15  
% 12.07/12.15  fof(d3_tarski,axiom,
% 12.07/12.15      ! [A,B] :
% 12.07/12.15        ( subset(A,B)
% 12.07/12.15      <=> ! [C] :
% 12.07/12.15            ( in(C,A)
% 12.07/12.15           => in(C,B) ) ) ).
% 12.07/12.15  
% 12.07/12.15  fof(dt_k1_xboole_0,axiom,
% 12.07/12.15      $true ).
% 12.07/12.15  
% 12.07/12.15  fof(dt_k1_zfmisc_1,axiom,
% 12.07/12.15      $true ).
% 12.07/12.15  
% 12.07/12.15  fof(dt_m1_subset_1,axiom,
% 12.07/12.15      $true ).
% 12.07/12.15  
% 12.07/12.15  fof(existence_m1_subset_1,axiom,
% 12.07/12.15      ! [A] :
% 12.07/12.15      ? [B] : element(B,A) ).
% 12.07/12.15  
% 12.07/12.15  fof(fc1_subset_1,axiom,
% 12.07/12.15      ! [A] : ~ empty(powerset(A)) ).
% 12.07/12.15  
% 12.07/12.15  fof(fc1_xboole_0,axiom,
% 12.07/12.15      empty(empty_set) ).
% 12.07/12.15  
% 12.07/12.15  fof(l71_subset_1,conjecture,
% 12.07/12.15      ! [A,B] :
% 12.07/12.15        ( ! [C] :
% 12.07/12.15            ( in(C,A)
% 12.07/12.15           => in(C,B) )
% 12.07/12.15       => element(A,powerset(B)) ) ).
% 12.07/12.15  
% 12.07/12.15  fof(rc1_subset_1,axiom,
% 12.07/12.15      ! [A] :
% 12.07/12.15        ( ~ empty(A)
% 12.07/12.15       => ? [B] :
% 12.07/12.15            ( element(B,powerset(A))
% 12.07/12.15            & ~ empty(B) ) ) ).
% 12.07/12.15  
% 12.07/12.15  fof(rc1_xboole_0,axiom,
% 12.07/12.15      ? [A] : empty(A) ).
% 12.07/12.15  
% 12.07/12.15  fof(rc2_subset_1,axiom,
% 12.07/12.15      ! [A] :
% 12.07/12.15      ? [B] :
% 12.07/12.15        ( element(B,powerset(A))
% 12.07/12.15        & empty(B) ) ).
% 12.07/12.15  
% 12.07/12.15  fof(rc2_xboole_0,axiom,
% 12.07/12.15      ? [A] : ~ empty(A) ).
% 12.07/12.15  
% 12.07/12.15  fof(reflexivity_r1_tarski,axiom,
% 12.07/12.15      ! [A,B] : subset(A,A) ).
% 12.07/12.15  
% 12.07/12.15  fof(t6_boole,axiom,
% 12.07/12.15      ! [A] :
% 12.07/12.16        ( empty(A)
% 12.07/12.16       => A = empty_set ) ).
% 12.07/12.16  
% 12.07/12.16  fof(t7_boole,axiom,
% 12.07/12.16      ! [A,B] :
% 12.07/12.16        ~ ( in(A,B)
% 12.07/12.16          & empty(B) ) ).
% 12.07/12.16  
% 12.07/12.16  fof(t8_boole,axiom,
% 12.07/12.16      ! [A,B] :
% 12.07/12.16        ~ ( empty(A)
% 12.07/12.16          & A != B
% 12.07/12.16          & empty(B) ) ).
% 12.07/12.16  
% 12.07/12.16  %------------------------------------------------------------------------------
% 12.07/12.16  %-------------------------------------------
% 12.07/12.16  % Proof found
% 12.07/12.16  % SZS status Theorem for theBenchmark
% 12.07/12.16  % SZS output start Proof
% 12.07/12.16  %ClaNum:45(EqnAxiom:18)
% 12.07/12.16  %VarNum:90(SingletonVarNum:40)
% 12.07/12.16  %MaxLitNum:3
% 12.07/12.16  %MaxfuncDepth:1
% 12.07/12.16  %SharedTerms:10
% 12.07/12.16  %goalClause: 27 34
% 12.07/12.16  %singleGoalClaCount:1
% 12.07/12.16  [19]P1(a1)
% 12.07/12.16  [20]P1(a2)
% 12.07/12.16  [25]~P1(a11)
% 12.07/12.16  [27]~P2(a6,f10(a7))
% 12.07/12.16  [22]P3(x221,x221)
% 12.07/12.16  [21]P1(f9(x211))
% 12.07/12.16  [23]P2(f3(x231),x231)
% 12.07/12.16  [24]P2(f9(x241),f10(x241))
% 12.07/12.16  [26]~P1(f10(x261))
% 12.07/12.16  [28]~P1(x281)+E(x281,a1)
% 12.07/12.16  [34]~P4(x341,a6)+P4(x341,a7)
% 12.07/12.16  [30]P1(x301)+~P1(f8(x301))
% 12.07/12.16  [33]P1(x331)+P2(f8(x331),f10(x331))
% 12.07/12.16  [32]~P1(x321)+~P4(x322,x321)
% 12.07/12.16  [38]~P4(x382,x381)+~P4(x381,x382)
% 12.07/12.16  [41]P3(x411,x412)+P4(f4(x411,x412),x411)
% 12.07/12.16  [43]P3(x431,x432)+~P4(f4(x431,x432),x432)
% 12.07/12.16  [29]~P1(x292)+~P1(x291)+E(x291,x292)
% 12.07/12.16  [31]~P1(x312)+~P1(x311)+P2(x311,x312)
% 12.07/12.16  [35]~P2(x351,x352)+P1(x351)+~P1(x352)
% 12.07/12.16  [36]~P2(x362,x361)+P1(x361)+P4(x362,x361)
% 12.07/12.16  [37]~P4(x372,x371)+P1(x371)+P2(x372,x371)
% 12.07/12.16  [44]P4(f5(x442,x441),x441)+P3(f5(x442,x441),x442)+E(x441,f10(x442))
% 12.07/12.16  [45]~P4(f5(x452,x451),x451)+~P3(f5(x452,x451),x452)+E(x451,f10(x452))
% 12.07/12.16  [42]~P3(x423,x422)+P4(x421,x422)+~P4(x421,x423)
% 12.07/12.16  [39]~P3(x391,x393)+P4(x391,x392)+~E(x392,f10(x393))
% 12.07/12.16  [40]~P4(x401,x403)+P3(x401,x402)+~E(x403,f10(x402))
% 12.07/12.16  %EqnAxiom
% 12.07/12.16  [1]E(x11,x11)
% 12.07/12.16  [2]E(x22,x21)+~E(x21,x22)
% 12.07/12.16  [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 12.07/12.16  [4]~E(x41,x42)+E(f9(x41),f9(x42))
% 12.07/12.16  [5]~E(x51,x52)+E(f3(x51),f3(x52))
% 12.07/12.16  [6]~E(x61,x62)+E(f5(x61,x63),f5(x62,x63))
% 12.07/12.16  [7]~E(x71,x72)+E(f5(x73,x71),f5(x73,x72))
% 12.07/12.16  [8]~E(x81,x82)+E(f10(x81),f10(x82))
% 12.07/12.16  [9]~E(x91,x92)+E(f4(x91,x93),f4(x92,x93))
% 12.07/12.16  [10]~E(x101,x102)+E(f4(x103,x101),f4(x103,x102))
% 12.07/12.16  [11]~E(x111,x112)+E(f8(x111),f8(x112))
% 12.07/12.16  [12]~P1(x121)+P1(x122)+~E(x121,x122)
% 12.07/12.16  [13]P3(x132,x133)+~E(x131,x132)+~P3(x131,x133)
% 12.07/12.16  [14]P3(x143,x142)+~E(x141,x142)+~P3(x143,x141)
% 12.07/12.16  [15]P4(x152,x153)+~E(x151,x152)+~P4(x151,x153)
% 12.07/12.16  [16]P4(x163,x162)+~E(x161,x162)+~P4(x163,x161)
% 12.07/12.16  [17]P2(x172,x173)+~E(x171,x172)+~P2(x171,x173)
% 12.07/12.16  [18]P2(x183,x182)+~E(x181,x182)+~P2(x183,x181)
% 12.07/12.16  
% 12.07/12.16  %-------------------------------------------
% 12.07/12.16  cnf(46,plain,
% 12.07/12.16     (~P3(x461,x462)+P4(x461,f10(x462))),
% 12.07/12.16     inference(equality_inference,[],[39])).
% 12.07/12.16  cnf(48,plain,
% 12.07/12.16     (~P4(x481,a1)),
% 12.07/12.16     inference(scs_inference,[],[19,32])).
% 12.07/12.16  cnf(51,plain,
% 12.07/12.16     (P2(f3(x511),x511)),
% 12.07/12.16     inference(rename_variables,[],[23])).
% 12.07/12.16  cnf(63,plain,
% 12.07/12.16     (~P3(a6,a7)),
% 12.07/12.16     inference(scs_inference,[],[27,23,51,19,25,26,32,36,37,17,35,16,38,46])).
% 12.07/12.16  cnf(76,plain,
% 12.07/12.16     (~P4(x761,a1)),
% 12.07/12.16     inference(rename_variables,[],[48])).
% 12.07/12.16  cnf(84,plain,
% 12.07/12.16     (P2(f9(x841),f10(x841))),
% 12.07/12.16     inference(rename_variables,[],[24])).
% 12.07/12.16  cnf(93,plain,
% 12.07/12.16     (P4(x931,a6)+~E(f3(a6),x931)),
% 12.07/12.16     inference(scs_inference,[],[27,48,76,24,84,20,63,23,26,19,41,32,13,35,17,18,29,36,16,15])).
% 12.07/12.16  cnf(1301,plain,
% 12.07/12.16     (~P4(f4(a6,a7),a6)),
% 12.07/12.16     inference(scs_inference,[],[63,34,43])).
% 12.07/12.16  cnf(1303,plain,
% 12.07/12.16     ($false),
% 12.07/12.16     inference(scs_inference,[],[1301,63,93,41]),
% 12.07/12.16     ['proof']).
% 12.07/12.16  % SZS output end Proof
% 12.07/12.16  % Total time :11.520000s
%------------------------------------------------------------------------------