%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SET574+3 : TPTP v8.2.0. Released v2.2.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % Computer : n025.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.54s 0.62s % Output : CNFRefutation 0.54s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SET574+3 : TPTP v8.2.0. Released v2.2.0. % 0.11/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.12/0.34 % Computer : n025.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:22:09 EDT 2024 % 0.12/0.34 % CPUTime : % 0.20/0.58 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.000000s % 0.54/0.61 % Output :CNFRefutation 0.000000s % 0.54/0.61 %------------------------------------------- % 0.54/0.61 %-------------------------------------------------------------------------- % 0.54/0.61 % File : SET574+3 : TPTP v8.2.0. Released v2.2.0. % 0.54/0.61 % Domain : Set Theory % 0.54/0.62 % Problem : Trybulec's 13th Boolean property of sets % 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 (13) [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 v5.3.0, 0.09 v5.2.0, 0.00 v2.2.1 % 0.54/0.62 % Syntax : Number of formulae : 3 ( 0 unt; 0 def) % 0.54/0.62 % Number of atoms : 8 ( 0 equ) % 0.54/0.62 % Maximal formula atoms : 3 ( 2 avg) % 0.54/0.62 % Number of connectives : 5 ( 0 ~; 0 |; 2 &) % 0.54/0.62 % ( 1 <=>; 2 =>; 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 : 2 ( 2 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 : 8 ( 7 !; 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 %---- 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 %---- line(boole - th(13),1833110) % 0.54/0.62 fof(prove_th13,conjecture, % 0.54/0.62 ! [B,C,D] : % 0.54/0.62 ( ( member(B,C) % 0.54/0.62 & member(B,D) ) % 0.54/0.62 => intersect(C,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:7(EqnAxiom:0) % 0.54/0.62 %VarNum:20(SingletonVarNum:9) % 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 3 % 0.54/0.62 %singleGoalClaCount:3 % 0.54/0.62 [1]P1(a1,a3) % 0.54/0.62 [2]P1(a1,a4) % 0.54/0.62 [3]~P2(a3,a4) % 0.54/0.62 [4]~P2(x42,x41)+P2(x41,x42) % 0.54/0.62 [6]~P2(x61,x62)+P1(f2(x61,x62),x62) % 0.54/0.62 [7]~P2(x71,x72)+P1(f2(x71,x72),x71) % 0.54/0.62 [5]~P1(x53,x51)+P2(x51,x52)+~P1(x53,x52) % 0.54/0.62 %EqnAxiom % 0.54/0.62 % 0.54/0.62 %------------------------------------------- % 0.54/0.62 cnf(8,plain, % 0.54/0.62 ($false), % 0.54/0.62 inference(scs_inference,[],[1,3,2,5]), % 0.54/0.62 ['proof']). % 0.54/0.62 % SZS output end Proof % 0.54/0.62 % Total time :0.000000s %------------------------------------------------------------------------------