TSTP Solution File: SET928+1 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : SET928+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n026.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:25 EDT 2022
% Result : Theorem 123.49s 123.71s
% Output : Refutation 123.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET928+1 : TPTP v8.1.0. Released v3.2.0.
% 0.00/0.12 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % 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 : Sun Jul 10 19:01:11 EDT 2022
% 0.12/0.33 % CPUTime :
% 123.49/123.71 # Version: 1.3
% 123.49/123.71 # SZS status Theorem
% 123.49/123.71 # SZS output start CNFRefutation
% 123.49/123.71 fof(t72_zfmisc_1,conjecture,(![A]:(![B]:(![C]:(set_difference(unordered_pair(A,B),C)=unordered_pair(A,B)<=>((~in(A,C))&(~in(B,C))))))),input).
% 123.49/123.71 fof(c11,negated_conjecture,(~(![A]:(![B]:(![C]:(set_difference(unordered_pair(A,B),C)=unordered_pair(A,B)<=>((~in(A,C))&(~in(B,C)))))))),inference(assume_negation,status(cth),[t72_zfmisc_1])).
% 123.49/123.71 fof(c12,negated_conjecture,(~(![A]:(![B]:(![C]:(set_difference(unordered_pair(A,B),C)=unordered_pair(A,B)<=>(~in(A,C)&~in(B,C))))))),inference(fof_simplification,status(thm),[c11])).
% 123.49/123.71 fof(c13,negated_conjecture,(?[A]:(?[B]:(?[C]:((set_difference(unordered_pair(A,B),C)!=unordered_pair(A,B)|(in(A,C)|in(B,C)))&(set_difference(unordered_pair(A,B),C)=unordered_pair(A,B)|(~in(A,C)&~in(B,C))))))),inference(fof_nnf,status(thm),[c12])).
% 123.49/123.71 fof(c14,negated_conjecture,(?[X6]:(?[X7]:(?[X8]:((set_difference(unordered_pair(X6,X7),X8)!=unordered_pair(X6,X7)|(in(X6,X8)|in(X7,X8)))&(set_difference(unordered_pair(X6,X7),X8)=unordered_pair(X6,X7)|(~in(X6,X8)&~in(X7,X8))))))),inference(variable_rename,status(thm),[c13])).
% 123.49/123.71 fof(c15,negated_conjecture,((set_difference(unordered_pair(skolem0001,skolem0002),skolem0003)!=unordered_pair(skolem0001,skolem0002)|(in(skolem0001,skolem0003)|in(skolem0002,skolem0003)))&(set_difference(unordered_pair(skolem0001,skolem0002),skolem0003)=unordered_pair(skolem0001,skolem0002)|(~in(skolem0001,skolem0003)&~in(skolem0002,skolem0003)))),inference(skolemize,status(esa),[c14])).
% 123.49/123.71 fof(c16,negated_conjecture,((set_difference(unordered_pair(skolem0001,skolem0002),skolem0003)!=unordered_pair(skolem0001,skolem0002)|(in(skolem0001,skolem0003)|in(skolem0002,skolem0003)))&((set_difference(unordered_pair(skolem0001,skolem0002),skolem0003)=unordered_pair(skolem0001,skolem0002)|~in(skolem0001,skolem0003))&(set_difference(unordered_pair(skolem0001,skolem0002),skolem0003)=unordered_pair(skolem0001,skolem0002)|~in(skolem0002,skolem0003)))),inference(distribute,status(thm),[c15])).
% 123.49/123.71 cnf(c17,negated_conjecture,set_difference(unordered_pair(skolem0001,skolem0002),skolem0003)!=unordered_pair(skolem0001,skolem0002)|in(skolem0001,skolem0003)|in(skolem0002,skolem0003),inference(split_conjunct,status(thm),[c16])).
% 123.49/123.71 fof(t83_xboole_1,axiom,(![A]:(![B]:(disjoint(A,B)<=>set_difference(A,B)=A))),input).
% 123.49/123.71 fof(c5,axiom,(![A]:(![B]:((~disjoint(A,B)|set_difference(A,B)=A)&(set_difference(A,B)!=A|disjoint(A,B))))),inference(fof_nnf,status(thm),[t83_xboole_1])).
% 123.49/123.71 fof(c6,axiom,((![A]:(![B]:(~disjoint(A,B)|set_difference(A,B)=A)))&(![A]:(![B]:(set_difference(A,B)!=A|disjoint(A,B))))),inference(shift_quantors,status(thm),[c5])).
% 123.49/123.71 fof(c8,axiom,(![X2]:(![X3]:(![X4]:(![X5]:((~disjoint(X2,X3)|set_difference(X2,X3)=X2)&(set_difference(X4,X5)!=X4|disjoint(X4,X5))))))),inference(shift_quantors,status(thm),[fof(c7,axiom,((![X2]:(![X3]:(~disjoint(X2,X3)|set_difference(X2,X3)=X2)))&(![X4]:(![X5]:(set_difference(X4,X5)!=X4|disjoint(X4,X5))))),inference(variable_rename,status(thm),[c6])).])).
% 123.49/123.71 cnf(c9,axiom,~disjoint(X47,X48)|set_difference(X47,X48)=X47,inference(split_conjunct,status(thm),[c8])).
% 123.49/123.71 fof(t57_zfmisc_1,axiom,(![A]:(![B]:(![C]:(~(((~in(A,B))&(~in(C,B)))&(~disjoint(unordered_pair(A,C),B))))))),input).
% 123.49/123.71 fof(c20,axiom,(![A]:(![B]:(![C]:(~((~in(A,B)&~in(C,B))&~disjoint(unordered_pair(A,C),B)))))),inference(fof_simplification,status(thm),[t57_zfmisc_1])).
% 123.49/123.71 fof(c21,axiom,(![A]:(![B]:(![C]:((in(A,B)|in(C,B))|disjoint(unordered_pair(A,C),B))))),inference(fof_nnf,status(thm),[c20])).
% 123.49/123.71 fof(c22,axiom,(![X9]:(![X10]:(![X11]:((in(X9,X10)|in(X11,X10))|disjoint(unordered_pair(X9,X11),X10))))),inference(variable_rename,status(thm),[c21])).
% 123.49/123.71 cnf(c23,axiom,in(X81,X83)|in(X82,X83)|disjoint(unordered_pair(X81,X82),X83),inference(split_conjunct,status(thm),[c22])).
% 123.49/123.71 cnf(c65,plain,in(X227,X226)|in(X225,X226)|set_difference(unordered_pair(X227,X225),X226)=unordered_pair(X227,X225),inference(resolution,status(thm),[c23, c9])).
% 123.49/123.71 cnf(c450,plain,in(skolem0001,skolem0003)|in(skolem0002,skolem0003),inference(resolution,status(thm),[c65, c17])).
% 123.49/123.71 fof(t55_zfmisc_1,axiom,(![A]:(![B]:(![C]:(~(disjoint(unordered_pair(A,B),C)&in(A,C)))))),input).
% 123.49/123.71 fof(c24,axiom,(![A]:(![B]:(![C]:(~disjoint(unordered_pair(A,B),C)|~in(A,C))))),inference(fof_nnf,status(thm),[t55_zfmisc_1])).
% 123.49/123.71 fof(c25,axiom,(![X12]:(![X13]:(![X14]:(~disjoint(unordered_pair(X12,X13),X14)|~in(X12,X14))))),inference(variable_rename,status(thm),[c24])).
% 123.49/123.71 cnf(c26,axiom,~disjoint(unordered_pair(X52,X51),X53)|~in(X52,X53),inference(split_conjunct,status(thm),[c25])).
% 123.49/123.71 cnf(c10,axiom,set_difference(X50,X49)!=X50|disjoint(X50,X49),inference(split_conjunct,status(thm),[c8])).
% 123.49/123.71 cnf(c18,negated_conjecture,set_difference(unordered_pair(skolem0001,skolem0002),skolem0003)=unordered_pair(skolem0001,skolem0002)|~in(skolem0001,skolem0003),inference(split_conjunct,status(thm),[c16])).
% 123.49/123.71 cnf(c460,plain,in(skolem0002,skolem0003)|set_difference(unordered_pair(skolem0001,skolem0002),skolem0003)=unordered_pair(skolem0001,skolem0002),inference(resolution,status(thm),[c450, c18])).
% 123.49/123.71 cnf(c36398,plain,in(skolem0002,skolem0003)|disjoint(unordered_pair(skolem0001,skolem0002),skolem0003),inference(resolution,status(thm),[c460, c10])).
% 123.49/123.71 cnf(c36491,plain,in(skolem0002,skolem0003)|~in(skolem0001,skolem0003),inference(resolution,status(thm),[c36398, c26])).
% 123.49/123.71 cnf(c36534,plain,in(skolem0002,skolem0003),inference(resolution,status(thm),[c36491, c450])).
% 123.49/123.71 cnf(reflexivity,axiom,X23=X23,eq_axiom).
% 123.49/123.71 fof(commutativity_k2_tarski,axiom,(![A]:(![B]:unordered_pair(A,B)=unordered_pair(B,A))),input).
% 123.49/123.71 fof(c37,axiom,(![X19]:(![X20]:unordered_pair(X19,X20)=unordered_pair(X20,X19))),inference(variable_rename,status(thm),[commutativity_k2_tarski])).
% 123.49/123.71 cnf(c38,axiom,unordered_pair(X43,X44)=unordered_pair(X44,X43),inference(split_conjunct,status(thm),[c37])).
% 123.49/123.71 cnf(c4,plain,X89!=X86|X87!=X88|~disjoint(X89,X87)|disjoint(X86,X88),eq_axiom).
% 123.49/123.71 cnf(c19,negated_conjecture,set_difference(unordered_pair(skolem0001,skolem0002),skolem0003)=unordered_pair(skolem0001,skolem0002)|~in(skolem0002,skolem0003),inference(split_conjunct,status(thm),[c16])).
% 123.49/123.71 cnf(c417,plain,in(X2716,skolem0003)|set_difference(unordered_pair(skolem0001,X2716),skolem0003)=unordered_pair(skolem0001,X2716)|set_difference(unordered_pair(skolem0001,skolem0002),skolem0003)=unordered_pair(skolem0001,skolem0002),inference(resolution,status(thm),[c65, c18])).
% 123.49/123.72 cnf(c25927,plain,set_difference(unordered_pair(skolem0001,skolem0002),skolem0003)=unordered_pair(skolem0001,skolem0002),inference(resolution,status(thm),[c417, c19])).
% 123.49/123.72 cnf(c103961,plain,disjoint(unordered_pair(skolem0001,skolem0002),skolem0003),inference(resolution,status(thm),[c25927, c10])).
% 123.49/123.72 cnf(c104002,plain,unordered_pair(skolem0001,skolem0002)!=X7532|skolem0003!=X7533|disjoint(X7532,X7533),inference(resolution,status(thm),[c103961, c4])).
% 123.49/123.72 cnf(c160399,plain,skolem0003!=X7535|disjoint(unordered_pair(skolem0002,skolem0001),X7535),inference(resolution,status(thm),[c104002, c38])).
% 123.49/123.72 cnf(c160459,plain,disjoint(unordered_pair(skolem0002,skolem0001),skolem0003),inference(resolution,status(thm),[c160399, reflexivity])).
% 123.49/123.72 cnf(c160495,plain,~in(skolem0002,skolem0003),inference(resolution,status(thm),[c160459, c26])).
% 123.49/123.72 cnf(c160675,plain,$false,inference(resolution,status(thm),[c160495, c36534])).
% 123.49/123.72 # SZS output end CNFRefutation
% 123.49/123.72
% 123.49/123.72 # Initial clauses : 20
% 123.49/123.72 # Processed clauses : 1457
% 123.49/123.72 # Factors computed : 144
% 123.49/123.72 # Resolvents computed: 160545
% 123.49/123.72 # Tautologies deleted: 19
% 123.49/123.72 # Forward subsumed : 2869
% 123.49/123.72 # Backward subsumed : 88
% 123.49/123.72 # -------- CPU Time ---------
% 123.49/123.72 # User time : 122.964 s
% 123.49/123.72 # System time : 0.375 s
% 123.49/123.72 # Total time : 123.339 s
%------------------------------------------------------------------------------