%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SET590+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:52 EDT 2024 % Result : Theorem 0.53s 0.61s % Output : CNFRefutation 0.53s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : SET590+3 : TPTP v8.2.0. Released v2.2.0. % 0.12/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n024.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 12:20:24 EDT 2024 % 0.12/0.33 % CPUTime : % 0.19/0.57 start to proof:theBenchmark % 0.53/0.60 %------------------------------------------- % 0.53/0.60 % File :CSE---1.7 % 0.53/0.60 % Problem :theBenchmark % 0.53/0.60 % Transform :cnf % 0.53/0.60 % Format :tptp:raw % 0.53/0.60 % Command :java -jar mcs_scs.jar %d %s % 0.53/0.60 % 0.53/0.60 % Result :Theorem 0.000000s % 0.53/0.60 % Output :CNFRefutation 0.000000s % 0.53/0.60 %------------------------------------------- % 0.53/0.61 %-------------------------------------------------------------------------- % 0.53/0.61 % File : SET590+3 : TPTP v8.2.0. Released v2.2.0. % 0.53/0.61 % Domain : Set Theory % 0.53/0.61 % Problem : The difference of X and Y is a subset of X % 0.53/0.61 % Version : [Try90] axioms : Reduced > Incomplete. % 0.53/0.61 % English : % 0.53/0.61 % 0.53/0.61 % Refs : [ILF] The ILF Group (1998), The ILF System: A Tool for the Int % 0.53/0.61 % : [Try90] Trybulec (1990), Tarski Grothendieck Set Theory % 0.53/0.61 % : [TS89] Trybulec & Swieczkowska (1989), Boolean Properties of % 0.53/0.61 % Source : [ILF] % 0.53/0.61 % Names : BOOLE (49) [TS89] % 0.53/0.61 % 0.53/0.61 % Status : Theorem % 0.53/0.61 % Rating : 0.06 v8.2.0, 0.00 v6.3.0, 0.08 v6.2.0, 0.00 v5.4.0, 0.04 v5.3.0, 0.13 v5.2.0, 0.00 v2.2.1 % 0.53/0.61 % Syntax : Number of formulae : 4 ( 2 unt; 0 def) % 0.53/0.61 % Number of atoms : 8 ( 0 equ) % 0.53/0.61 % Maximal formula atoms : 3 ( 2 avg) % 0.53/0.61 % Number of connectives : 5 ( 1 ~; 0 |; 1 &) % 0.53/0.61 % ( 2 <=>; 1 =>; 0 <=; 0 <~>) % 0.53/0.61 % Maximal formula depth : 7 ( 5 avg) % 0.53/0.61 % Maximal term depth : 2 ( 1 avg) % 0.53/0.61 % Number of predicates : 2 ( 2 usr; 0 prp; 2-2 aty) % 0.53/0.61 % Number of functors : 1 ( 1 usr; 0 con; 2-2 aty) % 0.53/0.61 % Number of variables : 9 ( 9 !; 0 ?) % 0.53/0.61 % SPC : FOF_THM_RFO_NEQ % 0.53/0.61 % 0.53/0.61 % Comments : % 0.53/0.61 %-------------------------------------------------------------------------- % 0.53/0.61 %---- line(boole - df(4),1833078) % 0.53/0.61 fof(difference_defn,axiom, % 0.53/0.61 ! [B,C,D] : % 0.53/0.61 ( member(D,difference(B,C)) % 0.53/0.61 <=> ( member(D,B) % 0.53/0.61 & ~ member(D,C) ) ) ). % 0.53/0.61 % 0.53/0.61 %---- line(tarski - df(3),1832749) % 0.53/0.61 fof(subset_defn,axiom, % 0.53/0.61 ! [B,C] : % 0.53/0.61 ( subset(B,C) % 0.53/0.61 <=> ! [D] : % 0.53/0.61 ( member(D,B) % 0.53/0.61 => member(D,C) ) ) ). % 0.53/0.61 % 0.53/0.61 %---- property(reflexivity,op(subset,2,predicate)) % 0.53/0.61 fof(reflexivity_of_subset,axiom, % 0.53/0.61 ! [B] : subset(B,B) ). % 0.53/0.61 % 0.53/0.61 %---- line(boole - th(49),1833463) % 0.53/0.61 fof(prove_th49,conjecture, % 0.53/0.61 ! [B,C] : subset(difference(B,C),B) ). % 0.53/0.61 % 0.53/0.61 %-------------------------------------------------------------------------- % 0.53/0.61 %------------------------------------------- % 0.53/0.61 % Proof found % 0.53/0.61 % SZS status Theorem for theBenchmark % 0.53/0.61 % SZS output start Proof % 0.53/0.61 %ClaNum:8(EqnAxiom:0) % 0.53/0.61 %VarNum:35(SingletonVarNum:17) % 0.53/0.61 %MaxLitNum:3 % 0.53/0.61 %MaxfuncDepth:1 % 0.53/0.61 %SharedTerms:4 % 0.53/0.61 %goalClause: 2 % 0.53/0.61 %singleGoalClaCount:1 % 0.53/0.61 [2]~P1(f2(a1,a4),a1) % 0.53/0.61 [1]P1(x11,x11) % 0.53/0.61 [3]P1(x31,x32)+P2(f3(x31,x32),x31) % 0.53/0.61 [7]P1(x71,x72)+~P2(f3(x71,x72),x72) % 0.53/0.61 [6]P2(x61,x62)+~P2(x61,f2(x62,x63)) % 0.53/0.61 [8]~P2(x81,x82)+~P2(x81,f2(x83,x82)) % 0.53/0.61 [4]~P1(x43,x42)+P2(x41,x42)+~P2(x41,x43) % 0.53/0.61 [5]~P2(x51,x53)+P2(x51,x52)+P2(x51,f2(x53,x52)) % 0.53/0.61 %EqnAxiom % 0.53/0.61 % 0.53/0.61 %------------------------------------------- % 0.53/0.61 cnf(10,plain, % 0.53/0.61 (~P2(f3(f2(a1,a4),a1),f2(a1,x101))), % 0.53/0.61 inference(scs_inference,[],[2,6,7])). % 0.53/0.61 cnf(11,plain, % 0.53/0.61 ($false), % 0.53/0.61 inference(scs_inference,[],[2,10,3]), % 0.53/0.61 ['proof']). % 0.53/0.61 % SZS output end Proof % 0.53/0.61 % Total time :0.000000s %------------------------------------------------------------------------------