↑ Up

CSE---1.7.THM-CRf.s

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

% Result   : Theorem 0.66s 0.72s
% Output   : CNFRefutation 0.66s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SEU120+1 : TPTP v8.2.0. Released v3.3.0.
% 0.11/0.12  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.33  % Computer : n021.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Fri Jun 21 15:42:24 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.20/0.57  start to proof:theBenchmark
% 0.66/0.72  %-------------------------------------------
% 0.66/0.72  % File        :CSE---1.7
% 0.66/0.72  % Problem     :theBenchmark
% 0.66/0.72  % Transform   :cnf
% 0.66/0.72  % Format      :tptp:raw
% 0.66/0.72  % Command     :java -jar mcs_scs.jar %d %s
% 0.66/0.72  
% 0.66/0.72  % Result      :Theorem 0.100000s
% 0.66/0.72  % Output      :CNFRefutation 0.100000s
% 0.66/0.72  %-------------------------------------------
% 0.66/0.72  %------------------------------------------------------------------------------
% 0.66/0.72  % File     : SEU120+1 : TPTP v8.2.0. Released v3.3.0.
% 0.66/0.72  % Domain   : Set theory
% 0.66/0.72  % Problem  : MPTP bushy problem t4_xboole_0
% 0.66/0.72  % Version  : [Urb07] axioms : Especial.
% 0.66/0.72  % English  :
% 0.66/0.72  
% 0.66/0.72  % Refs     : [Ban01] Bancerek et al. (2001), On the Characterizations of Co
% 0.66/0.72  %          : [Urb07] Urban (2006), Email to G. Sutcliffe
% 0.66/0.72  % Source   : [Urb07]
% 0.66/0.72  % Names    : bushy-t4_xboole_0 [Urb07]
% 0.66/0.72  
% 0.66/0.72  % Status   : Theorem
% 0.66/0.72  % Rating   : 0.03 v7.2.0, 0.00 v6.4.0, 0.04 v6.3.0, 0.08 v6.1.0, 0.10 v6.0.0, 0.13 v5.5.0, 0.11 v5.4.0, 0.21 v5.3.0, 0.26 v5.2.0, 0.05 v5.0.0, 0.08 v4.1.0, 0.09 v4.0.1, 0.13 v4.0.0, 0.17 v3.7.0, 0.10 v3.5.0, 0.11 v3.4.0, 0.05 v3.3.0
% 0.66/0.72  % Syntax   : Number of formulae    :   12 (   7 unt;   0 def)
% 0.66/0.72  %            Number of atoms       :   19 (   4 equ)
% 0.66/0.72  %            Maximal formula atoms :    4 (   1 avg)
% 0.66/0.72  %            Number of connectives :   14 (   7   ~;   0   |;   3   &)
% 0.66/0.72  %                                         (   2 <=>;   2  =>;   0  <=;   0 <~>)
% 0.66/0.72  %            Maximal formula depth :    8 (   3 avg)
% 0.66/0.72  %            Maximal term depth    :    2 (   1 avg)
% 0.66/0.72  %            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
% 0.66/0.72  %            Number of functors    :    2 (   2 usr;   1 con; 0-2 aty)
% 0.66/0.72  %            Number of variables   :   18 (  15   !;   3   ?)
% 0.66/0.72  % SPC      : FOF_THM_RFO_SEQ
% 0.66/0.72  
% 0.66/0.72  % Comments : Translated by MPTP 0.2 from the original problem in the Mizar
% 0.66/0.72  %            library, www.mizar.org
% 0.66/0.72  %------------------------------------------------------------------------------
% 0.66/0.72  fof(antisymmetry_r2_hidden,axiom,
% 0.66/0.72      ! [A,B] :
% 0.66/0.72        ( in(A,B)
% 0.66/0.72       => ~ in(B,A) ) ).
% 0.66/0.72  
% 0.66/0.72  fof(commutativity_k3_xboole_0,axiom,
% 0.66/0.72      ! [A,B] : set_intersection2(A,B) = set_intersection2(B,A) ).
% 0.66/0.72  
% 0.66/0.72  fof(d1_xboole_0,axiom,
% 0.66/0.72      ! [A] :
% 0.66/0.72        ( A = empty_set
% 0.66/0.72      <=> ! [B] : ~ in(B,A) ) ).
% 0.66/0.72  
% 0.66/0.72  fof(d7_xboole_0,axiom,
% 0.66/0.72      ! [A,B] :
% 0.66/0.72        ( disjoint(A,B)
% 0.66/0.72      <=> set_intersection2(A,B) = empty_set ) ).
% 0.66/0.72  
% 0.66/0.72  fof(dt_k1_xboole_0,axiom,
% 0.66/0.72      $true ).
% 0.66/0.72  
% 0.66/0.72  fof(dt_k3_xboole_0,axiom,
% 0.66/0.72      $true ).
% 0.66/0.72  
% 0.66/0.72  fof(fc1_xboole_0,axiom,
% 0.66/0.72      empty(empty_set) ).
% 0.66/0.72  
% 0.66/0.72  fof(idempotence_k3_xboole_0,axiom,
% 0.66/0.72      ! [A,B] : set_intersection2(A,A) = A ).
% 0.66/0.72  
% 0.66/0.72  fof(rc1_xboole_0,axiom,
% 0.66/0.72      ? [A] : empty(A) ).
% 0.66/0.72  
% 0.66/0.72  fof(rc2_xboole_0,axiom,
% 0.66/0.72      ? [A] : ~ empty(A) ).
% 0.66/0.72  
% 0.66/0.72  fof(symmetry_r1_xboole_0,axiom,
% 0.66/0.72      ! [A,B] :
% 0.66/0.72        ( disjoint(A,B)
% 0.66/0.72       => disjoint(B,A) ) ).
% 0.66/0.72  
% 0.66/0.72  fof(t4_xboole_0,conjecture,
% 0.66/0.72      ! [A,B] :
% 0.66/0.72        ( ~ ( ~ disjoint(A,B)
% 0.66/0.72            & ! [C] : ~ in(C,set_intersection2(A,B)) )
% 0.66/0.72        & ~ ( ? [C] : in(C,set_intersection2(A,B))
% 0.66/0.72            & disjoint(A,B) ) ) ).
% 0.66/0.72  
% 0.66/0.72  %------------------------------------------------------------------------------
% 0.66/0.72  %-------------------------------------------
% 0.66/0.72  % Proof found
% 0.66/0.72  % SZS status Theorem for theBenchmark
% 0.66/0.72  % SZS output start Proof
% 0.66/0.72  %ClaNum:26(EqnAxiom:11)
% 0.66/0.72  %VarNum:31(SingletonVarNum:16)
% 0.66/0.72  %MaxLitNum:2
% 0.66/0.72  %MaxfuncDepth:1
% 0.66/0.72  %SharedTerms:16
% 0.66/0.72  %goalClause: 19 24 25 26
% 0.66/0.73  [12]P1(a1)
% 0.66/0.73  [13]P1(a2)
% 0.66/0.73  [16]~P1(a5)
% 0.66/0.73  [14]E(f4(x141,x141),x141)
% 0.66/0.73  [15]E(f4(x151,x152),f4(x152,x151))
% 0.66/0.73  [19]P2(a6,a9)+~P2(a7,a8)
% 0.66/0.73  [24]~P2(a7,a8)+P3(a10,f4(a6,a9))
% 0.66/0.73  [17]P3(f3(x171),x171)+E(x171,a1)
% 0.66/0.73  [25]P2(a6,a9)+~P3(x251,f4(a7,a8))
% 0.66/0.73  [26]~P3(x261,f4(a7,a8))+P3(a10,f4(a6,a9))
% 0.66/0.73  [18]~P3(x182,x181)+~E(x181,a1)
% 0.66/0.73  [22]~P2(x222,x221)+P2(x221,x222)
% 0.66/0.73  [23]~P3(x232,x231)+~P3(x231,x232)
% 0.66/0.73  [20]~P2(x201,x202)+E(f4(x201,x202),a1)
% 0.66/0.73  [21]P2(x211,x212)+~E(f4(x211,x212),a1)
% 0.66/0.73  %EqnAxiom
% 0.66/0.73  [1]E(x11,x11)
% 0.66/0.73  [2]E(x22,x21)+~E(x21,x22)
% 0.66/0.73  [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 0.66/0.73  [4]~E(x41,x42)+E(f4(x41,x43),f4(x42,x43))
% 0.66/0.73  [5]~E(x51,x52)+E(f4(x53,x51),f4(x53,x52))
% 0.66/0.73  [6]~E(x61,x62)+E(f3(x61),f3(x62))
% 0.66/0.73  [7]~P1(x71)+P1(x72)+~E(x71,x72)
% 0.66/0.73  [8]P3(x82,x83)+~E(x81,x82)+~P3(x81,x83)
% 0.66/0.73  [9]P3(x93,x92)+~E(x91,x92)+~P3(x93,x91)
% 0.66/0.73  [10]P2(x102,x103)+~E(x101,x102)+~P2(x101,x103)
% 0.66/0.73  [11]P2(x113,x112)+~E(x111,x112)+~P2(x113,x111)
% 0.66/0.73  
% 0.66/0.73  %-------------------------------------------
% 0.66/0.73  cnf(29,plain,
% 0.66/0.73     (E(f4(x291,x291),x291)),
% 0.66/0.73     inference(rename_variables,[],[14])).
% 0.66/0.73  cnf(32,plain,
% 0.66/0.73     (E(f4(x321,x321),x321)),
% 0.66/0.73     inference(rename_variables,[],[14])).
% 0.66/0.73  cnf(34,plain,
% 0.66/0.73     (E(x341,f4(x341,x341))),
% 0.66/0.73     inference(scs_inference,[],[14,29,32,18,21,2])).
% 0.66/0.73  cnf(35,plain,
% 0.66/0.73     (P2(f4(a1,a1),a1)),
% 0.66/0.73     inference(scs_inference,[],[14,29,32,18,21,2,10])).
% 0.66/0.73  cnf(38,plain,
% 0.66/0.73     (E(f4(x381,x382),f4(f4(x382,x381),f4(x382,x381)))),
% 0.66/0.73     inference(scs_inference,[],[34,15,3])).
% 0.66/0.73  cnf(46,plain,
% 0.66/0.73     (E(x461,f4(f4(x461,x461),f4(x461,x461)))),
% 0.66/0.73     inference(scs_inference,[],[34,38,2,3])).
% 0.66/0.73  cnf(55,plain,
% 0.66/0.73     (~P3(x551,f4(f4(a1,a1),f4(a1,a1)))),
% 0.66/0.73     inference(scs_inference,[],[35,34,46,2,10,18])).
% 0.66/0.73  cnf(57,plain,
% 0.66/0.73     (~P2(a7,a8)+E(f4(a6,a9),a1)),
% 0.66/0.73     inference(scs_inference,[],[19,20])).
% 0.66/0.73  cnf(63,plain,
% 0.66/0.73     (~P3(x631,f3(x631))+E(x631,a1)),
% 0.66/0.73     inference(scs_inference,[],[23,17])).
% 0.66/0.73  cnf(66,plain,
% 0.66/0.73     (~E(f4(a7,a8),a1)+P3(a10,f4(a6,a9))),
% 0.66/0.73     inference(scs_inference,[],[24,21])).
% 0.66/0.73  cnf(67,plain,
% 0.66/0.73     (P2(a9,a6)+~P3(x671,f4(a7,a8))),
% 0.66/0.73     inference(scs_inference,[],[25,22])).
% 0.66/0.73  cnf(68,plain,
% 0.66/0.73     (E(f4(a6,a9),a1)+~E(f4(a7,a8),a1)),
% 0.66/0.73     inference(scs_inference,[],[57,21])).
% 0.66/0.73  cnf(69,plain,
% 0.66/0.73     (E(f4(a7,a8),a1)+P2(a9,a6)),
% 0.66/0.73     inference(scs_inference,[],[67,17])).
% 0.66/0.73  cnf(73,plain,
% 0.66/0.73     (E(f4(a7,a8),a1)+P3(a10,f4(a6,a9))),
% 0.66/0.73     inference(scs_inference,[],[26,17])).
% 0.66/0.73  cnf(74,plain,
% 0.66/0.73     (P3(a10,f4(a6,a9))),
% 0.66/0.73     inference(scs_inference,[],[66,73])).
% 0.66/0.73  cnf(77,plain,
% 0.66/0.73     (P3(f4(a10,a10),f4(a6,a9))),
% 0.66/0.73     inference(scs_inference,[],[74,34,23,8])).
% 0.66/0.73  cnf(79,plain,
% 0.66/0.73     (~E(f4(a6,a9),f4(f4(a1,a1),f4(a1,a1)))),
% 0.66/0.73     inference(scs_inference,[],[74,55,34,23,8,9])).
% 0.66/0.73  cnf(93,plain,
% 0.66/0.73     (~P2(a6,a9)),
% 0.66/0.73     inference(scs_inference,[],[38,79,77,46,23,8,3,57,17,20])).
% 0.66/0.73  cnf(97,plain,
% 0.66/0.73     (~E(f4(a7,a8),a1)),
% 0.66/0.73     inference(scs_inference,[],[38,79,77,46,23,8,3,57,17,20,63,68])).
% 0.66/0.73  cnf(102,plain,
% 0.66/0.73     (P2(a9,a6)),
% 0.66/0.73     inference(scs_inference,[],[97,69])).
% 0.66/0.73  cnf(104,plain,
% 0.66/0.73     ($false),
% 0.66/0.73     inference(scs_inference,[],[102,93,22]),
% 0.66/0.73     ['proof']).
% 0.66/0.73  % SZS output end Proof
% 0.66/0.73  % Total time :0.100000s
%------------------------------------------------------------------------------