%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SET631+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:22:04 EDT 2024 % Result : Theorem 0.58s 0.66s % Output : CNFRefutation 0.58s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SET631+3 : TPTP v8.2.0. Released v2.2.0. % 0.07/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.12/0.34 % Computer : n024.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 300 % 0.12/0.34 % DateTime : Sun Jun 23 12:27:09 EDT 2024 % 0.12/0.34 % CPUTime : % 0.57/0.62 start to proof:theBenchmark % 0.58/0.66 %------------------------------------------- % 0.58/0.66 % File :CSE---1.7 % 0.58/0.66 % Problem :theBenchmark % 0.58/0.66 % Transform :cnf % 0.58/0.66 % Format :tptp:raw % 0.58/0.66 % Command :java -jar mcs_scs.jar %d %s % 0.58/0.66 % 0.58/0.66 % Result :Theorem 0.000000s % 0.58/0.66 % Output :CNFRefutation 0.000000s % 0.58/0.66 %------------------------------------------- % 0.58/0.66 %-------------------------------------------------------------------------- % 0.58/0.66 % File : SET631+3 : TPTP v8.2.0. Released v2.2.0. % 0.58/0.66 % Domain : Set Theory % 0.58/0.66 % Problem : If X intersects the difference of Y and Z, then X intersects Y % 0.58/0.66 % Version : [Try90] axioms : Reduced > Incomplete. % 0.58/0.66 % English : % 0.58/0.66 % 0.58/0.66 % Refs : [ILF] The ILF Group (1998), The ILF System: A Tool for the Int % 0.58/0.66 % : [Try90] Trybulec (1990), Tarski Grothendieck Set Theory % 0.58/0.66 % : [TS89] Trybulec & Swieczkowska (1989), Boolean Properties of % 0.58/0.66 % Source : [ILF] % 0.58/0.66 % Names : BOOLE (113) [TS89] % 0.58/0.66 % 0.58/0.66 % Status : Theorem % 0.58/0.66 % Rating : 0.00 v8.2.0, 0.07 v8.1.0, 0.00 v6.3.0, 0.08 v6.2.0, 0.00 v5.3.0, 0.09 v5.2.0, 0.00 v2.2.1 % 0.58/0.66 % Syntax : Number of formulae : 4 ( 0 unt; 0 def) % 0.58/0.66 % Number of atoms : 10 ( 0 equ) % 0.58/0.66 % Maximal formula atoms : 3 ( 2 avg) % 0.58/0.66 % Number of connectives : 7 ( 1 ~; 0 |; 2 &) % 0.58/0.66 % ( 2 <=>; 2 =>; 0 <=; 0 <~>) % 0.58/0.66 % Maximal formula depth : 7 ( 6 avg) % 0.58/0.66 % Maximal term depth : 2 ( 1 avg) % 0.58/0.66 % Number of predicates : 2 ( 2 usr; 0 prp; 2-2 aty) % 0.58/0.66 % Number of functors : 1 ( 1 usr; 0 con; 2-2 aty) % 0.58/0.66 % Number of variables : 11 ( 10 !; 1 ?) % 0.58/0.66 % SPC : FOF_THM_RFO_NEQ % 0.58/0.66 % 0.58/0.66 % Comments : % 0.58/0.66 %-------------------------------------------------------------------------- % 0.58/0.66 %---- line(boole - df(4),1833078) % 0.58/0.66 fof(difference_defn,axiom, % 0.58/0.66 ! [B,C,D] : % 0.58/0.66 ( member(D,difference(B,C)) % 0.58/0.66 <=> ( member(D,B) % 0.58/0.66 & ~ member(D,C) ) ) ). % 0.58/0.66 % 0.58/0.66 %---- line(boole - df(5),1833080) % 0.58/0.66 fof(intersect_defn,axiom, % 0.58/0.66 ! [B,C] : % 0.58/0.66 ( intersect(B,C) % 0.58/0.66 <=> ? [D] : % 0.58/0.66 ( member(D,B) % 0.58/0.66 & member(D,C) ) ) ). % 0.58/0.66 % 0.58/0.66 %---- property(symmetry,op(intersect,2,predicate)) % 0.58/0.66 fof(symmetry_of_intersect,axiom, % 0.58/0.66 ! [B,C] : % 0.58/0.66 ( intersect(B,C) % 0.58/0.66 => intersect(C,B) ) ). % 0.58/0.66 % 0.58/0.66 %---- line(boole - th(113),1834379) % 0.58/0.66 fof(prove_th113,conjecture, % 0.58/0.66 ! [B,C,D] : % 0.58/0.66 ( intersect(B,difference(C,D)) % 0.58/0.66 => intersect(B,C) ) ). % 0.58/0.66 % 0.58/0.66 %-------------------------------------------------------------------------- % 0.58/0.66 %------------------------------------------- % 0.58/0.66 % Proof found % 0.58/0.66 % SZS status Theorem for theBenchmark % 0.58/0.66 % SZS output start Proof % 0.58/0.66 %ClaNum:9(EqnAxiom:0) % 0.58/0.66 %VarNum:37(SingletonVarNum:18) % 0.58/0.66 %MaxLitNum:3 % 0.58/0.66 %MaxfuncDepth:1 % 0.58/0.66 %SharedTerms:6 % 0.58/0.66 %goalClause: 1 2 % 0.58/0.66 %singleGoalClaCount:2 % 0.58/0.66 [2]~P1(a1,a4) % 0.58/0.66 [1]P1(a1,f2(a4,a5)) % 0.58/0.66 [3]~P1(x32,x31)+P1(x31,x32) % 0.58/0.66 [5]~P1(x51,x52)+P2(f3(x51,x52),x52) % 0.58/0.66 [6]~P1(x61,x62)+P2(f3(x61,x62),x61) % 0.58/0.66 [8]P2(x81,x82)+~P2(x81,f2(x82,x83)) % 0.58/0.66 [9]~P2(x91,x92)+~P2(x91,f2(x93,x92)) % 0.58/0.66 [4]~P2(x43,x41)+P1(x41,x42)+~P2(x43,x42) % 0.58/0.66 [7]~P2(x71,x73)+P2(x71,x72)+P2(x71,f2(x73,x72)) % 0.58/0.66 %EqnAxiom % 0.58/0.66 % 0.58/0.66 %------------------------------------------- % 0.58/0.67 cnf(10,plain, % 0.58/0.67 (~P1(a4,a1)), % 0.58/0.67 inference(scs_inference,[],[2,3])). % 0.58/0.67 cnf(12,plain, % 0.58/0.67 (P2(f3(f2(a4,a5),a1),a1)), % 0.58/0.67 inference(scs_inference,[],[1,5,3])). % 0.58/0.67 cnf(15,plain, % 0.58/0.67 (P2(f3(f2(a4,a5),a1),f2(a4,a5))), % 0.58/0.67 inference(scs_inference,[],[1,6,3])). % 0.58/0.67 cnf(16,plain, % 0.58/0.67 (P2(f3(f2(a4,a5),a1),a4)), % 0.58/0.67 inference(scs_inference,[],[15,8])). % 0.58/0.67 cnf(29,plain, % 0.58/0.67 ($false), % 0.58/0.67 inference(scs_inference,[],[10,16,12,3,4]), % 0.58/0.67 ['proof']). % 0.58/0.67 % SZS output end Proof % 0.58/0.67 % Total time :0.000000s %------------------------------------------------------------------------------