TSTP Solution File: SEU151+3 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SEU151+3 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% Computer : n010.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:55 EDT 2023
% Result : Theorem 0.95s 1.04s
% Output : CNFRefutation 0.95s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU151+3 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Wed Aug 23 18:52:21 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.58 start to proof:theBenchmark
% 0.95/1.04 %-------------------------------------------
% 0.95/1.04 % File :CSE---1.6
% 0.95/1.04 % Problem :theBenchmark
% 0.95/1.04 % Transform :cnf
% 0.95/1.04 % Format :tptp:raw
% 0.95/1.04 % Command :java -jar mcs_scs.jar %d %s
% 0.95/1.04
% 0.95/1.04 % Result :Theorem 0.400000s
% 0.95/1.04 % Output :CNFRefutation 0.400000s
% 0.95/1.04 %-------------------------------------------
% 0.95/1.04 %------------------------------------------------------------------------------
% 0.95/1.04 % File : SEU151+3 : TPTP v8.1.2. Released v3.2.0.
% 0.95/1.04 % Domain : Set theory
% 0.95/1.04 % Problem : Basic properties of sets, theorem 10
% 0.95/1.04 % Version : [Urb06] axioms : Especial.
% 0.95/1.04 % English :
% 0.95/1.04
% 0.95/1.04 % Refs : [Byl90] Bylinski (1990), Some Basic Properties of Sets
% 0.95/1.04 % : [Urb06] Urban (2006), Email to G. Sutcliffe
% 0.95/1.04 % Source : [Urb06]
% 0.95/1.04 % Names : zfmisc_1__t10_zfmisc_1 [Urb06]
% 0.95/1.04
% 0.95/1.04 % Status : Theorem
% 0.95/1.04 % Rating : 0.19 v7.5.0, 0.22 v7.4.0, 0.13 v7.3.0, 0.14 v7.2.0, 0.10 v7.1.0, 0.13 v7.0.0, 0.07 v6.4.0, 0.12 v6.3.0, 0.17 v6.2.0, 0.32 v6.1.0, 0.33 v6.0.0, 0.26 v5.5.0, 0.19 v5.4.0, 0.18 v5.3.0, 0.15 v5.2.0, 0.05 v5.0.0, 0.21 v4.1.0, 0.17 v4.0.1, 0.22 v4.0.0, 0.21 v3.7.0, 0.15 v3.5.0, 0.16 v3.3.0, 0.14 v3.2.0
% 0.95/1.04 % Syntax : Number of formulae : 6 ( 3 unt; 0 def)
% 0.95/1.04 % Number of atoms : 12 ( 7 equ)
% 0.95/1.04 % Maximal formula atoms : 4 ( 2 avg)
% 0.95/1.04 % Number of connectives : 11 ( 5 ~; 1 |; 2 &)
% 0.95/1.04 % ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% 0.95/1.04 % Maximal formula depth : 9 ( 5 avg)
% 0.95/1.04 % Maximal term depth : 2 ( 1 avg)
% 0.95/1.04 % Number of predicates : 3 ( 2 usr; 0 prp; 1-2 aty)
% 0.95/1.04 % Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% 0.95/1.04 % Number of variables : 14 ( 12 !; 2 ?)
% 0.95/1.04 % SPC : FOF_THM_RFO_SEQ
% 0.95/1.04
% 0.95/1.04 % Comments : Translated by MPTP 0.2 from the original problem in the Mizar
% 0.95/1.04 % library, www.mizar.org
% 0.95/1.04 %------------------------------------------------------------------------------
% 0.95/1.04 fof(antisymmetry_r2_hidden,axiom,
% 0.95/1.04 ! [A,B] :
% 0.95/1.04 ( in(A,B)
% 0.95/1.04 => ~ in(B,A) ) ).
% 0.95/1.04
% 0.95/1.04 fof(commutativity_k2_tarski,axiom,
% 0.95/1.04 ! [A,B] : unordered_pair(A,B) = unordered_pair(B,A) ).
% 0.95/1.04
% 0.95/1.04 fof(d2_tarski,axiom,
% 0.95/1.04 ! [A,B,C] :
% 0.95/1.04 ( C = unordered_pair(A,B)
% 0.95/1.04 <=> ! [D] :
% 0.95/1.04 ( in(D,C)
% 0.95/1.04 <=> ( D = A
% 0.95/1.04 | D = B ) ) ) ).
% 0.95/1.04
% 0.95/1.04 fof(rc1_xboole_0,axiom,
% 0.95/1.04 ? [A] : empty(A) ).
% 0.95/1.04
% 0.95/1.04 fof(rc2_xboole_0,axiom,
% 0.95/1.04 ? [A] : ~ empty(A) ).
% 0.95/1.04
% 0.95/1.04 fof(t10_zfmisc_1,conjecture,
% 0.95/1.04 ! [A,B,C,D] :
% 0.95/1.04 ~ ( unordered_pair(A,B) = unordered_pair(C,D)
% 0.95/1.04 & A != C
% 0.95/1.04 & A != D ) ).
% 0.95/1.04
% 0.95/1.04 %------------------------------------------------------------------------------
% 0.95/1.04 %-------------------------------------------
% 0.95/1.04 % Proof found
% 0.95/1.04 % SZS status Theorem for theBenchmark
% 0.95/1.04 % SZS output start Proof
% 0.95/1.04 %ClaNum:24(EqnAxiom:11)
% 0.95/1.04 %VarNum:68(SingletonVarNum:25)
% 0.95/1.04 %MaxLitNum:4
% 0.95/1.04 %MaxfuncDepth:1
% 0.95/1.04 %SharedTerms:13
% 0.95/1.04 %goalClause: 13 15 16
% 0.95/1.04 %singleGoalClaCount:3
% 0.95/1.04 [12]P1(a1)
% 0.95/1.04 [15]~E(a3,a7)
% 0.95/1.04 [16]~E(a3,a8)
% 0.95/1.04 [17]~P1(a4)
% 0.95/1.04 [13]E(f6(a3,a5),f6(a7,a8))
% 0.95/1.04 [14]E(f6(x141,x142),f6(x142,x141))
% 0.95/1.04 [20]~P2(x202,x201)+~P2(x201,x202)
% 0.95/1.04 [23]~E(f2(x232,x233,x231),x233)+~P2(f2(x232,x233,x231),x231)+E(x231,f6(x232,x233))
% 0.95/1.04 [24]~E(f2(x242,x243,x241),x242)+~P2(f2(x242,x243,x241),x241)+E(x241,f6(x242,x243))
% 0.95/1.04 [18]P2(x181,x182)+~E(x181,x183)+~E(x182,f6(x184,x183))
% 0.95/1.04 [19]P2(x191,x192)+~E(x191,x193)+~E(x192,f6(x193,x194))
% 0.95/1.05 [22]E(f2(x222,x223,x221),x223)+E(f2(x222,x223,x221),x222)+P2(f2(x222,x223,x221),x221)+E(x221,f6(x222,x223))
% 0.95/1.05 [21]~P2(x211,x214)+E(x211,x212)+E(x211,x213)+~E(x214,f6(x213,x212))
% 0.95/1.05 %EqnAxiom
% 0.95/1.05 [1]E(x11,x11)
% 0.95/1.05 [2]E(x22,x21)+~E(x21,x22)
% 0.95/1.05 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 0.95/1.05 [4]~E(x41,x42)+E(f6(x41,x43),f6(x42,x43))
% 0.95/1.05 [5]~E(x51,x52)+E(f6(x53,x51),f6(x53,x52))
% 0.95/1.05 [6]~E(x61,x62)+E(f2(x61,x63,x64),f2(x62,x63,x64))
% 0.95/1.05 [7]~E(x71,x72)+E(f2(x73,x71,x74),f2(x73,x72,x74))
% 0.95/1.05 [8]~E(x81,x82)+E(f2(x83,x84,x81),f2(x83,x84,x82))
% 0.95/1.05 [9]~P1(x91)+P1(x92)+~E(x91,x92)
% 0.95/1.05 [10]P2(x102,x103)+~E(x101,x102)+~P2(x101,x103)
% 0.95/1.05 [11]P2(x113,x112)+~E(x111,x112)+~P2(x113,x111)
% 0.95/1.05
% 0.95/1.05 %-------------------------------------------
% 0.95/1.05 cnf(25,plain,
% 0.95/1.05 (E(f6(a7,a8),f6(a3,a5))),
% 0.95/1.05 inference(scs_inference,[],[13,2])).
% 0.95/1.05 cnf(27,plain,
% 0.95/1.05 (E(f6(x271,x272),f6(x272,x271))),
% 0.95/1.05 inference(rename_variables,[],[14])).
% 0.95/1.05 cnf(28,plain,
% 0.95/1.05 (P2(f6(a3,a5),f6(x281,f6(a7,a8)))),
% 0.95/1.05 inference(scs_inference,[],[13,14,27,2,3,19])).
% 0.95/1.05 cnf(29,plain,
% 0.95/1.05 (E(f6(x291,x292),f6(x292,x291))),
% 0.95/1.05 inference(rename_variables,[],[14])).
% 0.95/1.05 cnf(31,plain,
% 0.95/1.05 (P2(f6(a3,a5),f6(f6(a7,a8),x311))),
% 0.95/1.05 inference(scs_inference,[],[13,14,27,29,2,3,19,18])).
% 0.95/1.05 cnf(32,plain,
% 0.95/1.05 (E(f6(x321,x322),f6(x322,x321))),
% 0.95/1.05 inference(rename_variables,[],[14])).
% 0.95/1.05 cnf(34,plain,
% 0.95/1.05 (~P2(a3,f6(a3,a5))),
% 0.95/1.05 inference(scs_inference,[],[13,15,16,14,27,29,2,3,19,18,21])).
% 0.95/1.05 cnf(38,plain,
% 0.95/1.05 (~P2(a3,f6(a5,a3))),
% 0.95/1.05 inference(scs_inference,[],[13,15,16,14,27,29,32,2,3,19,18,21,20,11])).
% 0.95/1.05 cnf(47,plain,
% 0.95/1.05 (E(f6(x471,x472),f6(x472,x471))),
% 0.95/1.05 inference(rename_variables,[],[14])).
% 0.95/1.05 cnf(53,plain,
% 0.95/1.05 (~P2(a3,f6(a7,a8))),
% 0.95/1.05 inference(scs_inference,[],[13,15,14,47,34,28,31,25,38,20,10,19,18,2,11])).
% 0.95/1.05 cnf(337,plain,
% 0.95/1.05 ($false),
% 0.95/1.05 inference(scs_inference,[],[53,25,19]),
% 0.95/1.05 ['proof']).
% 0.95/1.05 % SZS output end Proof
% 0.95/1.05 % Total time :0.400000s
%------------------------------------------------------------------------------