TSTP Solution File: SET199+3 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : SET199+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n028.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:36:34 EDT 2022
% Result : Theorem 2.00s 2.19s
% Output : Refutation 2.00s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET199+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.14/0.34 % Computer : n028.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 : Sun Jul 10 02:08:57 EDT 2022
% 0.14/0.34 % CPUTime :
% 2.00/2.19 # Version: 1.3
% 2.00/2.19 # SZS status Theorem
% 2.00/2.19 # SZS output start CNFRefutation
% 2.00/2.19 fof(prove_intersection_of_subsets,conjecture,(![B]:(![C]:(![D]:((subset(B,C)&subset(B,D))=>subset(B,intersection(C,D)))))),input).
% 2.00/2.19 fof(c3,negated_conjecture,(~(![B]:(![C]:(![D]:((subset(B,C)&subset(B,D))=>subset(B,intersection(C,D))))))),inference(assume_negation,status(cth),[prove_intersection_of_subsets])).
% 2.00/2.19 fof(c4,negated_conjecture,(?[B]:(?[C]:(?[D]:((subset(B,C)&subset(B,D))&~subset(B,intersection(C,D)))))),inference(fof_nnf,status(thm),[c3])).
% 2.00/2.19 fof(c5,negated_conjecture,(?[X2]:(?[X3]:(?[X4]:((subset(X2,X3)&subset(X2,X4))&~subset(X2,intersection(X3,X4)))))),inference(variable_rename,status(thm),[c4])).
% 2.00/2.19 fof(c6,negated_conjecture,((subset(skolem0001,skolem0002)&subset(skolem0001,skolem0003))&~subset(skolem0001,intersection(skolem0002,skolem0003))),inference(skolemize,status(esa),[c5])).
% 2.00/2.19 cnf(c9,negated_conjecture,~subset(skolem0001,intersection(skolem0002,skolem0003)),inference(split_conjunct,status(thm),[c6])).
% 2.00/2.19 fof(subset_defn,axiom,(![B]:(![C]:(subset(B,C)<=>(![D]:(member(D,B)=>member(D,C)))))),input).
% 2.00/2.19 fof(c24,axiom,(![B]:(![C]:((~subset(B,C)|(![D]:(~member(D,B)|member(D,C))))&((?[D]:(member(D,B)&~member(D,C)))|subset(B,C))))),inference(fof_nnf,status(thm),[subset_defn])).
% 2.00/2.19 fof(c25,axiom,((![B]:(![C]:(~subset(B,C)|(![D]:(~member(D,B)|member(D,C))))))&(![B]:(![C]:((?[D]:(member(D,B)&~member(D,C)))|subset(B,C))))),inference(shift_quantors,status(thm),[c24])).
% 2.00/2.19 fof(c26,axiom,((![X15]:(![X16]:(~subset(X15,X16)|(![X17]:(~member(X17,X15)|member(X17,X16))))))&(![X18]:(![X19]:((?[X20]:(member(X20,X18)&~member(X20,X19)))|subset(X18,X19))))),inference(variable_rename,status(thm),[c25])).
% 2.00/2.19 fof(c28,axiom,(![X15]:(![X16]:(![X17]:(![X18]:(![X19]:((~subset(X15,X16)|(~member(X17,X15)|member(X17,X16)))&((member(skolem0005(X18,X19),X18)&~member(skolem0005(X18,X19),X19))|subset(X18,X19)))))))),inference(shift_quantors,status(thm),[fof(c27,axiom,((![X15]:(![X16]:(~subset(X15,X16)|(![X17]:(~member(X17,X15)|member(X17,X16))))))&(![X18]:(![X19]:((member(skolem0005(X18,X19),X18)&~member(skolem0005(X18,X19),X19))|subset(X18,X19))))),inference(skolemize,status(esa),[c26])).])).
% 2.00/2.19 fof(c29,axiom,(![X15]:(![X16]:(![X17]:(![X18]:(![X19]:((~subset(X15,X16)|(~member(X17,X15)|member(X17,X16)))&((member(skolem0005(X18,X19),X18)|subset(X18,X19))&(~member(skolem0005(X18,X19),X19)|subset(X18,X19))))))))),inference(distribute,status(thm),[c28])).
% 2.00/2.19 cnf(c32,axiom,~member(skolem0005(X48,X47),X47)|subset(X48,X47),inference(split_conjunct,status(thm),[c29])).
% 2.00/2.19 cnf(c7,negated_conjecture,subset(skolem0001,skolem0002),inference(split_conjunct,status(thm),[c6])).
% 2.00/2.19 cnf(c31,axiom,member(skolem0005(X46,X45),X46)|subset(X46,X45),inference(split_conjunct,status(thm),[c29])).
% 2.00/2.19 cnf(c30,axiom,~subset(X66,X67)|~member(X68,X66)|member(X68,X67),inference(split_conjunct,status(thm),[c29])).
% 2.00/2.19 cnf(c54,plain,~subset(X128,X129)|member(skolem0005(X128,X130),X129)|subset(X128,X130),inference(resolution,status(thm),[c30, c31])).
% 2.00/2.19 cnf(c120,plain,member(skolem0005(skolem0001,X133),skolem0002)|subset(skolem0001,X133),inference(resolution,status(thm),[c54, c7])).
% 2.00/2.19 fof(intersection_defn,axiom,(![B]:(![C]:(![D]:(member(D,intersection(B,C))<=>(member(D,B)&member(D,C)))))),input).
% 2.00/2.19 fof(c33,axiom,(![B]:(![C]:(![D]:((~member(D,intersection(B,C))|(member(D,B)&member(D,C)))&((~member(D,B)|~member(D,C))|member(D,intersection(B,C))))))),inference(fof_nnf,status(thm),[intersection_defn])).
% 2.00/2.19 fof(c34,axiom,((![B]:(![C]:(![D]:(~member(D,intersection(B,C))|(member(D,B)&member(D,C))))))&(![B]:(![C]:(![D]:((~member(D,B)|~member(D,C))|member(D,intersection(B,C))))))),inference(shift_quantors,status(thm),[c33])).
% 2.00/2.19 fof(c36,axiom,(![X21]:(![X22]:(![X23]:(![X24]:(![X25]:(![X26]:((~member(X23,intersection(X21,X22))|(member(X23,X21)&member(X23,X22)))&((~member(X26,X24)|~member(X26,X25))|member(X26,intersection(X24,X25)))))))))),inference(shift_quantors,status(thm),[fof(c35,axiom,((![X21]:(![X22]:(![X23]:(~member(X23,intersection(X21,X22))|(member(X23,X21)&member(X23,X22))))))&(![X24]:(![X25]:(![X26]:((~member(X26,X24)|~member(X26,X25))|member(X26,intersection(X24,X25))))))),inference(variable_rename,status(thm),[c34])).])).
% 2.00/2.19 fof(c37,axiom,(![X21]:(![X22]:(![X23]:(![X24]:(![X25]:(![X26]:(((~member(X23,intersection(X21,X22))|member(X23,X21))&(~member(X23,intersection(X21,X22))|member(X23,X22)))&((~member(X26,X24)|~member(X26,X25))|member(X26,intersection(X24,X25)))))))))),inference(distribute,status(thm),[c36])).
% 2.00/2.19 cnf(c40,axiom,~member(X106,X105)|~member(X106,X104)|member(X106,intersection(X105,X104)),inference(split_conjunct,status(thm),[c37])).
% 2.00/2.19 cnf(c8,negated_conjecture,subset(skolem0001,skolem0003),inference(split_conjunct,status(thm),[c6])).
% 2.00/2.19 cnf(c121,plain,member(skolem0005(skolem0001,X139),skolem0003)|subset(skolem0001,X139),inference(resolution,status(thm),[c54, c8])).
% 2.00/2.19 cnf(c148,plain,subset(skolem0001,X849)|~member(skolem0005(skolem0001,X849),X850)|member(skolem0005(skolem0001,X849),intersection(X850,skolem0003)),inference(resolution,status(thm),[c121, c40])).
% 2.00/2.19 cnf(c3457,plain,subset(skolem0001,X1244)|member(skolem0005(skolem0001,X1244),intersection(skolem0002,skolem0003)),inference(resolution,status(thm),[c148, c120])).
% 2.00/2.19 cnf(c5484,plain,subset(skolem0001,intersection(skolem0002,skolem0003)),inference(resolution,status(thm),[c3457, c32])).
% 2.00/2.19 cnf(c5502,plain,$false,inference(resolution,status(thm),[c5484, c9])).
% 2.00/2.19 # SZS output end CNFRefutation
% 2.00/2.19
% 2.00/2.19 # Initial clauses : 21
% 2.00/2.19 # Processed clauses : 283
% 2.00/2.19 # Factors computed : 26
% 2.00/2.19 # Resolvents computed: 5440
% 2.00/2.19 # Tautologies deleted: 4
% 2.00/2.19 # Forward subsumed : 279
% 2.00/2.19 # Backward subsumed : 0
% 2.00/2.19 # -------- CPU Time ---------
% 2.00/2.19 # User time : 1.810 s
% 2.00/2.19 # System time : 0.028 s
% 2.00/2.19 # Total time : 1.838 s
%------------------------------------------------------------------------------