TSTP Solution File: SET108+1 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : SET108+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n007.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:35:48 EDT 2022
% Result : Theorem 242.91s 243.15s
% Output : Refutation 242.91s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET108+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.11/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.12/0.34 % Computer : n007.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 11 09:25:47 EDT 2022
% 0.12/0.34 % CPUTime :
% 242.91/243.15 # Version: 1.3
% 242.91/243.15 # SZS status Theorem
% 242.91/243.15 # SZS output start CNFRefutation
% 242.91/243.15 cnf(reflexivity,axiom,X145=X145,eq_axiom).
% 242.91/243.15 fof(existence_of_first_and_second,conjecture,(![X]:(?[U]:(?[V]:(((member(U,universal_class)&member(V,universal_class))&X=ordered_pair(U,V))|(((~(?[Y]:(?[Z]:((member(Y,universal_class)&member(Z,universal_class))&X=ordered_pair(Y,Z)))))&U=X)&V=X))))),input).
% 242.91/243.15 fof(c26,negated_conjecture,(~(![X]:(?[U]:(?[V]:(((member(U,universal_class)&member(V,universal_class))&X=ordered_pair(U,V))|(((~(?[Y]:(?[Z]:((member(Y,universal_class)&member(Z,universal_class))&X=ordered_pair(Y,Z)))))&U=X)&V=X)))))),inference(assume_negation,status(cth),[existence_of_first_and_second])).
% 242.91/243.15 fof(c27,negated_conjecture,(?[X]:(![U]:(![V]:(((~member(U,universal_class)|~member(V,universal_class))|X!=ordered_pair(U,V))&(((?[Y]:(?[Z]:((member(Y,universal_class)&member(Z,universal_class))&X=ordered_pair(Y,Z))))|U!=X)|V!=X))))),inference(fof_nnf,status(thm),[c26])).
% 242.91/243.15 fof(c28,negated_conjecture,(?[X]:((![U]:(![V]:((~member(U,universal_class)|~member(V,universal_class))|X!=ordered_pair(U,V))))&(((?[Y]:(?[Z]:((member(Y,universal_class)&member(Z,universal_class))&X=ordered_pair(Y,Z))))|(![U]:U!=X))|(![V]:V!=X)))),inference(shift_quantors,status(thm),[c27])).
% 242.91/243.15 fof(c29,negated_conjecture,(?[X2]:((![X3]:(![X4]:((~member(X3,universal_class)|~member(X4,universal_class))|X2!=ordered_pair(X3,X4))))&(((?[X5]:(?[X6]:((member(X5,universal_class)&member(X6,universal_class))&X2=ordered_pair(X5,X6))))|(![X7]:X7!=X2))|(![X8]:X8!=X2)))),inference(variable_rename,status(thm),[c28])).
% 242.91/243.15 fof(c31,negated_conjecture,(![X3]:(![X4]:(![X7]:(![X8]:(((~member(X3,universal_class)|~member(X4,universal_class))|skolem0001!=ordered_pair(X3,X4))&((((member(skolem0002,universal_class)&member(skolem0003,universal_class))&skolem0001=ordered_pair(skolem0002,skolem0003))|X7!=skolem0001)|X8!=skolem0001)))))),inference(shift_quantors,status(thm),[fof(c30,negated_conjecture,((![X3]:(![X4]:((~member(X3,universal_class)|~member(X4,universal_class))|skolem0001!=ordered_pair(X3,X4))))&((((member(skolem0002,universal_class)&member(skolem0003,universal_class))&skolem0001=ordered_pair(skolem0002,skolem0003))|(![X7]:X7!=skolem0001))|(![X8]:X8!=skolem0001))),inference(skolemize,status(esa),[c29])).])).
% 242.91/243.15 fof(c32,negated_conjecture,(![X3]:(![X4]:(![X7]:(![X8]:(((~member(X3,universal_class)|~member(X4,universal_class))|skolem0001!=ordered_pair(X3,X4))&((((member(skolem0002,universal_class)|X7!=skolem0001)|X8!=skolem0001)&((member(skolem0003,universal_class)|X7!=skolem0001)|X8!=skolem0001))&((skolem0001=ordered_pair(skolem0002,skolem0003)|X7!=skolem0001)|X8!=skolem0001))))))),inference(distribute,status(thm),[c31])).
% 242.91/243.15 cnf(c34,negated_conjecture,member(skolem0002,universal_class)|X369!=skolem0001|X368!=skolem0001,inference(split_conjunct,status(thm),[c32])).
% 242.91/243.15 cnf(c847,plain,member(skolem0002,universal_class)|X370!=skolem0001,inference(resolution,status(thm),[c34, reflexivity])).
% 242.91/243.15 cnf(c850,plain,member(skolem0002,universal_class),inference(resolution,status(thm),[c847, reflexivity])).
% 242.91/243.15 cnf(c35,negated_conjecture,member(skolem0003,universal_class)|X373!=skolem0001|X372!=skolem0001,inference(split_conjunct,status(thm),[c32])).
% 242.91/243.15 cnf(c875,plain,member(skolem0003,universal_class)|X385!=skolem0001,inference(resolution,status(thm),[c35, reflexivity])).
% 242.91/243.15 cnf(c953,plain,member(skolem0003,universal_class),inference(resolution,status(thm),[c875, reflexivity])).
% 242.91/243.15 cnf(c33,negated_conjecture,~member(X364,universal_class)|~member(X365,universal_class)|skolem0001!=ordered_pair(X364,X365),inference(split_conjunct,status(thm),[c32])).
% 242.91/243.15 cnf(c36,negated_conjecture,skolem0001=ordered_pair(skolem0002,skolem0003)|X379!=skolem0001|X378!=skolem0001,inference(split_conjunct,status(thm),[c32])).
% 242.91/243.15 cnf(c885,plain,skolem0001=ordered_pair(skolem0002,skolem0003)|X3008!=skolem0001,inference(resolution,status(thm),[c36, reflexivity])).
% 242.91/243.15 cnf(c56151,plain,skolem0001=ordered_pair(skolem0002,skolem0003),inference(resolution,status(thm),[c885, reflexivity])).
% 242.91/243.15 cnf(c60439,plain,~member(skolem0002,universal_class)|~member(skolem0003,universal_class),inference(resolution,status(thm),[c56151, c33])).
% 242.91/243.15 cnf(c148524,plain,~member(skolem0002,universal_class),inference(resolution,status(thm),[c60439, c953])).
% 242.91/243.15 cnf(c148526,plain,$false,inference(resolution,status(thm),[c148524, c850])).
% 242.91/243.15 # SZS output end CNFRefutation
% 242.91/243.15
% 242.91/243.15 # Initial clauses : 122
% 242.91/243.15 # Processed clauses : 3103
% 242.91/243.15 # Factors computed : 9
% 242.91/243.15 # Resolvents computed: 148427
% 242.91/243.15 # Tautologies deleted: 30
% 242.91/243.15 # Forward subsumed : 5675
% 242.91/243.15 # Backward subsumed : 215
% 242.91/243.15 # -------- CPU Time ---------
% 242.91/243.15 # User time : 242.453 s
% 242.91/243.15 # System time : 0.304 s
% 242.91/243.15 # Total time : 242.757 s
%------------------------------------------------------------------------------