TSTP Solution File: SET907+1 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : SET907+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n003.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:13 EDT 2022
% Result : Theorem 1.40s 1.56s
% Output : Refutation 1.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET907+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.12/0.32 % Computer : n003.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jul 9 21:48:14 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.40/1.56 # Version: 1.3
% 1.40/1.56 # SZS status Theorem
% 1.40/1.56 # SZS output start CNFRefutation
% 1.40/1.56 fof(t48_zfmisc_1,conjecture,(![A]:(![B]:(![C]:((in(A,B)&in(C,B))=>set_union2(unordered_pair(A,C),B)=B)))),input).
% 1.40/1.56 fof(c5,negated_conjecture,(~(![A]:(![B]:(![C]:((in(A,B)&in(C,B))=>set_union2(unordered_pair(A,C),B)=B))))),inference(assume_negation,status(cth),[t48_zfmisc_1])).
% 1.40/1.56 fof(c6,negated_conjecture,(?[A]:(?[B]:(?[C]:((in(A,B)&in(C,B))&set_union2(unordered_pair(A,C),B)!=B)))),inference(fof_nnf,status(thm),[c5])).
% 1.40/1.56 fof(c7,negated_conjecture,(?[X2]:(?[X3]:(?[X4]:((in(X2,X3)&in(X4,X3))&set_union2(unordered_pair(X2,X4),X3)!=X3)))),inference(variable_rename,status(thm),[c6])).
% 1.40/1.56 fof(c8,negated_conjecture,((in(skolem0001,skolem0002)&in(skolem0003,skolem0002))&set_union2(unordered_pair(skolem0001,skolem0003),skolem0002)!=skolem0002),inference(skolemize,status(esa),[c7])).
% 1.40/1.56 cnf(c11,negated_conjecture,set_union2(unordered_pair(skolem0001,skolem0003),skolem0002)!=skolem0002,inference(split_conjunct,status(thm),[c8])).
% 1.40/1.56 fof(t12_xboole_1,axiom,(![A]:(![B]:(subset(A,B)=>set_union2(A,B)=B))),input).
% 1.40/1.56 fof(c20,axiom,(![A]:(![B]:(~subset(A,B)|set_union2(A,B)=B))),inference(fof_nnf,status(thm),[t12_xboole_1])).
% 1.40/1.56 fof(c21,axiom,(![X11]:(![X12]:(~subset(X11,X12)|set_union2(X11,X12)=X12))),inference(variable_rename,status(thm),[c20])).
% 1.40/1.56 cnf(c22,axiom,~subset(X89,X90)|set_union2(X89,X90)=X90,inference(split_conjunct,status(thm),[c21])).
% 1.40/1.56 cnf(c9,negated_conjecture,in(skolem0001,skolem0002),inference(split_conjunct,status(thm),[c8])).
% 1.40/1.56 cnf(c10,negated_conjecture,in(skolem0003,skolem0002),inference(split_conjunct,status(thm),[c8])).
% 1.40/1.56 fof(t38_zfmisc_1,axiom,(![A]:(![B]:(![C]:(subset(unordered_pair(A,B),C)<=>(in(A,C)&in(B,C)))))),input).
% 1.40/1.56 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])).
% 1.40/1.56 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])).
% 1.40/1.56 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])).])).
% 1.40/1.56 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])).
% 1.40/1.56 cnf(c19,axiom,~in(X99,X100)|~in(X101,X100)|subset(unordered_pair(X99,X101),X100),inference(split_conjunct,status(thm),[c16])).
% 1.40/1.56 cnf(c107,plain,~in(X302,skolem0002)|subset(unordered_pair(X302,skolem0003),skolem0002),inference(resolution,status(thm),[c19, c10])).
% 1.40/1.56 cnf(c726,plain,subset(unordered_pair(skolem0001,skolem0003),skolem0002),inference(resolution,status(thm),[c107, c9])).
% 1.40/1.56 cnf(c732,plain,set_union2(unordered_pair(skolem0001,skolem0003),skolem0002)=skolem0002,inference(resolution,status(thm),[c726, c22])).
% 1.40/1.56 cnf(c4309,plain,$false,inference(resolution,status(thm),[c732, c11])).
% 1.40/1.56 # SZS output end CNFRefutation
% 1.40/1.56
% 1.40/1.56 # Initial clauses : 24
% 1.40/1.56 # Processed clauses : 292
% 1.40/1.56 # Factors computed : 0
% 1.40/1.56 # Resolvents computed: 4364
% 1.40/1.56 # Tautologies deleted: 2
% 1.40/1.56 # Forward subsumed : 366
% 1.40/1.56 # Backward subsumed : 6
% 1.40/1.56 # -------- CPU Time ---------
% 1.40/1.56 # User time : 1.207 s
% 1.40/1.56 # System time : 0.020 s
% 1.40/1.56 # Total time : 1.227 s
%------------------------------------------------------------------------------