TSTP Solution File: SET064+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET064+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 : merrimac.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:05:42 EDT 2012
% Result : Theorem 0.32s
% Output : Solution 0.32s
% 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/SystemOnTPTP31920/SET064+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP31920/SET064+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31920/SET064+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 32018
% 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 : 91
% # Removed in clause preprocessing : 8
% # Initial clauses in saturation : 83
% # Processed clauses : 15
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 15
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 8
% # ...of the previous two non-trivial : 3
% # Contextual simplify-reflections : 0
% # Paramodulations : 6
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 13
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 6
% # Current number of unprocessed clauses: 71
% # ...number of literals in the above : 158
% # Clause-clause subsumption calls (NU) : 4
% # Rec. Clause-clause subsumption calls : 4
% # Non-unit clause-clause subsumptions: 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 0
% # BW rewrite match successes : 0
% # Backwards rewriting index : 148 nodes, 23 leaves, 1.09+/-0.282 terms/leaf
% # Paramod-from index : 35 nodes, 5 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index : 98 nodes, 14 leaves, 1.07+/-0.258 terms/leaf
% # Paramod-neg-atom index : 35 nodes, 6 leaves, 1.17+/-0.373 terms/leaf
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:(~(X1=null_class)=>?[X2]:((member(X2,universal_class)&member(X2,X1))&disjoint(X2,X1))),file('/tmp/SRASS.s.p', regularity)).
% fof(44, conjecture,![X5]:(X5=null_class|?[X3]:member(X3,X5)),file('/tmp/SRASS.s.p', null_class_is_unique)).
% fof(45, negated_conjecture,~(![X5]:(X5=null_class|?[X3]:member(X3,X5))),inference(assume_negation,[status(cth)],[44])).
% fof(50, plain,![X1]:(X1=null_class|?[X2]:((member(X2,universal_class)&member(X2,X1))&disjoint(X2,X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(51, plain,![X3]:(X3=null_class|?[X4]:((member(X4,universal_class)&member(X4,X3))&disjoint(X4,X3))),inference(variable_rename,[status(thm)],[50])).
% fof(52, plain,![X3]:(X3=null_class|((member(esk1_1(X3),universal_class)&member(esk1_1(X3),X3))&disjoint(esk1_1(X3),X3))),inference(skolemize,[status(esa)],[51])).
% fof(53, plain,![X3]:(((member(esk1_1(X3),universal_class)|X3=null_class)&(member(esk1_1(X3),X3)|X3=null_class))&(disjoint(esk1_1(X3),X3)|X3=null_class)),inference(distribute,[status(thm)],[52])).
% cnf(55,plain,(X1=null_class|member(esk1_1(X1),X1)),inference(split_conjunct,[status(thm)],[53])).
% fof(273, negated_conjecture,?[X5]:(~(X5=null_class)&![X3]:~(member(X3,X5))),inference(fof_nnf,[status(thm)],[45])).
% fof(274, negated_conjecture,?[X6]:(~(X6=null_class)&![X7]:~(member(X7,X6))),inference(variable_rename,[status(thm)],[273])).
% fof(275, negated_conjecture,(~(esk8_0=null_class)&![X7]:~(member(X7,esk8_0))),inference(skolemize,[status(esa)],[274])).
% fof(276, negated_conjecture,![X7]:(~(esk8_0=null_class)&~(member(X7,esk8_0))),inference(shift_quantors,[status(thm)],[275])).
% cnf(277,negated_conjecture,(~member(X1,esk8_0)),inference(split_conjunct,[status(thm)],[276])).
% cnf(278,negated_conjecture,(esk8_0!=null_class),inference(split_conjunct,[status(thm)],[276])).
% cnf(334,negated_conjecture,(null_class=esk8_0),inference(spm,[status(thm)],[277,55,theory(equality)])).
% cnf(339,negated_conjecture,($false),inference(sr,[status(thm)],[334,278,theory(equality)])).
% cnf(340,negated_conjecture,($false),339,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.02 CPU 0.06 WC
% FINAL PrfWatch: 0.02 CPU 0.06 WC
% SZS output end Solution for /tmp/SystemOnTPTP31920/SET064+1.tptp
%
%------------------------------------------------------------------------------