%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SET573+3 : TPTP v8.2.0. Released v2.2.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % Computer : n024.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 14:21:47 EDT 2024 % Result : Theorem 0.52s 0.59s % Output : CNFRefutation 0.52s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SET573+3 : TPTP v8.2.0. Released v2.2.0. % 0.00/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.11/0.32 % Computer : n024.cluster.edu % 0.11/0.32 % Model : x86_64 x86_64 % 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.32 % Memory : 8042.1875MB % 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.32 % CPULimit : 300 % 0.11/0.32 % WCLimit : 300 % 0.11/0.32 % DateTime : Sun Jun 23 13:26:38 EDT 2024 % 0.11/0.33 % CPUTime : % 0.18/0.55 start to proof:theBenchmark % 0.52/0.58 %------------------------------------------- % 0.52/0.58 % File :CSE---1.7 % 0.52/0.58 % Problem :theBenchmark % 0.52/0.58 % Transform :cnf % 0.52/0.58 % Format :tptp:raw % 0.52/0.58 % Command :java -jar mcs_scs.jar %d %s % 0.52/0.58 % 0.52/0.58 % Result :Theorem 0.000000s % 0.52/0.58 % Output :CNFRefutation 0.000000s % 0.52/0.58 %------------------------------------------- % 0.52/0.59 %-------------------------------------------------------------------------- % 0.52/0.59 % File : SET573+3 : TPTP v8.2.0. Released v2.2.0. % 0.52/0.59 % Domain : Set Theory % 0.52/0.59 % Problem : Trybulec's 12th Boolean property of sets % 0.52/0.59 % Version : [Try90] axioms : Reduced > Incomplete. % 0.52/0.59 % English : % 0.52/0.59 % 0.52/0.59 % Refs : [ILF] The ILF Group (1998), The ILF System: A Tool for the Int % 0.52/0.59 % : [Try90] Trybulec (1990), Tarski Grothendieck Set Theory % 0.52/0.59 % : [TS89] Trybulec & Swieczkowska (1989), Boolean Properties of % 0.52/0.59 % Source : [ILF] % 0.52/0.59 % Names : BOOLE (12) [TS89] % 0.52/0.59 % 0.52/0.59 % Status : Theorem % 0.52/0.59 % Rating : 0.00 v8.2.0, 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.52/0.59 % Syntax : Number of formulae : 4 ( 0 unt; 0 def) % 0.52/0.59 % Number of atoms : 10 ( 0 equ) % 0.52/0.59 % Maximal formula atoms : 3 ( 2 avg) % 0.52/0.59 % Number of connectives : 8 ( 2 ~; 0 |; 2 &) % 0.52/0.59 % ( 2 <=>; 2 =>; 0 <=; 0 <~>) % 0.52/0.59 % Maximal formula depth : 6 ( 5 avg) % 0.52/0.59 % Maximal term depth : 1 ( 1 avg) % 0.52/0.59 % Number of predicates : 3 ( 3 usr; 0 prp; 2-2 aty) % 0.52/0.59 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 0.52/0.59 % Number of variables : 10 ( 9 !; 1 ?) % 0.52/0.59 % SPC : FOF_THM_RFO_NEQ % 0.52/0.59 % 0.52/0.59 % Comments : % 0.52/0.59 %-------------------------------------------------------------------------- % 0.52/0.59 %---- line(boole - df(5),1833080) % 0.52/0.59 fof(intersect_defn,axiom, % 0.52/0.59 ! [B,C] : % 0.52/0.59 ( intersect(B,C) % 0.52/0.59 <=> ? [D] : % 0.52/0.59 ( member(D,B) % 0.52/0.59 & member(D,C) ) ) ). % 0.52/0.59 % 0.52/0.59 %---- line(boole - axiom6,1833083) % 0.52/0.59 fof(disjoint_defn,axiom, % 0.52/0.59 ! [B,C] : % 0.52/0.59 ( disjoint(B,C) % 0.52/0.59 <=> ~ intersect(B,C) ) ). % 0.52/0.59 % 0.52/0.59 %---- property(symmetry,op(intersect,2,predicate)) % 0.52/0.59 fof(symmetry_of_intersect,axiom, % 0.52/0.59 ! [B,C] : % 0.52/0.59 ( intersect(B,C) % 0.52/0.59 => intersect(C,B) ) ). % 0.52/0.59 % 0.52/0.59 %---- line(boole - th(12),1833109) % 0.52/0.59 fof(prove_th12,conjecture, % 0.52/0.59 ! [B,C,D] : % 0.52/0.59 ( ( member(B,C) % 0.52/0.59 & disjoint(C,D) ) % 0.52/0.59 => ~ member(B,D) ) ). % 0.52/0.59 % 0.52/0.59 %-------------------------------------------------------------------------- % 0.52/0.59 %------------------------------------------- % 0.52/0.59 % Proof found % 0.52/0.59 % SZS status Theorem for theBenchmark % 0.52/0.59 % SZS output start Proof % 0.52/0.59 %ClaNum:9(EqnAxiom:0) % 0.52/0.59 %VarNum:28(SingletonVarNum:13) % 0.52/0.59 %MaxLitNum:3 % 0.52/0.59 %MaxfuncDepth:1 % 0.52/0.59 %SharedTerms:6 % 0.52/0.59 %goalClause: 1 2 3 % 0.52/0.59 %singleGoalClaCount:3 % 0.52/0.59 [1]P1(a1,a3) % 0.52/0.59 [2]P1(a1,a4) % 0.52/0.59 [3]P2(a3,a4) % 0.52/0.59 [4]P2(x41,x42)+P3(x41,x42) % 0.52/0.59 [5]~P3(x52,x51)+P3(x51,x52) % 0.52/0.59 [6]~P2(x61,x62)+~P3(x61,x62) % 0.52/0.59 [8]~P3(x81,x82)+P1(f2(x81,x82),x82) % 0.52/0.59 [9]~P3(x91,x92)+P1(f2(x91,x92),x91) % 0.52/0.59 [7]~P1(x73,x71)+P3(x71,x72)+~P1(x73,x72) % 0.52/0.59 %EqnAxiom % 0.52/0.59 % 0.52/0.59 %------------------------------------------- % 0.52/0.59 cnf(25,plain, % 0.52/0.59 ($false), % 0.52/0.59 inference(scs_inference,[],[3,2,1,6,7]), % 0.52/0.59 ['proof']). % 0.52/0.59 % SZS output end Proof % 0.52/0.59 % Total time :0.000000s %------------------------------------------------------------------------------