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

View Problem - Process Solution

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

% 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 : Thu Aug 31 16:17:41 EDT 2023

% Result   : Theorem 11.98s 12.05s
% Output   : CNFRefutation 11.98s
% Verified : 
% SZS Type : -

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