TSTP Solution File: SEU121+1 by CSE---1.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE---1.6
% Problem  : SEU121+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d

% Computer : n003.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 : Thu Aug 31 16:17:34 EDT 2023

% Result   : Theorem 0.20s 0.67s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SEU121+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34  % Computer : n003.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Wed Aug 23 21:49:07 EDT 2023
% 0.13/0.35  % CPUTime    : 
% 0.20/0.61  start to proof:theBenchmark
% 0.20/0.66  %-------------------------------------------
% 0.20/0.66  % File        :CSE---1.6
% 0.20/0.66  % Problem     :theBenchmark
% 0.20/0.66  % Transform   :cnf
% 0.20/0.66  % Format      :tptp:raw
% 0.20/0.66  % Command     :java -jar mcs_scs.jar %d %s
% 0.20/0.66  
% 0.20/0.66  % Result      :Theorem 0.000000s
% 0.20/0.66  % Output      :CNFRefutation 0.000000s
% 0.20/0.66  %-------------------------------------------
% 0.20/0.66  %------------------------------------------------------------------------------
% 0.20/0.66  % File     : SEU121+1 : TPTP v8.1.2. Released v3.3.0.
% 0.20/0.66  % Domain   : Set theory
% 0.20/0.66  % Problem  : MPTP bushy problem t1_xboole_1
% 0.20/0.66  % Version  : [Urb07] axioms : Especial.
% 0.20/0.66  % English  :
% 0.20/0.66  
% 0.20/0.66  % Refs     : [Ban01] Bancerek et al. (2001), On the Characterizations of Co
% 0.20/0.66  %          : [Urb07] Urban (2006), Email to G. Sutcliffe
% 0.20/0.66  % Source   : [Urb07]
% 0.20/0.66  % Names    : bushy-t1_xboole_1 [Urb07]
% 0.20/0.66  
% 0.20/0.66  % Status   : Theorem
% 0.20/0.66  % Rating   : 0.06 v8.1.0, 0.03 v7.2.0, 0.00 v6.4.0, 0.04 v6.3.0, 0.08 v6.1.0, 0.03 v6.0.0, 0.04 v5.5.0, 0.00 v5.4.0, 0.04 v5.3.0, 0.07 v5.2.0, 0.00 v4.0.0, 0.04 v3.7.0, 0.00 v3.3.0
% 0.20/0.66  % Syntax   : Number of formulae    :   11 (   5 unt;   0 def)
% 0.20/0.66  %            Number of atoms       :   20 (   2 equ)
% 0.20/0.67  %            Maximal formula atoms :    3 (   1 avg)
% 0.20/0.67  %            Number of connectives :   14 (   5   ~;   0   |;   4   &)
% 0.20/0.67  %                                         (   1 <=>;   4  =>;   0  <=;   0 <~>)
% 0.20/0.67  %            Maximal formula depth :    7 (   4 avg)
% 0.20/0.67  %            Maximal term depth    :    1 (   1 avg)
% 0.20/0.67  %            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
% 0.20/0.67  %            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
% 0.20/0.67  %            Number of variables   :   17 (  15   !;   2   ?)
% 0.20/0.67  % SPC      : FOF_THM_RFO_SEQ
% 0.20/0.67  
% 0.20/0.67  % Comments : Translated by MPTP 0.2 from the original problem in the Mizar
% 0.20/0.67  %            library, www.mizar.org
% 0.20/0.67  %------------------------------------------------------------------------------
% 0.20/0.67  fof(antisymmetry_r2_hidden,axiom,
% 0.20/0.67      ! [A,B] :
% 0.20/0.67        ( in(A,B)
% 0.20/0.67       => ~ in(B,A) ) ).
% 0.20/0.67  
% 0.20/0.67  fof(d3_tarski,axiom,
% 0.20/0.67      ! [A,B] :
% 0.20/0.67        ( subset(A,B)
% 0.20/0.67      <=> ! [C] :
% 0.20/0.67            ( in(C,A)
% 0.20/0.67           => in(C,B) ) ) ).
% 0.20/0.67  
% 0.20/0.67  fof(dt_k1_xboole_0,axiom,
% 0.20/0.67      $true ).
% 0.20/0.67  
% 0.20/0.67  fof(fc1_xboole_0,axiom,
% 0.20/0.67      empty(empty_set) ).
% 0.20/0.67  
% 0.20/0.67  fof(rc1_xboole_0,axiom,
% 0.20/0.67      ? [A] : empty(A) ).
% 0.20/0.67  
% 0.20/0.67  fof(rc2_xboole_0,axiom,
% 0.20/0.67      ? [A] : ~ empty(A) ).
% 0.20/0.67  
% 0.20/0.67  fof(reflexivity_r1_tarski,axiom,
% 0.20/0.67      ! [A,B] : subset(A,A) ).
% 0.20/0.67  
% 0.20/0.67  fof(t1_xboole_1,conjecture,
% 0.20/0.67      ! [A,B,C] :
% 0.20/0.67        ( ( subset(A,B)
% 0.20/0.67          & subset(B,C) )
% 0.20/0.67       => subset(A,C) ) ).
% 0.20/0.67  
% 0.20/0.67  fof(t6_boole,axiom,
% 0.20/0.67      ! [A] :
% 0.20/0.67        ( empty(A)
% 0.20/0.67       => A = empty_set ) ).
% 0.20/0.67  
% 0.20/0.67  fof(t7_boole,axiom,
% 0.20/0.67      ! [A,B] :
% 0.20/0.67        ~ ( in(A,B)
% 0.20/0.67          & empty(B) ) ).
% 0.20/0.67  
% 0.20/0.67  fof(t8_boole,axiom,
% 0.20/0.67      ! [A,B] :
% 0.20/0.67        ~ ( empty(A)
% 0.20/0.67          & A != B
% 0.20/0.67          & empty(B) ) ).
% 0.20/0.67  
% 0.20/0.67  %------------------------------------------------------------------------------
% 0.20/0.67  %-------------------------------------------
% 0.20/0.67  % Proof found
% 0.20/0.67  % SZS status Theorem for theBenchmark
% 0.20/0.67  % SZS output start Proof
% 0.20/0.67  %ClaNum:24(EqnAxiom:10)
% 0.20/0.67  %VarNum:31(SingletonVarNum:15)
% 0.20/0.67  %MaxLitNum:3
% 0.20/0.67  %MaxfuncDepth:1
% 0.20/0.67  %SharedTerms:12
% 0.20/0.67  %goalClause: 13 14 17
% 0.20/0.67  %singleGoalClaCount:3
% 0.20/0.67  [11]P1(a1)
% 0.20/0.67  [12]P1(a2)
% 0.20/0.67  [13]P2(a4,a6)
% 0.20/0.67  [14]P2(a6,a7)
% 0.20/0.67  [16]~P1(a5)
% 0.20/0.67  [17]~P2(a4,a7)
% 0.20/0.67  [15]P2(x151,x151)
% 0.20/0.67  [18]~P1(x181)+E(x181,a1)
% 0.20/0.67  [20]~P1(x201)+~P3(x202,x201)
% 0.20/0.67  [21]~P3(x212,x211)+~P3(x211,x212)
% 0.20/0.67  [22]P2(x221,x222)+P3(f3(x221,x222),x221)
% 0.20/0.67  [24]P2(x241,x242)+~P3(f3(x241,x242),x242)
% 0.20/0.67  [19]~P1(x192)+~P1(x191)+E(x191,x192)
% 0.20/0.67  [23]~P2(x233,x232)+P3(x231,x232)+~P3(x231,x233)
% 0.20/0.67  %EqnAxiom
% 0.20/0.67  [1]E(x11,x11)
% 0.20/0.67  [2]E(x22,x21)+~E(x21,x22)
% 0.20/0.67  [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 0.20/0.67  [4]~E(x41,x42)+E(f3(x41,x43),f3(x42,x43))
% 0.20/0.67  [5]~E(x51,x52)+E(f3(x53,x51),f3(x53,x52))
% 0.20/0.67  [6]~P1(x61)+P1(x62)+~E(x61,x62)
% 0.20/0.67  [7]P3(x72,x73)+~E(x71,x72)+~P3(x71,x73)
% 0.20/0.67  [8]P3(x83,x82)+~E(x81,x82)+~P3(x83,x81)
% 0.20/0.67  [9]P2(x92,x93)+~E(x91,x92)+~P2(x91,x93)
% 0.20/0.67  [10]P2(x103,x102)+~E(x101,x102)+~P2(x103,x101)
% 0.20/0.67  
% 0.20/0.67  %-------------------------------------------
% 0.20/0.67  cnf(33,plain,
% 0.20/0.67     (E(f3(x331,a2),f3(x331,a1))),
% 0.20/0.67     inference(scs_inference,[],[13,15,17,11,12,20,22,10,9,2,18,5])).
% 0.20/0.67  cnf(41,plain,
% 0.20/0.67     (~P2(x411,x412)+P3(x413,x412)+~P3(x413,x411)),
% 0.20/0.67     inference(rename_variables,[],[23])).
% 0.20/0.67  cnf(42,plain,
% 0.20/0.67     (~P3(f3(a4,a7),a4)),
% 0.20/0.67     inference(scs_inference,[],[13,15,14,17,11,12,16,20,22,10,9,2,18,5,4,24,8,7,6,23,41])).
% 0.20/0.67  cnf(48,plain,
% 0.20/0.67     ($false),
% 0.20/0.67     inference(scs_inference,[],[17,33,42,2,22]),
% 0.20/0.67     ['proof']).
% 0.20/0.67  % SZS output end Proof
% 0.20/0.67  % Total time :0.000000s
%------------------------------------------------------------------------------