%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SET575+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 : n032.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.12s 0.49s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.08 % Problem : SET575+3 : TPTP v8.2.0. Released v2.2.0. % 0.07/0.08 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.07/0.27 % Computer : n032.cluster.edu % 0.07/0.27 % Model : x86_64 x86_64 % 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.07/0.27 % Memory : 8042.1875MB % 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64 % 0.07/0.27 % CPULimit : 300 % 0.07/0.27 % WCLimit : 300 % 0.07/0.27 % DateTime : Sun Jun 23 14:51:39 EDT 2024 % 0.07/0.27 % CPUTime : % 0.12/0.46 start to proof:theBenchmark % 0.12/0.48 %------------------------------------------- % 0.12/0.48 % File :CSE---1.7 % 0.12/0.48 % Problem :theBenchmark % 0.12/0.48 % Transform :cnf % 0.12/0.48 % Format :tptp:raw % 0.12/0.48 % Command :java -jar mcs_scs.jar %d %s % 0.12/0.48 % 0.12/0.48 % Result :Theorem 0.000000s % 0.12/0.48 % Output :CNFRefutation 0.000000s % 0.12/0.48 %------------------------------------------- % 0.12/0.49 %-------------------------------------------------------------------------- % 0.12/0.49 % File : SET575+3 : TPTP v8.2.0. Released v2.2.0. % 0.12/0.49 % Domain : Set Theory % 0.12/0.49 % Problem : Trybulec's 15th Boolean property of sets % 0.12/0.49 % Version : [Try90] axioms : Reduced > Incomplete. % 0.12/0.49 % English : % 0.12/0.49 % 0.12/0.49 % Refs : [ILF] The ILF Group (1998), The ILF System: A Tool for the Int % 0.12/0.49 % : [TS89] Trybulec & Swieczkowska (1989), Boolean Properties of % 0.12/0.49 % : [Try90] Trybulec (1990), Tarski Grothendieck Set Theory % 0.12/0.49 % Source : [ILF] % 0.12/0.49 % Names : BOOLE (15) [TS89] % 0.12/0.49 % 0.12/0.49 % Status : Theorem % 0.12/0.49 % Rating : 0.00 v8.1.0, 0.07 v7.5.0, 0.05 v7.4.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.12/0.49 % Syntax : Number of formulae : 3 ( 0 unt; 0 def) % 0.12/0.49 % Number of atoms : 8 ( 0 equ) % 0.12/0.49 % Maximal formula atoms : 3 ( 2 avg) % 0.12/0.49 % Number of connectives : 5 ( 0 ~; 0 |; 2 &) % 0.12/0.49 % ( 1 <=>; 2 =>; 0 <=; 0 <~>) % 0.12/0.49 % Maximal formula depth : 6 ( 5 avg) % 0.12/0.49 % Maximal term depth : 1 ( 1 avg) % 0.12/0.49 % Number of predicates : 2 ( 2 usr; 0 prp; 2-2 aty) % 0.12/0.49 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 0.12/0.49 % Number of variables : 8 ( 6 !; 2 ?) % 0.12/0.49 % SPC : FOF_THM_RFO_NEQ % 0.12/0.49 % 0.12/0.49 % Comments : % 0.12/0.49 %-------------------------------------------------------------------------- % 0.12/0.49 %---- line(boole - df(5),1833080) % 0.12/0.49 fof(intersect_defn,axiom, % 0.12/0.49 ! [B,C] : % 0.12/0.49 ( intersect(B,C) % 0.12/0.49 <=> ? [D] : % 0.12/0.49 ( member(D,B) % 0.12/0.49 & member(D,C) ) ) ). % 0.12/0.49 % 0.12/0.49 %---- property(symmetry,op(intersect,2,predicate)) % 0.12/0.49 fof(symmetry_of_intersect,axiom, % 0.12/0.49 ! [B,C] : % 0.12/0.49 ( intersect(B,C) % 0.12/0.49 => intersect(C,B) ) ). % 0.12/0.49 % 0.12/0.49 %---- line(boole - th(15),1833111) % 0.12/0.49 fof(prove_th15,conjecture, % 0.12/0.49 ! [B,C] : % 0.12/0.49 ( intersect(B,C) % 0.12/0.49 => ? [D] : % 0.12/0.49 ( member(D,B) % 0.12/0.49 & member(D,C) ) ) ). % 0.12/0.49 % 0.12/0.49 %-------------------------------------------------------------------------- % 0.12/0.49 %------------------------------------------- % 0.12/0.49 % Proof found % 0.12/0.49 % SZS status Theorem for theBenchmark % 0.12/0.49 % SZS output start Proof % 0.12/0.49 %ClaNum:6(EqnAxiom:0) % 0.12/0.49 %VarNum:22(SingletonVarNum:10) % 0.12/0.49 %MaxLitNum:3 % 0.12/0.49 %MaxfuncDepth:1 % 0.12/0.49 %SharedTerms:3 % 0.12/0.49 %goalClause: 1 3 % 0.12/0.49 %singleGoalClaCount:1 % 0.12/0.49 [1]P1(a1,a3) % 0.12/0.49 [3]~P2(x31,a3)+~P2(x31,a1) % 0.12/0.49 [2]~P1(x22,x21)+P1(x21,x22) % 0.12/0.49 [5]~P1(x51,x52)+P2(f2(x51,x52),x52) % 0.12/0.49 [6]~P1(x61,x62)+P2(f2(x61,x62),x61) % 0.12/0.49 [4]~P2(x43,x41)+P1(x41,x42)+~P2(x43,x42) % 0.12/0.49 %EqnAxiom % 0.12/0.49 % 0.12/0.49 %------------------------------------------- % 0.12/0.49 cnf(7,plain, % 0.12/0.49 (P2(f2(a3,a1),a1)), % 0.12/0.49 inference(scs_inference,[],[1,2,5])). % 0.12/0.49 cnf(14,plain, % 0.12/0.49 ($false), % 0.12/0.49 inference(scs_inference,[],[1,7,3,6,4,2]), % 0.12/0.49 ['proof']). % 0.12/0.49 % SZS output end Proof % 0.12/0.49 % Total time :0.000000s %------------------------------------------------------------------------------