TSTP Solution File: SET573+3 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SET573+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% Computer : n012.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 14:30:10 EDT 2023
% Result : Theorem 0.18s 0.60s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET573+3 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.12/0.33 % Computer : n012.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 : Sat Aug 26 10:53:10 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.55 start to proof:theBenchmark
% 0.18/0.59 %-------------------------------------------
% 0.18/0.59 % File :CSE---1.6
% 0.18/0.59 % Problem :theBenchmark
% 0.18/0.59 % Transform :cnf
% 0.18/0.59 % Format :tptp:raw
% 0.18/0.59 % Command :java -jar mcs_scs.jar %d %s
% 0.18/0.59
% 0.18/0.59 % Result :Theorem 0.000000s
% 0.18/0.59 % Output :CNFRefutation 0.000000s
% 0.18/0.59 %-------------------------------------------
% 0.18/0.60 %--------------------------------------------------------------------------
% 0.18/0.60 % File : SET573+3 : TPTP v8.1.2. Released v2.2.0.
% 0.18/0.60 % Domain : Set Theory
% 0.18/0.60 % Problem : Trybulec's 12th Boolean property of sets
% 0.18/0.60 % Version : [Try90] axioms : Reduced > Incomplete.
% 0.18/0.60 % English :
% 0.18/0.60
% 0.18/0.60 % Refs : [ILF] The ILF Group (1998), The ILF System: A Tool for the Int
% 0.18/0.60 % : [Try90] Trybulec (1990), Tarski Grothendieck Set Theory
% 0.18/0.60 % : [TS89] Trybulec & Swieczkowska (1989), Boolean Properties of
% 0.18/0.60 % Source : [ILF]
% 0.18/0.60 % Names : BOOLE (12) [TS89]
% 0.18/0.60
% 0.18/0.60 % Status : Theorem
% 0.18/0.60 % Rating : 0.07 v7.5.0, 0.05 v7.4.0, 0.00 v6.1.0, 0.04 v6.0.0, 0.25 v5.5.0, 0.08 v5.4.0, 0.09 v5.3.0, 0.17 v5.2.0, 0.07 v5.0.0, 0.05 v4.1.0, 0.06 v4.0.1, 0.05 v3.7.0, 0.33 v3.5.0, 0.12 v3.4.0, 0.08 v3.3.0, 0.00 v3.2.0, 0.11 v3.1.0, 0.00 v2.5.0, 0.33 v2.4.0, 0.33 v2.2.1
% 0.18/0.60 % Syntax : Number of formulae : 4 ( 0 unt; 0 def)
% 0.18/0.60 % Number of atoms : 10 ( 0 equ)
% 0.18/0.60 % Maximal formula atoms : 3 ( 2 avg)
% 0.18/0.60 % Number of connectives : 8 ( 2 ~; 0 |; 2 &)
% 0.18/0.60 % ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% 0.18/0.60 % Maximal formula depth : 6 ( 5 avg)
% 0.18/0.60 % Maximal term depth : 1 ( 1 avg)
% 0.18/0.60 % Number of predicates : 3 ( 3 usr; 0 prp; 2-2 aty)
% 0.18/0.60 % Number of functors : 0 ( 0 usr; 0 con; --- aty)
% 0.18/0.60 % Number of variables : 10 ( 9 !; 1 ?)
% 0.18/0.60 % SPC : FOF_THM_RFO_NEQ
% 0.18/0.60
% 0.18/0.60 % Comments :
% 0.18/0.60 %--------------------------------------------------------------------------
% 0.18/0.60 %---- line(boole - df(5),1833080)
% 0.18/0.60 fof(intersect_defn,axiom,
% 0.18/0.60 ! [B,C] :
% 0.18/0.60 ( intersect(B,C)
% 0.18/0.60 <=> ? [D] :
% 0.18/0.60 ( member(D,B)
% 0.18/0.60 & member(D,C) ) ) ).
% 0.18/0.60
% 0.18/0.60 %---- line(boole - axiom6,1833083)
% 0.18/0.60 fof(disjoint_defn,axiom,
% 0.18/0.60 ! [B,C] :
% 0.18/0.60 ( disjoint(B,C)
% 0.18/0.60 <=> ~ intersect(B,C) ) ).
% 0.18/0.60
% 0.18/0.60 %---- property(symmetry,op(intersect,2,predicate))
% 0.18/0.60 fof(symmetry_of_intersect,axiom,
% 0.18/0.60 ! [B,C] :
% 0.18/0.60 ( intersect(B,C)
% 0.18/0.60 => intersect(C,B) ) ).
% 0.18/0.60
% 0.18/0.60 %---- line(boole - th(12),1833109)
% 0.18/0.60 fof(prove_th12,conjecture,
% 0.18/0.60 ! [B,C,D] :
% 0.18/0.60 ( ( member(B,C)
% 0.18/0.60 & disjoint(C,D) )
% 0.18/0.60 => ~ member(B,D) ) ).
% 0.18/0.60
% 0.18/0.60 %--------------------------------------------------------------------------
% 0.18/0.60 %-------------------------------------------
% 0.18/0.60 % Proof found
% 0.18/0.60 % SZS status Theorem for theBenchmark
% 0.18/0.60 % SZS output start Proof
% 0.18/0.60 %ClaNum:9(EqnAxiom:0)
% 0.18/0.60 %VarNum:28(SingletonVarNum:13)
% 0.18/0.60 %MaxLitNum:3
% 0.18/0.60 %MaxfuncDepth:1
% 0.18/0.60 %SharedTerms:6
% 0.18/0.60 %goalClause: 1 2 3
% 0.18/0.60 %singleGoalClaCount:3
% 0.18/0.60 [1]P1(a1,a3)
% 0.18/0.60 [2]P1(a1,a4)
% 0.18/0.60 [3]P2(a3,a4)
% 0.18/0.60 [4]P2(x41,x42)+P3(x41,x42)
% 0.18/0.60 [5]~P3(x52,x51)+P3(x51,x52)
% 0.18/0.60 [6]~P2(x61,x62)+~P3(x61,x62)
% 0.18/0.60 [8]~P3(x81,x82)+P1(f2(x81,x82),x82)
% 0.18/0.60 [9]~P3(x91,x92)+P1(f2(x91,x92),x91)
% 0.18/0.60 [7]~P1(x73,x71)+P3(x71,x72)+~P1(x73,x72)
% 0.18/0.60 %EqnAxiom
% 0.18/0.60
% 0.18/0.60 %-------------------------------------------
% 0.18/0.60 cnf(10,plain,
% 0.18/0.60 (P3(a3,a3)),
% 0.18/0.60 inference(scs_inference,[],[1,7])).
% 0.18/0.60 cnf(11,plain,
% 0.18/0.60 (~P3(a3,a4)),
% 0.18/0.60 inference(scs_inference,[],[1,3,7,6])).
% 0.18/0.60 cnf(20,plain,
% 0.18/0.60 ($false),
% 0.18/0.60 inference(scs_inference,[],[1,2,10,11,6,7]),
% 0.18/0.60 ['proof']).
% 0.18/0.60 % SZS output end Proof
% 0.18/0.60 % Total time :0.000000s
%------------------------------------------------------------------------------