TSTP Solution File: SWW469+5 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWW469+5 : TPTP v5.3.0. Released v5.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art08.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2005MB
% OS : Linux 2.6.32.26-175.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 4 00:56:40 EST 2011
% Result : Theorem 0.80s
% Output : Solution 0.80s
% 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/SystemOnTPTP5918/SWW469+5.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP5918/SWW469+5.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5918/SWW469+5.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 6032
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Garbage collection reclaimed 24 unused term cells.
% # Garbage collection reclaimed 289 unused term cells.
% # Garbage collection reclaimed 276 unused term cells.
% # Garbage collection reclaimed 271 unused term cells.
% # Garbage collection reclaimed 238 unused term cells.
% # Garbage collection reclaimed 236 unused term cells.
% # Garbage collection reclaimed 258 unused term cells.
% # Garbage collection reclaimed 251 unused term cells.
% # Garbage collection reclaimed 43 unused term cells.
% # Auto-Ordering is analysing problem.
% # Problem is type GHSMGFFLM32LD
% # 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 GHSMGFFLM32LD
% # 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 : 63
% # Removed by relevancy pruning : 0
% # Initial clauses : 77
% # Removed in clause preprocessing : 2
% # Initial clauses in saturation : 75
% # Processed clauses : 22
% # ...of these trivial : 2
% # ...subsumed : 1
% # ...remaining for further processing: 18
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 0
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 18
% # Positive orientable unit clauses: 13
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 1
% # Non-unit-clauses : 3
% # Current number of unprocessed clauses: 53
% # ...number of literals in the above : 111
% # Clause-clause subsumption calls (NU) : 1
% # Rec. Clause-clause subsumption calls : 1
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 1
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index : 34 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index : 17 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index : 30 leaves, 1.00+/-0.000 terms/leaf
% # SZS output start CNFRefutation.
% fof(1, axiom,(hBOOL(hoare_1883395792gleton)<=>?[X1]:?[X2]:~(ti(state,X1)=ti(state,X2))),file('/tmp/SRASS.s.p', fact_0_state__not__singleton__def)).
% fof(5, axiom,hBOOL(hoare_1883395792gleton),file('/tmp/SRASS.s.p', conj_0)).
% fof(63, conjecture,![X2]:~(![X1]:ti(state,X1)=ti(state,X2)),file('/tmp/SRASS.s.p', conj_1)).
% fof(64, negated_conjecture,~(![X2]:~(![X1]:ti(state,X1)=ti(state,X2))),inference(assume_negation,[status(cth)],[63])).
% fof(69, plain,((~(hBOOL(hoare_1883395792gleton))|?[X1]:?[X2]:~(ti(state,X1)=ti(state,X2)))&(![X1]:![X2]:ti(state,X1)=ti(state,X2)|hBOOL(hoare_1883395792gleton))),inference(fof_nnf,[status(thm)],[1])).
% fof(70, plain,((~(hBOOL(hoare_1883395792gleton))|?[X3]:?[X4]:~(ti(state,X3)=ti(state,X4)))&(![X5]:![X6]:ti(state,X5)=ti(state,X6)|hBOOL(hoare_1883395792gleton))),inference(variable_rename,[status(thm)],[69])).
% fof(71, plain,((~(hBOOL(hoare_1883395792gleton))|~(ti(state,esk1_0)=ti(state,esk2_0)))&(![X5]:![X6]:ti(state,X5)=ti(state,X6)|hBOOL(hoare_1883395792gleton))),inference(skolemize,[status(esa)],[70])).
% fof(72, plain,![X5]:![X6]:((~(hBOOL(hoare_1883395792gleton))|~(ti(state,esk1_0)=ti(state,esk2_0)))&(ti(state,X5)=ti(state,X6)|hBOOL(hoare_1883395792gleton))),inference(shift_quantors,[status(thm)],[71])).
% cnf(74,plain,(ti(state,esk1_0)!=ti(state,esk2_0)|~hBOOL(hoare_1883395792gleton)),inference(split_conjunct,[status(thm)],[72])).
% cnf(82,plain,(hBOOL(hoare_1883395792gleton)),inference(split_conjunct,[status(thm)],[5])).
% fof(246, negated_conjecture,?[X2]:![X1]:ti(state,X1)=ti(state,X2),inference(fof_nnf,[status(thm)],[64])).
% fof(247, negated_conjecture,?[X3]:![X4]:ti(state,X4)=ti(state,X3),inference(variable_rename,[status(thm)],[246])).
% fof(248, negated_conjecture,![X4]:ti(state,X4)=ti(state,esk12_0),inference(skolemize,[status(esa)],[247])).
% cnf(249,negated_conjecture,(ti(state,X1)=ti(state,esk12_0)),inference(split_conjunct,[status(thm)],[248])).
% cnf(252,plain,(ti(state,esk12_0)!=ti(state,esk2_0)|~hBOOL(hoare_1883395792gleton)),inference(rw,[status(thm)],[74,249,theory(equality)])).
% cnf(253,plain,($false|~hBOOL(hoare_1883395792gleton)),inference(rw,[status(thm)],[252,249,theory(equality)])).
% cnf(254,plain,($false|$false),inference(rw,[status(thm)],[253,82,theory(equality)])).
% cnf(255,plain,($false),inference(cn,[status(thm)],[254,theory(equality)])).
% cnf(256,plain,($false),255,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.06 CPU 0.17 WC
% FINAL PrfWatch: 0.06 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP5918/SWW469+5.tptp
% WARNING: TreeLimitedRun lost 0.09s, total lost is 0.09s
%
%------------------------------------------------------------------------------