%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SET625+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:22:02 EDT 2024 % Result : Theorem 0.54s 0.62s % Output : CNFRefutation 0.54s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SET625+3 : TPTP v8.2.0. Released v2.2.0. % 0.03/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.11/0.33 % Computer : n019.cluster.edu % 0.11/0.33 % Model : x86_64 x86_64 % 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.33 % Memory : 8042.1875MB % 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.33 % CPULimit : 300 % 0.11/0.33 % WCLimit : 300 % 0.11/0.33 % DateTime : Sun Jun 23 14:18:53 EDT 2024 % 0.11/0.33 % CPUTime : % 0.50/0.56 start to proof:theBenchmark % 0.54/0.61 %------------------------------------------- % 0.54/0.61 % File :CSE---1.7 % 0.54/0.61 % Problem :theBenchmark % 0.54/0.61 % Transform :cnf % 0.54/0.61 % Format :tptp:raw % 0.54/0.61 % Command :java -jar mcs_scs.jar %d %s % 0.54/0.61 % 0.54/0.61 % Result :Theorem 0.010000s % 0.54/0.61 % Output :CNFRefutation 0.010000s % 0.54/0.61 %------------------------------------------- % 0.54/0.62 %-------------------------------------------------------------------------- % 0.54/0.62 % File : SET625+3 : TPTP v8.2.0. Released v2.2.0. % 0.54/0.62 % Domain : Set Theory % 0.54/0.62 % Problem : If X intersects Y and Y is a subset of Z, then X intersects Z % 0.54/0.62 % Version : [Try90] axioms : Reduced > Incomplete. % 0.54/0.62 % English : % 0.54/0.62 % 0.54/0.62 % Refs : [ILF] The ILF Group (1998), The ILF System: A Tool for the Int % 0.54/0.62 % : [Try90] Trybulec (1990), Tarski Grothendieck Set Theory % 0.54/0.62 % : [TS89] Trybulec & Swieczkowska (1989), Boolean Properties of % 0.54/0.62 % Source : [ILF] % 0.54/0.62 % Names : BOOLE (101) [TS89] % 0.54/0.62 % 0.54/0.62 % Status : Theorem % 0.54/0.62 % Rating : 0.00 v8.2.0, 0.07 v8.1.0, 0.00 v6.3.0, 0.08 v6.2.0, 0.00 v6.1.0, 0.04 v6.0.0, 0.25 v5.5.0, 0.04 v5.3.0, 0.13 v5.2.0, 0.00 v3.2.0, 0.11 v3.1.0, 0.00 v2.2.1 % 0.54/0.62 % Syntax : Number of formulae : 5 ( 1 unt; 0 def) % 0.54/0.62 % Number of atoms : 12 ( 0 equ) % 0.54/0.62 % Maximal formula atoms : 3 ( 2 avg) % 0.54/0.62 % Number of connectives : 7 ( 0 ~; 0 |; 2 &) % 0.54/0.62 % ( 2 <=>; 3 =>; 0 <=; 0 <~>) % 0.54/0.62 % Maximal formula depth : 6 ( 5 avg) % 0.54/0.62 % Maximal term depth : 1 ( 1 avg) % 0.54/0.62 % Number of predicates : 3 ( 3 usr; 0 prp; 2-2 aty) % 0.54/0.62 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 0.54/0.62 % Number of variables : 12 ( 11 !; 1 ?) % 0.54/0.62 % SPC : FOF_THM_RFO_NEQ % 0.54/0.62 % 0.54/0.62 % Comments : % 0.54/0.62 %-------------------------------------------------------------------------- % 0.54/0.62 %---- line(boole - df(5),1833080) % 0.54/0.62 fof(intersect_defn,axiom, % 0.54/0.62 ! [B,C] : % 0.54/0.62 ( intersect(B,C) % 0.54/0.62 <=> ? [D] : % 0.54/0.62 ( member(D,B) % 0.54/0.62 & member(D,C) ) ) ). % 0.54/0.62 % 0.54/0.62 %---- line(tarski - df(3),1832749) % 0.54/0.62 fof(subset_defn,axiom, % 0.54/0.62 ! [B,C] : % 0.54/0.62 ( subset(B,C) % 0.54/0.62 <=> ! [D] : % 0.54/0.62 ( member(D,B) % 0.54/0.62 => member(D,C) ) ) ). % 0.54/0.62 % 0.54/0.62 %---- property(symmetry,op(intersect,2,predicate)) % 0.54/0.62 fof(symmetry_of_intersect,axiom, % 0.54/0.62 ! [B,C] : % 0.54/0.62 ( intersect(B,C) % 0.54/0.62 => intersect(C,B) ) ). % 0.54/0.62 % 0.54/0.62 %---- property(reflexivity,op(subset,2,predicate)) % 0.54/0.62 fof(reflexivity_of_subset,axiom, % 0.54/0.62 ! [B] : subset(B,B) ). % 0.54/0.62 % 0.54/0.62 %---- line(boole - th(101),1834313) % 0.54/0.62 fof(prove_th101,conjecture, % 0.54/0.62 ! [B,C,D] : % 0.54/0.62 ( ( intersect(B,C) % 0.54/0.62 & subset(C,D) ) % 0.54/0.62 => intersect(B,D) ) ). % 0.54/0.62 % 0.54/0.62 %-------------------------------------------------------------------------- % 0.54/0.62 %------------------------------------------- % 0.54/0.62 % Proof found % 0.54/0.62 % SZS status Theorem for theBenchmark % 0.54/0.62 % SZS output start Proof % 0.54/0.62 %ClaNum:11(EqnAxiom:0) % 0.54/0.62 %VarNum:38(SingletonVarNum:17) % 0.54/0.62 %MaxLitNum:3 % 0.54/0.62 %MaxfuncDepth:1 % 0.54/0.62 %SharedTerms:6 % 0.54/0.62 %goalClause: 1 2 4 % 0.54/0.62 %singleGoalClaCount:3 % 0.54/0.62 [1]P1(a1,a4) % 0.54/0.62 [2]P2(a4,a5) % 0.54/0.62 [4]~P1(a1,a5) % 0.54/0.62 [3]P2(x31,x31) % 0.54/0.62 [5]~P1(x52,x51)+P1(x51,x52) % 0.54/0.62 [6]P2(x61,x62)+P3(f2(x61,x62),x61) % 0.54/0.62 [9]~P1(x91,x92)+P3(f3(x91,x92),x92) % 0.54/0.62 [10]~P1(x101,x102)+P3(f3(x101,x102),x101) % 0.54/0.62 [11]P2(x111,x112)+~P3(f2(x111,x112),x112) % 0.54/0.62 [7]~P3(x73,x71)+P1(x71,x72)+~P3(x73,x72) % 0.54/0.62 [8]~P2(x83,x82)+P3(x81,x82)+~P3(x81,x83) % 0.54/0.62 %EqnAxiom % 0.54/0.62 % 0.54/0.62 %------------------------------------------- % 0.54/0.62 cnf(12,plain, % 0.54/0.62 (~P1(a5,a1)), % 0.54/0.62 inference(scs_inference,[],[4,5])). % 0.54/0.62 cnf(15,plain, % 0.54/0.62 (P3(f3(a4,a1),a1)), % 0.54/0.62 inference(scs_inference,[],[1,9,5])). % 0.54/0.62 cnf(18,plain, % 0.54/0.62 (P3(f3(a4,a1),a4)), % 0.54/0.62 inference(scs_inference,[],[1,10,5])). % 0.54/0.62 cnf(19,plain, % 0.54/0.62 (P3(f3(a4,a1),a5)), % 0.54/0.62 inference(scs_inference,[],[2,18,8])). % 0.54/0.62 cnf(32,plain, % 0.54/0.62 ($false), % 0.54/0.62 inference(scs_inference,[],[12,19,15,5,7]), % 0.54/0.62 ['proof']). % 0.54/0.62 % SZS output end Proof % 0.54/0.62 % Total time :0.010000s %------------------------------------------------------------------------------