%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SET576+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 : n019.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:48 EDT 2024 % Result : Theorem 0.53s 0.60s % Output : CNFRefutation 0.54s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.01/0.12 % Problem : SET576+3 : TPTP v8.2.0. Released v2.2.0. % 0.01/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n019.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 : Sun Jun 23 14:31:24 EDT 2024 % 0.12/0.33 % CPUTime : % 0.19/0.56 start to proof:theBenchmark % 0.53/0.59 %------------------------------------------- % 0.53/0.59 % File :CSE---1.7 % 0.53/0.59 % Problem :theBenchmark % 0.53/0.59 % Transform :cnf % 0.53/0.59 % Format :tptp:raw % 0.53/0.59 % Command :java -jar mcs_scs.jar %d %s % 0.53/0.59 % 0.53/0.59 % Result :Theorem 0.000000s % 0.53/0.59 % Output :CNFRefutation 0.000000s % 0.53/0.59 %------------------------------------------- % 0.53/0.60 %-------------------------------------------------------------------------- % 0.53/0.60 % File : SET576+3 : TPTP v8.2.0. Released v2.2.0. % 0.53/0.60 % Domain : Set Theory % 0.53/0.60 % Problem : Trybulec's 17th Boolean property of sets % 0.53/0.60 % Version : [Try90] axioms : Reduced > Incomplete. % 0.53/0.60 % English : % 0.53/0.60 % 0.53/0.60 % Refs : [ILF] The ILF Group (1998), The ILF System: A Tool for the Int % 0.53/0.60 % : [Try90] Trybulec (1990), Tarski Grothendieck Set Theory % 0.53/0.60 % : [TS89] Trybulec & Swieczkowska (1989), Boolean Properties of % 0.53/0.60 % Source : [ILF] % 0.53/0.60 % Names : BOOLE (17) [TS89] % 0.53/0.60 % 0.53/0.60 % Status : Theorem % 0.53/0.60 % Rating : 0.00 v6.3.0, 0.08 v6.2.0, 0.00 v6.0.0, 0.25 v5.5.0, 0.00 v5.3.0, 0.09 v5.2.0, 0.00 v3.2.0, 0.11 v3.1.0, 0.00 v2.2.1 % 0.53/0.60 % Syntax : Number of formulae : 4 ( 0 unt; 0 def) % 0.53/0.60 % Number of atoms : 10 ( 0 equ) % 0.53/0.60 % Maximal formula atoms : 3 ( 2 avg) % 0.53/0.60 % Number of connectives : 8 ( 2 ~; 0 |; 1 &) % 0.53/0.60 % ( 2 <=>; 3 =>; 0 <=; 0 <~>) % 0.53/0.60 % Maximal formula depth : 7 ( 6 avg) % 0.53/0.60 % Maximal term depth : 1 ( 1 avg) % 0.53/0.60 % Number of predicates : 3 ( 3 usr; 0 prp; 2-2 aty) % 0.53/0.60 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 0.53/0.60 % Number of variables : 10 ( 9 !; 1 ?) % 0.53/0.60 % SPC : FOF_THM_RFO_NEQ % 0.53/0.60 % 0.53/0.60 % Comments : % 0.53/0.60 %-------------------------------------------------------------------------- % 0.53/0.60 %---- line(boole - df(5),1833080) % 0.53/0.60 fof(intersect_defn,axiom, % 0.53/0.60 ! [B,C] : % 0.53/0.60 ( intersect(B,C) % 0.53/0.60 <=> ? [D] : % 0.53/0.60 ( member(D,B) % 0.53/0.60 & member(D,C) ) ) ). % 0.53/0.60 % 0.53/0.60 %---- line(boole - axiom10,1833083) % 0.53/0.60 fof(disjoint_defn,axiom, % 0.53/0.60 ! [B,C] : % 0.53/0.60 ( disjoint(B,C) % 0.53/0.60 <=> ~ intersect(B,C) ) ). % 0.53/0.60 % 0.53/0.60 %---- property(symmetry,op(intersect,2,predicate)) % 0.53/0.60 fof(symmetry_of_intersect,axiom, % 0.53/0.60 ! [B,C] : % 0.53/0.60 ( intersect(B,C) % 0.53/0.60 => intersect(C,B) ) ). % 0.53/0.60 % 0.53/0.60 %---- line(boole - th(17),1833112) % 0.53/0.60 fof(prove_th17,conjecture, % 0.53/0.60 ! [B,C] : % 0.53/0.60 ( ! [D] : % 0.53/0.60 ( member(D,B) % 0.53/0.60 => ~ member(D,C) ) % 0.53/0.60 => disjoint(B,C) ) ). % 0.53/0.60 % 0.53/0.60 %-------------------------------------------------------------------------- % 0.53/0.60 %------------------------------------------- % 0.53/0.60 % Proof found % 0.53/0.60 % SZS status Theorem for theBenchmark % 0.53/0.60 % SZS output start Proof % 0.54/0.60 %ClaNum:8(EqnAxiom:0) % 0.54/0.60 %VarNum:30(SingletonVarNum:14) % 0.54/0.60 %MaxLitNum:3 % 0.54/0.60 %MaxfuncDepth:1 % 0.54/0.60 %SharedTerms:3 % 0.54/0.60 %goalClause: 1 4 % 0.54/0.60 %singleGoalClaCount:1 % 0.54/0.60 [1]~P1(a1,a3) % 0.54/0.60 [4]~P3(x41,a3)+~P3(x41,a1) % 0.54/0.60 [2]P1(x21,x22)+P2(x21,x22) % 0.54/0.60 [3]~P2(x32,x31)+P2(x31,x32) % 0.54/0.60 [5]~P1(x51,x52)+~P2(x51,x52) % 0.54/0.60 [7]~P2(x71,x72)+P3(f2(x71,x72),x72) % 0.54/0.60 [8]~P2(x81,x82)+P3(f2(x81,x82),x81) % 0.54/0.60 [6]~P3(x63,x61)+P2(x61,x62)+~P3(x63,x62) % 0.54/0.60 %EqnAxiom % 0.54/0.60 % 0.54/0.60 %------------------------------------------- % 0.54/0.60 cnf(9,plain, % 0.54/0.60 (P2(a3,a1)), % 0.54/0.60 inference(scs_inference,[],[1,2,3])). % 0.54/0.60 cnf(12,plain, % 0.54/0.60 (~P3(f2(a3,a1),a3)), % 0.54/0.60 inference(scs_inference,[],[9,4,7])). % 0.54/0.60 cnf(13,plain, % 0.54/0.60 ($false), % 0.54/0.60 inference(scs_inference,[],[12,9,8]), % 0.54/0.60 ['proof']). % 0.54/0.60 % SZS output end Proof % 0.54/0.60 % Total time :0.000000s %------------------------------------------------------------------------------