TSTP Solution File: SET102+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET102+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 : wilderness.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:08:27 EDT 2012
% Result : Theorem 0.33s
% Output : Solution 0.33s
% 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/SystemOnTPTP4039/SET102+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP4039/SET102+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4039/SET102+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 4137
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Auto-Ordering is analysing problem.
% # Problem is type GHSMNFFMS21MD
% # Auto-mode selected ordering type KBO6
% # Auto-mode selected ordering precedence scheme <invfreq>
% # Auto-mode selected weight ordering scheme <invfreqrank>
% #
% # Auto-Heuristic is analysing problem.
% # Problem is type GHSMNFFMS21MD
% # Auto-Mode selected heuristic G_E___103_C18_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 : 90
% # Removed in clause preprocessing : 8
% # Initial clauses in saturation : 82
% # Processed clauses : 102
% # ...of these trivial : 3
% # ...subsumed : 7
% # ...remaining for further processing: 92
% # Other redundant clauses eliminated : 5
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 0
% # Generated clauses : 240
% # ...of the previous two non-trivial : 212
% # Contextual simplify-reflections : 1
% # Paramodulations : 233
% # Factorizations : 0
% # Equation resolutions : 7
% # Current number of processed clauses: 84
% # Positive orientable unit clauses: 15
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 66
% # Current number of unprocessed clauses: 167
% # ...number of literals in the above : 461
% # Clause-clause subsumption calls (NU) : 897
% # Rec. Clause-clause subsumption calls : 834
% # Non-unit clause-clause subsumptions: 9
% # Unit Clause-clause subsumption calls : 201
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 13
% # BW rewrite match successes : 0
% # Backwards rewriting index : 716 nodes, 126 leaves, 1.73+/-1.571 terms/leaf
% # Paramod-from index : 239 nodes, 40 leaves, 1.02+/-0.156 terms/leaf
% # Paramod-into index : 555 nodes, 94 leaves, 1.61+/-1.510 terms/leaf
% # Paramod-neg-atom index : 153 nodes, 28 leaves, 1.32+/-0.467 terms/leaf
% # SZS output start CNFRefutation.
% fof(1, 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(2, axiom,![X1]:![X2]:member(unordered_pair(X1,X2),universal_class),file('/tmp/SRASS.s.p', unordered_pair)).
% fof(3, axiom,![X1]:singleton(X1)=unordered_pair(X1,X1),file('/tmp/SRASS.s.p', singleton_set_defn)).
% fof(5, axiom,![X3]:![X1]:![X2]:(member(X3,unordered_pair(X1,X2))<=>(member(X3,universal_class)&(X3=X1|X3=X2))),file('/tmp/SRASS.s.p', unordered_pair_defn)).
% fof(44, conjecture,![X1]:![X2]:member(unordered_pair(X1,singleton(X2)),ordered_pair(X1,X2)),file('/tmp/SRASS.s.p', unordered_pair_member_of_ordered_pair)).
% fof(45, negated_conjecture,~(![X1]:![X2]:member(unordered_pair(X1,singleton(X2)),ordered_pair(X1,X2))),inference(assume_negation,[status(cth)],[44])).
% fof(48, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(singleton(X3),unordered_pair(X3,singleton(X4))),inference(variable_rename,[status(thm)],[1])).
% cnf(49,plain,(ordered_pair(X1,X2)=unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2)))),inference(split_conjunct,[status(thm)],[48])).
% fof(50, plain,![X3]:![X4]:member(unordered_pair(X3,X4),universal_class),inference(variable_rename,[status(thm)],[2])).
% cnf(51,plain,(member(unordered_pair(X1,X2),universal_class)),inference(split_conjunct,[status(thm)],[50])).
% fof(52, plain,![X2]:singleton(X2)=unordered_pair(X2,X2),inference(variable_rename,[status(thm)],[3])).
% cnf(53,plain,(singleton(X1)=unordered_pair(X1,X1)),inference(split_conjunct,[status(thm)],[52])).
% fof(62, plain,![X3]:![X1]:![X2]:((~(member(X3,unordered_pair(X1,X2)))|(member(X3,universal_class)&(X3=X1|X3=X2)))&((~(member(X3,universal_class))|(~(X3=X1)&~(X3=X2)))|member(X3,unordered_pair(X1,X2)))),inference(fof_nnf,[status(thm)],[5])).
% fof(63, plain,(![X3]:![X1]:![X2]:(~(member(X3,unordered_pair(X1,X2)))|(member(X3,universal_class)&(X3=X1|X3=X2)))&![X3]:![X1]:![X2]:((~(member(X3,universal_class))|(~(X3=X1)&~(X3=X2)))|member(X3,unordered_pair(X1,X2)))),inference(shift_quantors,[status(thm)],[62])).
% fof(64, plain,(![X4]:![X5]:![X6]:(~(member(X4,unordered_pair(X5,X6)))|(member(X4,universal_class)&(X4=X5|X4=X6)))&![X7]:![X8]:![X9]:((~(member(X7,universal_class))|(~(X7=X8)&~(X7=X9)))|member(X7,unordered_pair(X8,X9)))),inference(variable_rename,[status(thm)],[63])).
% fof(65, plain,![X4]:![X5]:![X6]:![X7]:![X8]:![X9]:((~(member(X4,unordered_pair(X5,X6)))|(member(X4,universal_class)&(X4=X5|X4=X6)))&((~(member(X7,universal_class))|(~(X7=X8)&~(X7=X9)))|member(X7,unordered_pair(X8,X9)))),inference(shift_quantors,[status(thm)],[64])).
% fof(66, plain,![X4]:![X5]:![X6]:![X7]:![X8]:![X9]:(((member(X4,universal_class)|~(member(X4,unordered_pair(X5,X6))))&((X4=X5|X4=X6)|~(member(X4,unordered_pair(X5,X6)))))&(((~(X7=X8)|~(member(X7,universal_class)))|member(X7,unordered_pair(X8,X9)))&((~(X7=X9)|~(member(X7,universal_class)))|member(X7,unordered_pair(X8,X9))))),inference(distribute,[status(thm)],[65])).
% cnf(67,plain,(member(X1,unordered_pair(X2,X3))|~member(X1,universal_class)|X1!=X3),inference(split_conjunct,[status(thm)],[66])).
% fof(273, negated_conjecture,?[X1]:?[X2]:~(member(unordered_pair(X1,singleton(X2)),ordered_pair(X1,X2))),inference(fof_nnf,[status(thm)],[45])).
% fof(274, negated_conjecture,?[X3]:?[X4]:~(member(unordered_pair(X3,singleton(X4)),ordered_pair(X3,X4))),inference(variable_rename,[status(thm)],[273])).
% fof(275, negated_conjecture,~(member(unordered_pair(esk8_0,singleton(esk9_0)),ordered_pair(esk8_0,esk9_0))),inference(skolemize,[status(esa)],[274])).
% cnf(276,negated_conjecture,(~member(unordered_pair(esk8_0,singleton(esk9_0)),ordered_pair(esk8_0,esk9_0))),inference(split_conjunct,[status(thm)],[275])).
% cnf(279,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)],[49,53,theory(equality)]),53,theory(equality)]),['unfolding']).
% cnf(283,negated_conjecture,(~member(unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0)),ordered_pair(esk8_0,esk9_0))),inference(rw,[status(thm)],[276,53,theory(equality)]),['unfolding']).
% cnf(330,negated_conjecture,(~member(unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0)),unordered_pair(unordered_pair(esk8_0,esk8_0),unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0))))),inference(rw,[status(thm)],[283,279,theory(equality)]),['unfolding']).
% cnf(336,plain,(member(X1,unordered_pair(X2,X1))|~member(X1,universal_class)),inference(er,[status(thm)],[67,theory(equality)])).
% cnf(586,negated_conjecture,(~member(unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0)),universal_class)),inference(spm,[status(thm)],[330,336,theory(equality)])).
% cnf(592,negated_conjecture,($false),inference(rw,[status(thm)],[586,51,theory(equality)])).
% cnf(593,negated_conjecture,($false),inference(cn,[status(thm)],[592,theory(equality)])).
% cnf(594,negated_conjecture,($false),593,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.03 CPU 0.06 WC
% FINAL PrfWatch: 0.03 CPU 0.06 WC
% SZS output end Solution for /tmp/SystemOnTPTP4039/SET102+1.tptp
%
%------------------------------------------------------------------------------