TSTP Solution File: SET912+1 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : SET912+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n021.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:41:16 EDT 2022
% Result : Theorem 19.02s 19.23s
% Output : Refutation 19.02s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET912+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jul 10 04:58:07 EDT 2022
% 0.13/0.35 % CPUTime :
% 19.02/19.23 # Version: 1.3
% 19.02/19.23 # SZS status Theorem
% 19.02/19.23 # SZS output start CNFRefutation
% 19.02/19.23 fof(t53_zfmisc_1,conjecture,(![A]:(![B]:(![C]:((in(A,B)&in(C,B))=>set_intersection2(unordered_pair(A,C),B)=unordered_pair(A,C))))),input).
% 19.02/19.23 fof(c5,negated_conjecture,(~(![A]:(![B]:(![C]:((in(A,B)&in(C,B))=>set_intersection2(unordered_pair(A,C),B)=unordered_pair(A,C)))))),inference(assume_negation,status(cth),[t53_zfmisc_1])).
% 19.02/19.23 fof(c6,negated_conjecture,(?[A]:(?[B]:(?[C]:((in(A,B)&in(C,B))&set_intersection2(unordered_pair(A,C),B)!=unordered_pair(A,C))))),inference(fof_nnf,status(thm),[c5])).
% 19.02/19.23 fof(c7,negated_conjecture,(?[X2]:(?[X3]:(?[X4]:((in(X2,X3)&in(X4,X3))&set_intersection2(unordered_pair(X2,X4),X3)!=unordered_pair(X2,X4))))),inference(variable_rename,status(thm),[c6])).
% 19.02/19.23 fof(c8,negated_conjecture,((in(skolem0001,skolem0002)&in(skolem0003,skolem0002))&set_intersection2(unordered_pair(skolem0001,skolem0003),skolem0002)!=unordered_pair(skolem0001,skolem0003)),inference(skolemize,status(esa),[c7])).
% 19.02/19.23 cnf(c11,negated_conjecture,set_intersection2(unordered_pair(skolem0001,skolem0003),skolem0002)!=unordered_pair(skolem0001,skolem0003),inference(split_conjunct,status(thm),[c8])).
% 19.02/19.23 fof(t28_xboole_1,axiom,(![A]:(![B]:(subset(A,B)=>set_intersection2(A,B)=A))),input).
% 19.02/19.23 fof(c20,axiom,(![A]:(![B]:(~subset(A,B)|set_intersection2(A,B)=A))),inference(fof_nnf,status(thm),[t28_xboole_1])).
% 19.02/19.23 fof(c21,axiom,(![X11]:(![X12]:(~subset(X11,X12)|set_intersection2(X11,X12)=X11))),inference(variable_rename,status(thm),[c20])).
% 19.02/19.23 cnf(c22,axiom,~subset(X82,X81)|set_intersection2(X82,X81)=X82,inference(split_conjunct,status(thm),[c21])).
% 19.02/19.23 cnf(c9,negated_conjecture,in(skolem0001,skolem0002),inference(split_conjunct,status(thm),[c8])).
% 19.02/19.23 cnf(c10,negated_conjecture,in(skolem0003,skolem0002),inference(split_conjunct,status(thm),[c8])).
% 19.02/19.23 fof(t38_zfmisc_1,axiom,(![A]:(![B]:(![C]:(subset(unordered_pair(A,B),C)<=>(in(A,C)&in(B,C)))))),input).
% 19.02/19.23 fof(c12,axiom,(![A]:(![B]:(![C]:((~subset(unordered_pair(A,B),C)|(in(A,C)&in(B,C)))&((~in(A,C)|~in(B,C))|subset(unordered_pair(A,B),C)))))),inference(fof_nnf,status(thm),[t38_zfmisc_1])).
% 19.02/19.23 fof(c13,axiom,((![A]:(![B]:(![C]:(~subset(unordered_pair(A,B),C)|(in(A,C)&in(B,C))))))&(![A]:(![B]:(![C]:((~in(A,C)|~in(B,C))|subset(unordered_pair(A,B),C)))))),inference(shift_quantors,status(thm),[c12])).
% 19.02/19.23 fof(c15,axiom,(![X5]:(![X6]:(![X7]:(![X8]:(![X9]:(![X10]:((~subset(unordered_pair(X5,X6),X7)|(in(X5,X7)&in(X6,X7)))&((~in(X8,X10)|~in(X9,X10))|subset(unordered_pair(X8,X9),X10))))))))),inference(shift_quantors,status(thm),[fof(c14,axiom,((![X5]:(![X6]:(![X7]:(~subset(unordered_pair(X5,X6),X7)|(in(X5,X7)&in(X6,X7))))))&(![X8]:(![X9]:(![X10]:((~in(X8,X10)|~in(X9,X10))|subset(unordered_pair(X8,X9),X10)))))),inference(variable_rename,status(thm),[c13])).])).
% 19.02/19.23 fof(c16,axiom,(![X5]:(![X6]:(![X7]:(![X8]:(![X9]:(![X10]:(((~subset(unordered_pair(X5,X6),X7)|in(X5,X7))&(~subset(unordered_pair(X5,X6),X7)|in(X6,X7)))&((~in(X8,X10)|~in(X9,X10))|subset(unordered_pair(X8,X9),X10))))))))),inference(distribute,status(thm),[c15])).
% 19.02/19.23 cnf(c19,axiom,~in(X96,X97)|~in(X95,X97)|subset(unordered_pair(X96,X95),X97),inference(split_conjunct,status(thm),[c16])).
% 19.02/19.23 cnf(c97,plain,~in(X313,skolem0002)|subset(unordered_pair(X313,skolem0003),skolem0002),inference(resolution,status(thm),[c19, c10])).
% 19.02/19.23 cnf(c752,plain,subset(unordered_pair(skolem0001,skolem0003),skolem0002),inference(resolution,status(thm),[c97, c9])).
% 19.02/19.23 cnf(c760,plain,set_intersection2(unordered_pair(skolem0001,skolem0003),skolem0002)=unordered_pair(skolem0001,skolem0003),inference(resolution,status(thm),[c752, c22])).
% 19.02/19.23 cnf(c38733,plain,$false,inference(resolution,status(thm),[c760, c11])).
% 19.02/19.23 # SZS output end CNFRefutation
% 19.02/19.23
% 19.02/19.23 # Initial clauses : 22
% 19.02/19.23 # Processed clauses : 1011
% 19.02/19.23 # Factors computed : 0
% 19.02/19.23 # Resolvents computed: 38758
% 19.02/19.23 # Tautologies deleted: 2
% 19.02/19.23 # Forward subsumed : 1675
% 19.02/19.23 # Backward subsumed : 49
% 19.02/19.23 # -------- CPU Time ---------
% 19.02/19.23 # User time : 18.745 s
% 19.02/19.23 # System time : 0.115 s
% 19.02/19.23 # Total time : 18.860 s
%------------------------------------------------------------------------------