TSTP Solution File: SET020+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET020+1 : TPTP v5.3.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : hopewell.cs.miami.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Core(TM)2 CPU 6600 @ 2.40GHz @ 2400MHz
% Memory : 1003MB
% OS : Linux 2.6.32.26-175.fc12.x86_64
% CPULimit : 300s
% DateTime : Fri Jun 15 11:04:30 EDT 2012
% Result : Theorem 0.35s
% Output : Solution 0.35s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP9681/SET020+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP9681/SET020+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9681/SET020+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.5/eproof_ram --print-statistics -xAuto -tAuto --cpu-limit=60 --memory-limit=Auto --tstp-format /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 9780
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Auto-Ordering is analysing problem.
% # Problem is type GHSMNFFMM21MD
% # Auto-mode selected ordering type KBO6
% # Auto-mode selected ordering precedence scheme <invfreqconjmax>
% # Auto-mode selected weight ordering scheme <invfreqrank>
% #
% # Auto-Heuristic is analysing problem.
% # Problem is type GHSMNFFMM21MD
% # Auto-Mode selected heuristic G_E___107_C45_F1_PI_AE_Q4_CS_SP_S0Y
% # and selection function SelectMaxLComplexAvoidPosPred.
% #
% # Initializing proof state
% # Scanning for AC axioms
% # Proof found!
% # SZS status Theorem
% # Parsed axioms : 44
% # Removed by relevancy pruning : 0
% # Initial clauses : 93
% # Removed in clause preprocessing : 8
% # Initial clauses in saturation : 85
% # Processed clauses : 89
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 88
% # Other redundant clauses eliminated : 5
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 237
% # ...of the previous two non-trivial : 217
% # Contextual simplify-reflections : 0
% # Paramodulations : 230
% # Factorizations : 0
% # Equation resolutions : 7
% # Current number of processed clauses: 83
% # Positive orientable unit clauses: 16
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 66
% # Current number of unprocessed clauses: 213
% # ...number of literals in the above : 560
% # Clause-clause subsumption calls (NU) : 810
% # Rec. Clause-clause subsumption calls : 725
% # Non-unit clause-clause subsumptions: 0
% # Unit Clause-clause subsumption calls : 21
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 1
% # BW rewrite match successes : 1
% # Backwards rewriting index : 707 nodes, 123 leaves, 1.74+/-1.550 terms/leaf
% # Paramod-from index : 239 nodes, 40 leaves, 1.02+/-0.156 terms/leaf
% # Paramod-into index : 558 nodes, 94 leaves, 1.60+/-1.475 terms/leaf
% # Paramod-neg-atom index : 134 nodes, 25 leaves, 1.32+/-0.466 terms/leaf
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:((member(X1,universal_class)&member(X2,universal_class))=>(first(ordered_pair(X1,X2))=X1&second(ordered_pair(X1,X2))=X2)),file('/tmp/SRASS.s.p', first_second)).
% fof(14, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))),file('/tmp/SRASS.s.p', ordered_pair_defn)).
% fof(25, axiom,![X1]:singleton(X1)=unordered_pair(X1,X1),file('/tmp/SRASS.s.p', singleton_set_defn)).
% fof(44, conjecture,![X4]:![X5]:![X1]:(((member(X4,universal_class)&member(X5,universal_class))&X1=ordered_pair(X4,X5))=>(first(X1)=X4&second(X1)=X5)),file('/tmp/SRASS.s.p', unique_1st_and_2nd_in_pair_of_sets1)).
% fof(45, negated_conjecture,~(![X4]:![X5]:![X1]:(((member(X4,universal_class)&member(X5,universal_class))&X1=ordered_pair(X4,X5))=>(first(X1)=X4&second(X1)=X5))),inference(assume_negation,[status(cth)],[44])).
% fof(48, plain,![X1]:![X2]:((~(member(X1,universal_class))|~(member(X2,universal_class)))|(first(ordered_pair(X1,X2))=X1&second(ordered_pair(X1,X2))=X2)),inference(fof_nnf,[status(thm)],[1])).
% fof(49, plain,![X3]:![X4]:((~(member(X3,universal_class))|~(member(X4,universal_class)))|(first(ordered_pair(X3,X4))=X3&second(ordered_pair(X3,X4))=X4)),inference(variable_rename,[status(thm)],[48])).
% fof(50, plain,![X3]:![X4]:((first(ordered_pair(X3,X4))=X3|(~(member(X3,universal_class))|~(member(X4,universal_class))))&(second(ordered_pair(X3,X4))=X4|(~(member(X3,universal_class))|~(member(X4,universal_class))))),inference(distribute,[status(thm)],[49])).
% cnf(51,plain,(second(ordered_pair(X2,X1))=X1|~member(X1,universal_class)|~member(X2,universal_class)),inference(split_conjunct,[status(thm)],[50])).
% cnf(52,plain,(first(ordered_pair(X2,X1))=X2|~member(X1,universal_class)|~member(X2,universal_class)),inference(split_conjunct,[status(thm)],[50])).
% fof(143, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(singleton(X3),unordered_pair(X3,singleton(X4))),inference(variable_rename,[status(thm)],[14])).
% cnf(144,plain,(ordered_pair(X1,X2)=unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2)))),inference(split_conjunct,[status(thm)],[143])).
% fof(195, plain,![X2]:singleton(X2)=unordered_pair(X2,X2),inference(variable_rename,[status(thm)],[25])).
% cnf(196,plain,(singleton(X1)=unordered_pair(X1,X1)),inference(split_conjunct,[status(thm)],[195])).
% fof(273, negated_conjecture,?[X4]:?[X5]:?[X1]:(((member(X4,universal_class)&member(X5,universal_class))&X1=ordered_pair(X4,X5))&(~(first(X1)=X4)|~(second(X1)=X5))),inference(fof_nnf,[status(thm)],[45])).
% fof(274, negated_conjecture,?[X6]:?[X7]:?[X8]:(((member(X6,universal_class)&member(X7,universal_class))&X8=ordered_pair(X6,X7))&(~(first(X8)=X6)|~(second(X8)=X7))),inference(variable_rename,[status(thm)],[273])).
% fof(275, negated_conjecture,(((member(esk8_0,universal_class)&member(esk9_0,universal_class))&esk10_0=ordered_pair(esk8_0,esk9_0))&(~(first(esk10_0)=esk8_0)|~(second(esk10_0)=esk9_0))),inference(skolemize,[status(esa)],[274])).
% cnf(276,negated_conjecture,(second(esk10_0)!=esk9_0|first(esk10_0)!=esk8_0),inference(split_conjunct,[status(thm)],[275])).
% cnf(277,negated_conjecture,(esk10_0=ordered_pair(esk8_0,esk9_0)),inference(split_conjunct,[status(thm)],[275])).
% cnf(278,negated_conjecture,(member(esk9_0,universal_class)),inference(split_conjunct,[status(thm)],[275])).
% cnf(279,negated_conjecture,(member(esk8_0,universal_class)),inference(split_conjunct,[status(thm)],[275])).
% cnf(282,plain,(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2)))=ordered_pair(X1,X2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[144,196,theory(equality)]),196,theory(equality)]),['unfolding']).
% cnf(308,negated_conjecture,(unordered_pair(unordered_pair(esk8_0,esk8_0),unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0)))=esk10_0),inference(rw,[status(thm)],[277,282,theory(equality)]),['unfolding']).
% cnf(325,plain,(first(unordered_pair(unordered_pair(X2,X2),unordered_pair(X2,unordered_pair(X1,X1))))=X2|~member(X2,universal_class)|~member(X1,universal_class)),inference(rw,[status(thm)],[52,282,theory(equality)]),['unfolding']).
% cnf(326,plain,(second(unordered_pair(unordered_pair(X2,X2),unordered_pair(X2,unordered_pair(X1,X1))))=X1|~member(X2,universal_class)|~member(X1,universal_class)),inference(rw,[status(thm)],[51,282,theory(equality)]),['unfolding']).
% cnf(449,negated_conjecture,(first(esk10_0)=esk8_0|~member(esk8_0,universal_class)|~member(esk9_0,universal_class)),inference(spm,[status(thm)],[325,308,theory(equality)])).
% cnf(450,negated_conjecture,(first(esk10_0)=esk8_0|$false|~member(esk9_0,universal_class)),inference(rw,[status(thm)],[449,279,theory(equality)])).
% cnf(451,negated_conjecture,(first(esk10_0)=esk8_0|$false|$false),inference(rw,[status(thm)],[450,278,theory(equality)])).
% cnf(452,negated_conjecture,(first(esk10_0)=esk8_0),inference(cn,[status(thm)],[451,theory(equality)])).
% cnf(454,negated_conjecture,(second(esk10_0)=esk9_0|~member(esk8_0,universal_class)|~member(esk9_0,universal_class)),inference(spm,[status(thm)],[326,308,theory(equality)])).
% cnf(455,negated_conjecture,(second(esk10_0)=esk9_0|$false|~member(esk9_0,universal_class)),inference(rw,[status(thm)],[454,279,theory(equality)])).
% cnf(456,negated_conjecture,(second(esk10_0)=esk9_0|$false|$false),inference(rw,[status(thm)],[455,278,theory(equality)])).
% cnf(457,negated_conjecture,(second(esk10_0)=esk9_0),inference(cn,[status(thm)],[456,theory(equality)])).
% cnf(593,negated_conjecture,($false|second(esk10_0)!=esk9_0),inference(rw,[status(thm)],[276,452,theory(equality)])).
% cnf(594,negated_conjecture,(second(esk10_0)!=esk9_0),inference(cn,[status(thm)],[593,theory(equality)])).
% cnf(595,negated_conjecture,($false),inference(rw,[status(thm)],[594,457,theory(equality)])).
% cnf(596,negated_conjecture,($false),inference(cn,[status(thm)],[595,theory(equality)])).
% cnf(597,negated_conjecture,($false),596,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.03 CPU 0.07 WC
% FINAL PrfWatch: 0.03 CPU 0.07 WC
% SZS output end Solution for /tmp/SystemOnTPTP9681/SET020+1.tptp
%
%------------------------------------------------------------------------------