TSTP Solution File: SET631+3 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : SET631+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n009.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 : 600s
% DateTime : Tue Jul 19 04:39:14 EDT 2022
% Result : Theorem 0.20s 0.53s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET631+3 : TPTP v8.1.0. Released v2.2.0.
% 0.04/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sat Jul 9 23:52:22 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.53 # Version: 1.3
% 0.20/0.53 # SZS status Theorem
% 0.20/0.53 # SZS output start CNFRefutation
% 0.20/0.53 fof(prove_th113,conjecture,(![B]:(![C]:(![D]:(intersect(B,difference(C,D))=>intersect(B,C))))),input).
% 0.20/0.53 fof(c0,negated_conjecture,(~(![B]:(![C]:(![D]:(intersect(B,difference(C,D))=>intersect(B,C)))))),inference(assume_negation,status(cth),[prove_th113])).
% 0.20/0.53 fof(c1,negated_conjecture,(?[B]:(?[C]:(?[D]:(intersect(B,difference(C,D))&~intersect(B,C))))),inference(fof_nnf,status(thm),[c0])).
% 0.20/0.53 fof(c2,negated_conjecture,(?[B]:(?[C]:((?[D]:intersect(B,difference(C,D)))&~intersect(B,C)))),inference(shift_quantors,status(thm),[c1])).
% 0.20/0.53 fof(c3,negated_conjecture,(?[X2]:(?[X3]:((?[X4]:intersect(X2,difference(X3,X4)))&~intersect(X2,X3)))),inference(variable_rename,status(thm),[c2])).
% 0.20/0.53 fof(c4,negated_conjecture,(intersect(skolem0001,difference(skolem0002,skolem0003))&~intersect(skolem0001,skolem0002)),inference(skolemize,status(esa),[c3])).
% 0.20/0.53 cnf(c6,negated_conjecture,~intersect(skolem0001,skolem0002),inference(split_conjunct,status(thm),[c4])).
% 0.20/0.53 fof(symmetry_of_intersect,axiom,(![B]:(![C]:(intersect(B,C)=>intersect(C,B)))),input).
% 0.20/0.53 fof(c7,axiom,(![B]:(![C]:(~intersect(B,C)|intersect(C,B)))),inference(fof_nnf,status(thm),[symmetry_of_intersect])).
% 0.20/0.53 fof(c8,axiom,(![X5]:(![X6]:(~intersect(X5,X6)|intersect(X6,X5)))),inference(variable_rename,status(thm),[c7])).
% 0.20/0.53 cnf(c9,axiom,~intersect(X19,X20)|intersect(X20,X19),inference(split_conjunct,status(thm),[c8])).
% 0.20/0.53 fof(intersect_defn,axiom,(![B]:(![C]:(intersect(B,C)<=>(?[D]:(member(D,B)&member(D,C)))))),input).
% 0.20/0.53 fof(c10,axiom,(![B]:(![C]:((~intersect(B,C)|(?[D]:(member(D,B)&member(D,C))))&((![D]:(~member(D,B)|~member(D,C)))|intersect(B,C))))),inference(fof_nnf,status(thm),[intersect_defn])).
% 0.20/0.53 fof(c11,axiom,((![B]:(![C]:(~intersect(B,C)|(?[D]:(member(D,B)&member(D,C))))))&(![B]:(![C]:((![D]:(~member(D,B)|~member(D,C)))|intersect(B,C))))),inference(shift_quantors,status(thm),[c10])).
% 0.20/0.53 fof(c12,axiom,((![X7]:(![X8]:(~intersect(X7,X8)|(?[X9]:(member(X9,X7)&member(X9,X8))))))&(![X10]:(![X11]:((![X12]:(~member(X12,X10)|~member(X12,X11)))|intersect(X10,X11))))),inference(variable_rename,status(thm),[c11])).
% 0.20/0.53 fof(c14,axiom,(![X7]:(![X8]:(![X10]:(![X11]:(![X12]:((~intersect(X7,X8)|(member(skolem0004(X7,X8),X7)&member(skolem0004(X7,X8),X8)))&((~member(X12,X10)|~member(X12,X11))|intersect(X10,X11)))))))),inference(shift_quantors,status(thm),[fof(c13,axiom,((![X7]:(![X8]:(~intersect(X7,X8)|(member(skolem0004(X7,X8),X7)&member(skolem0004(X7,X8),X8)))))&(![X10]:(![X11]:((![X12]:(~member(X12,X10)|~member(X12,X11)))|intersect(X10,X11))))),inference(skolemize,status(esa),[c12])).])).
% 0.20/0.53 fof(c15,axiom,(![X7]:(![X8]:(![X10]:(![X11]:(![X12]:(((~intersect(X7,X8)|member(skolem0004(X7,X8),X7))&(~intersect(X7,X8)|member(skolem0004(X7,X8),X8)))&((~member(X12,X10)|~member(X12,X11))|intersect(X10,X11)))))))),inference(distribute,status(thm),[c14])).
% 0.20/0.53 cnf(c18,axiom,~member(X31,X33)|~member(X31,X32)|intersect(X33,X32),inference(split_conjunct,status(thm),[c15])).
% 0.20/0.53 cnf(c5,negated_conjecture,intersect(skolem0001,difference(skolem0002,skolem0003)),inference(split_conjunct,status(thm),[c4])).
% 0.20/0.53 cnf(c16,axiom,~intersect(X22,X21)|member(skolem0004(X22,X21),X22),inference(split_conjunct,status(thm),[c15])).
% 0.20/0.53 cnf(c30,plain,member(skolem0004(skolem0001,difference(skolem0002,skolem0003)),skolem0001),inference(resolution,status(thm),[c16, c5])).
% 0.20/0.53 cnf(c34,plain,~member(skolem0004(skolem0001,difference(skolem0002,skolem0003)),X37)|intersect(X37,skolem0001),inference(resolution,status(thm),[c30, c18])).
% 0.20/0.53 fof(difference_defn,axiom,(![B]:(![C]:(![D]:(member(D,difference(B,C))<=>(member(D,B)&(~member(D,C))))))),input).
% 0.20/0.53 fof(c19,axiom,(![B]:(![C]:(![D]:(member(D,difference(B,C))<=>(member(D,B)&~member(D,C)))))),inference(fof_simplification,status(thm),[difference_defn])).
% 0.20/0.53 fof(c20,axiom,(![B]:(![C]:(![D]:((~member(D,difference(B,C))|(member(D,B)&~member(D,C)))&((~member(D,B)|member(D,C))|member(D,difference(B,C))))))),inference(fof_nnf,status(thm),[c19])).
% 0.20/0.53 fof(c21,axiom,((![B]:(![C]:(![D]:(~member(D,difference(B,C))|(member(D,B)&~member(D,C))))))&(![B]:(![C]:(![D]:((~member(D,B)|member(D,C))|member(D,difference(B,C))))))),inference(shift_quantors,status(thm),[c20])).
% 0.20/0.53 fof(c23,axiom,(![X13]:(![X14]:(![X15]:(![X16]:(![X17]:(![X18]:((~member(X15,difference(X13,X14))|(member(X15,X13)&~member(X15,X14)))&((~member(X18,X16)|member(X18,X17))|member(X18,difference(X16,X17)))))))))),inference(shift_quantors,status(thm),[fof(c22,axiom,((![X13]:(![X14]:(![X15]:(~member(X15,difference(X13,X14))|(member(X15,X13)&~member(X15,X14))))))&(![X16]:(![X17]:(![X18]:((~member(X18,X16)|member(X18,X17))|member(X18,difference(X16,X17))))))),inference(variable_rename,status(thm),[c21])).])).
% 0.20/0.53 fof(c24,axiom,(![X13]:(![X14]:(![X15]:(![X16]:(![X17]:(![X18]:(((~member(X15,difference(X13,X14))|member(X15,X13))&(~member(X15,difference(X13,X14))|~member(X15,X14)))&((~member(X18,X16)|member(X18,X17))|member(X18,difference(X16,X17)))))))))),inference(distribute,status(thm),[c23])).
% 0.20/0.53 cnf(c25,axiom,~member(X25,difference(X27,X26))|member(X25,X27),inference(split_conjunct,status(thm),[c24])).
% 0.20/0.53 cnf(c17,axiom,~intersect(X24,X23)|member(skolem0004(X24,X23),X23),inference(split_conjunct,status(thm),[c15])).
% 0.20/0.53 cnf(c32,plain,member(skolem0004(skolem0001,difference(skolem0002,skolem0003)),difference(skolem0002,skolem0003)),inference(resolution,status(thm),[c17, c5])).
% 0.20/0.53 cnf(c45,plain,member(skolem0004(skolem0001,difference(skolem0002,skolem0003)),skolem0002),inference(resolution,status(thm),[c32, c25])).
% 0.20/0.53 cnf(c67,plain,intersect(skolem0002,skolem0001),inference(resolution,status(thm),[c45, c34])).
% 0.20/0.53 cnf(c70,plain,intersect(skolem0001,skolem0002),inference(resolution,status(thm),[c67, c9])).
% 0.20/0.53 cnf(c72,plain,$false,inference(resolution,status(thm),[c70, c6])).
% 0.20/0.53 # SZS output end CNFRefutation
% 0.20/0.53
% 0.20/0.53 # Initial clauses : 9
% 0.20/0.53 # Processed clauses : 23
% 0.20/0.53 # Factors computed : 0
% 0.20/0.53 # Resolvents computed: 47
% 0.20/0.53 # Tautologies deleted: 0
% 0.20/0.53 # Forward subsumed : 4
% 0.20/0.53 # Backward subsumed : 0
% 0.20/0.53 # -------- CPU Time ---------
% 0.20/0.53 # User time : 0.172 s
% 0.20/0.53 # System time : 0.015 s
% 0.20/0.53 # Total time : 0.187 s
%------------------------------------------------------------------------------