TSTP Solution File: SET086+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET086+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 : nashville.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:07: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/SystemOnTPTP28076/SET086+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP28076/SET086+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28076/SET086+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 28174
% 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 : 92
% # Removed in clause preprocessing : 8
% # Initial clauses in saturation : 84
% # Processed clauses : 87
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 87
% # Other redundant clauses eliminated : 5
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 276
% # ...of the previous two non-trivial : 258
% # Contextual simplify-reflections : 0
% # Paramodulations : 267
% # Factorizations : 0
% # Equation resolutions : 9
% # Current number of processed clauses: 81
% # Positive orientable unit clauses: 12
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 68
% # Current number of unprocessed clauses: 255
% # ...number of literals in the above : 656
% # Clause-clause subsumption calls (NU) : 872
% # Rec. Clause-clause subsumption calls : 796
% # Non-unit clause-clause subsumptions: 0
% # Unit Clause-clause subsumption calls : 84
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 2
% # BW rewrite match successes : 2
% # Backwards rewriting index : 666 nodes, 116 leaves, 1.78+/-1.586 terms/leaf
% # Paramod-from index : 217 nodes, 36 leaves, 1.03+/-0.164 terms/leaf
% # Paramod-into index : 512 nodes, 86 leaves, 1.65+/-1.531 terms/leaf
% # Paramod-neg-atom index : 144 nodes, 27 leaves, 1.30+/-0.457 terms/leaf
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:singleton(X1)=unordered_pair(X1,X1),file('/tmp/SRASS.s.p', singleton_set_defn)).
% fof(44, conjecture,![X1]:?[X2]:((member(X2,universal_class)&X1=singleton(X2))|(~(?[X3]:(member(X3,universal_class)&X1=singleton(X3)))&X2=X1)),file('/tmp/SRASS.s.p', member_of_substitution)).
% fof(45, negated_conjecture,~(![X1]:?[X2]:((member(X2,universal_class)&X1=singleton(X2))|(~(?[X3]:(member(X3,universal_class)&X1=singleton(X3)))&X2=X1))),inference(assume_negation,[status(cth)],[44])).
% fof(48, plain,![X2]:singleton(X2)=unordered_pair(X2,X2),inference(variable_rename,[status(thm)],[1])).
% cnf(49,plain,(singleton(X1)=unordered_pair(X1,X1)),inference(split_conjunct,[status(thm)],[48])).
% fof(273, negated_conjecture,?[X1]:![X2]:((~(member(X2,universal_class))|~(X1=singleton(X2)))&(?[X3]:(member(X3,universal_class)&X1=singleton(X3))|~(X2=X1))),inference(fof_nnf,[status(thm)],[45])).
% fof(274, negated_conjecture,?[X1]:(![X2]:(~(member(X2,universal_class))|~(X1=singleton(X2)))&(?[X3]:(member(X3,universal_class)&X1=singleton(X3))|![X2]:~(X2=X1))),inference(shift_quantors,[status(thm)],[273])).
% fof(275, negated_conjecture,?[X4]:(![X5]:(~(member(X5,universal_class))|~(X4=singleton(X5)))&(?[X6]:(member(X6,universal_class)&X4=singleton(X6))|![X7]:~(X7=X4))),inference(variable_rename,[status(thm)],[274])).
% fof(276, negated_conjecture,(![X5]:(~(member(X5,universal_class))|~(esk8_0=singleton(X5)))&((member(esk9_0,universal_class)&esk8_0=singleton(esk9_0))|![X7]:~(X7=esk8_0))),inference(skolemize,[status(esa)],[275])).
% fof(277, negated_conjecture,![X5]:![X7]:((~(member(X5,universal_class))|~(esk8_0=singleton(X5)))&((member(esk9_0,universal_class)&esk8_0=singleton(esk9_0))|~(X7=esk8_0))),inference(shift_quantors,[status(thm)],[276])).
% fof(278, negated_conjecture,![X5]:![X7]:((~(member(X5,universal_class))|~(esk8_0=singleton(X5)))&((member(esk9_0,universal_class)|~(X7=esk8_0))&(esk8_0=singleton(esk9_0)|~(X7=esk8_0)))),inference(distribute,[status(thm)],[277])).
% cnf(279,negated_conjecture,(esk8_0=singleton(esk9_0)|X1!=esk8_0),inference(split_conjunct,[status(thm)],[278])).
% cnf(280,negated_conjecture,(member(esk9_0,universal_class)|X1!=esk8_0),inference(split_conjunct,[status(thm)],[278])).
% cnf(281,negated_conjecture,(esk8_0!=singleton(X1)|~member(X1,universal_class)),inference(split_conjunct,[status(thm)],[278])).
% cnf(285,negated_conjecture,(unordered_pair(esk9_0,esk9_0)=esk8_0|esk8_0!=X1),inference(rw,[status(thm)],[279,49,theory(equality)]),['unfolding']).
% cnf(289,negated_conjecture,(unordered_pair(X1,X1)!=esk8_0|~member(X1,universal_class)),inference(rw,[status(thm)],[281,49,theory(equality)]),['unfolding']).
% cnf(336,negated_conjecture,(unordered_pair(esk9_0,esk9_0)=esk8_0),inference(er,[status(thm)],[285,theory(equality)])).
% cnf(337,negated_conjecture,(member(esk9_0,universal_class)),inference(er,[status(thm)],[280,theory(equality)])).
% cnf(623,negated_conjecture,(unordered_pair(esk9_0,esk9_0)!=esk8_0),inference(spm,[status(thm)],[289,337,theory(equality)])).
% cnf(625,negated_conjecture,($false),inference(rw,[status(thm)],[623,336,theory(equality)])).
% cnf(626,negated_conjecture,($false),inference(cn,[status(thm)],[625,theory(equality)])).
% cnf(627,negated_conjecture,($false),626,['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/SystemOnTPTP28076/SET086+1.tptp
%
%------------------------------------------------------------------------------