TSTP Solution File: SWW469+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWW469+1 : TPTP v5.3.0. Released v5.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art05.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2800MHz
% Memory : 2005MB
% OS : Linux 2.6.32.26-175.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 4 00:56:35 EST 2011
% Result : Theorem 0.57s
% Output : Solution 0.57s
% 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/SystemOnTPTP26711/SWW469+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP26711/SWW469+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26711/SWW469+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.4/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 26825
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 WC
% # Garbage collection reclaimed 2 unused term cells.
% # Garbage collection reclaimed 75 unused term cells.
% # Garbage collection reclaimed 59 unused term cells.
% # Auto-Ordering is analysing problem.
% # Problem is type GHSFGFFSS11SS
% # Auto-mode selected ordering type KBO6
% # Auto-mode selected ordering precedence scheme <invfreq>
% # Auto-mode selected weight ordering scheme <precrank20>
% #
% # Auto-Heuristic is analysing problem.
% # Problem is type GHSFGFFSS11SS
% # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y
% # and selection function SelectMaxLComplexAvoidPosPred.
% #
% # Initializing proof state
% # Scanning for AC axioms
% # Presaturation interreduction done
% # Proof found!
% # SZS status Theorem
% # Parsed axioms : 7
% # Removed by relevancy pruning : 0
% # Initial clauses : 11
% # Removed in clause preprocessing : 0
% # Initial clauses in saturation : 11
% # Processed clauses : 23
% # ...of these trivial : 2
% # ...subsumed : 0
% # ...remaining for further processing: 20
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 3
% # ...of the previous two non-trivial : 4
% # Contextual simplify-reflections : 0
% # Paramodulations : 3
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 9
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 1
% # Current number of unprocessed clauses: 1
% # ...number of literals in the above : 1
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index : 13 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index : 6 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index : 12 leaves, 1.00+/-0.000 terms/leaf
% # SZS output start CNFRefutation.
% fof(1, axiom,(hoare_165779456gleton<=>?[X1]:?[X2]:((is_state(X1)&is_state(X2))&~(X1=X2))),file('/tmp/SRASS.s.p', fact_0_state__not__singleton__def)).
% fof(2, axiom,hoare_165779456gleton,file('/tmp/SRASS.s.p', conj_0)).
% fof(7, conjecture,![X2]:(is_state(X2)=>~(![X1]:(is_state(X1)=>X1=X2))),file('/tmp/SRASS.s.p', conj_1)).
% fof(8, negated_conjecture,~(![X2]:(is_state(X2)=>~(![X1]:(is_state(X1)=>X1=X2)))),inference(assume_negation,[status(cth)],[7])).
% fof(10, plain,((~(hoare_165779456gleton)|?[X1]:?[X2]:((is_state(X1)&is_state(X2))&~(X1=X2)))&(![X1]:![X2]:((~(is_state(X1))|~(is_state(X2)))|X1=X2)|hoare_165779456gleton)),inference(fof_nnf,[status(thm)],[1])).
% fof(11, plain,((~(hoare_165779456gleton)|?[X3]:?[X4]:((is_state(X3)&is_state(X4))&~(X3=X4)))&(![X5]:![X6]:((~(is_state(X5))|~(is_state(X6)))|X5=X6)|hoare_165779456gleton)),inference(variable_rename,[status(thm)],[10])).
% fof(12, plain,((~(hoare_165779456gleton)|((is_state(esk1_0)&is_state(esk2_0))&~(esk1_0=esk2_0)))&(![X5]:![X6]:((~(is_state(X5))|~(is_state(X6)))|X5=X6)|hoare_165779456gleton)),inference(skolemize,[status(esa)],[11])).
% fof(13, plain,![X5]:![X6]:((~(hoare_165779456gleton)|((is_state(esk1_0)&is_state(esk2_0))&~(esk1_0=esk2_0)))&(((~(is_state(X5))|~(is_state(X6)))|X5=X6)|hoare_165779456gleton)),inference(shift_quantors,[status(thm)],[12])).
% fof(14, plain,![X5]:![X6]:((((is_state(esk1_0)|~(hoare_165779456gleton))&(is_state(esk2_0)|~(hoare_165779456gleton)))&(~(esk1_0=esk2_0)|~(hoare_165779456gleton)))&(((~(is_state(X5))|~(is_state(X6)))|X5=X6)|hoare_165779456gleton)),inference(distribute,[status(thm)],[13])).
% cnf(16,plain,(~hoare_165779456gleton|esk1_0!=esk2_0),inference(split_conjunct,[status(thm)],[14])).
% cnf(17,plain,(is_state(esk2_0)|~hoare_165779456gleton),inference(split_conjunct,[status(thm)],[14])).
% cnf(18,plain,(is_state(esk1_0)|~hoare_165779456gleton),inference(split_conjunct,[status(thm)],[14])).
% cnf(19,plain,(hoare_165779456gleton),inference(split_conjunct,[status(thm)],[2])).
% fof(24, negated_conjecture,?[X2]:(is_state(X2)&![X1]:(~(is_state(X1))|X1=X2)),inference(fof_nnf,[status(thm)],[8])).
% fof(25, negated_conjecture,?[X3]:(is_state(X3)&![X4]:(~(is_state(X4))|X4=X3)),inference(variable_rename,[status(thm)],[24])).
% fof(26, negated_conjecture,(is_state(esk3_0)&![X4]:(~(is_state(X4))|X4=esk3_0)),inference(skolemize,[status(esa)],[25])).
% fof(27, negated_conjecture,![X4]:(is_state(esk3_0)&(~(is_state(X4))|X4=esk3_0)),inference(shift_quantors,[status(thm)],[26])).
% cnf(28,negated_conjecture,(X1=esk3_0|~is_state(X1)),inference(split_conjunct,[status(thm)],[27])).
% cnf(30,plain,(is_state(esk1_0)|$false),inference(rw,[status(thm)],[18,19,theory(equality)])).
% cnf(31,plain,(is_state(esk1_0)),inference(cn,[status(thm)],[30,theory(equality)])).
% cnf(33,plain,(is_state(esk2_0)|$false),inference(rw,[status(thm)],[17,19,theory(equality)])).
% cnf(34,plain,(is_state(esk2_0)),inference(cn,[status(thm)],[33,theory(equality)])).
% cnf(35,plain,(esk2_0!=esk1_0|$false),inference(rw,[status(thm)],[16,19,theory(equality)])).
% cnf(36,plain,(esk2_0!=esk1_0),inference(cn,[status(thm)],[35,theory(equality)])).
% cnf(38,negated_conjecture,(esk3_0=esk2_0),inference(spm,[status(thm)],[28,34,theory(equality)])).
% cnf(39,negated_conjecture,(esk3_0=esk1_0),inference(spm,[status(thm)],[28,31,theory(equality)])).
% cnf(42,plain,(esk3_0!=esk1_0),inference(rw,[status(thm)],[36,38,theory(equality)])).
% cnf(43,negated_conjecture,($false),inference(sr,[status(thm)],[39,42,theory(equality)])).
% cnf(44,negated_conjecture,($false),43,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.04 CPU 0.16 WC
% FINAL PrfWatch: 0.04 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP26711/SWW469+1.tptp
%
%------------------------------------------------------------------------------