TSTP Solution File: SWV377+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV377+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art09.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Thu Dec 30 08:49:39 EST 2010
% Result : Theorem 0.94s
% Output : Solution 0.94s
% 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/SystemOnTPTP21469/SWV377+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21469/SWV377+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21469/SWV377+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 21565
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:(~(ok(triple(X1,X2,X3)))=>X3=bad),file('/tmp/SRASS.s.p', ax41)).
% fof(4, axiom,![X1]:![X2]:(ok(triple(X1,X2,bad))<=>~($true)),file('/tmp/SRASS.s.p', ax40)).
% fof(8, axiom,![X1]:![X2]:![X3]:![X4]:insert_cpq(triple(X1,X2,X3),X4)=triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3),file('/tmp/SRASS.s.p', ax42)).
% fof(42, conjecture,![X1]:![X2]:![X3]:![X4]:(~(ok(triple(X1,X2,X3)))=>~(ok(insert_cpq(triple(X1,X2,X3),X4)))),file('/tmp/SRASS.s.p', l13_co)).
% fof(43, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:(~(ok(triple(X1,X2,X3)))=>~(ok(insert_cpq(triple(X1,X2,X3),X4))))),inference(assume_negation,[status(cth)],[42])).
% fof(44, plain,![X1]:![X2]:![X3]:(~(ok(triple(X1,X2,X3)))=>X3=bad),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(45, plain,![X1]:![X2]:~(ok(triple(X1,X2,bad))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(53, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:(~(ok(triple(X1,X2,X3)))=>~(ok(insert_cpq(triple(X1,X2,X3),X4))))),inference(fof_simplification,[status(thm)],[43,theory(equality)])).
% fof(54, plain,![X1]:![X2]:![X3]:(ok(triple(X1,X2,X3))|X3=bad),inference(fof_nnf,[status(thm)],[44])).
% fof(55, plain,![X4]:![X5]:![X6]:(ok(triple(X4,X5,X6))|X6=bad),inference(variable_rename,[status(thm)],[54])).
% cnf(56,plain,(X1=bad|ok(triple(X2,X3,X1))),inference(split_conjunct,[status(thm)],[55])).
% fof(62, plain,![X3]:![X4]:~(ok(triple(X3,X4,bad))),inference(variable_rename,[status(thm)],[45])).
% cnf(63,plain,(~ok(triple(X1,X2,bad))),inference(split_conjunct,[status(thm)],[62])).
% fof(75, plain,![X5]:![X6]:![X7]:![X8]:insert_cpq(triple(X5,X6,X7),X8)=triple(insert_pqp(X5,X8),insert_slb(X6,pair(X8,bottom)),X7),inference(variable_rename,[status(thm)],[8])).
% cnf(76,plain,(insert_cpq(triple(X1,X2,X3),X4)=triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3)),inference(split_conjunct,[status(thm)],[75])).
% fof(171, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:(~(ok(triple(X1,X2,X3)))&ok(insert_cpq(triple(X1,X2,X3),X4))),inference(fof_nnf,[status(thm)],[53])).
% fof(172, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:(~(ok(triple(X5,X6,X7)))&ok(insert_cpq(triple(X5,X6,X7),X8))),inference(variable_rename,[status(thm)],[171])).
% fof(173, negated_conjecture,(~(ok(triple(esk1_0,esk2_0,esk3_0)))&ok(insert_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0))),inference(skolemize,[status(esa)],[172])).
% cnf(174,negated_conjecture,(ok(insert_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0))),inference(split_conjunct,[status(thm)],[173])).
% cnf(175,negated_conjecture,(~ok(triple(esk1_0,esk2_0,esk3_0))),inference(split_conjunct,[status(thm)],[173])).
% cnf(182,negated_conjecture,(bad=esk3_0),inference(spm,[status(thm)],[175,56,theory(equality)])).
% cnf(194,plain,(~ok(insert_cpq(triple(X1,X3,bad),X2))),inference(spm,[status(thm)],[63,76,theory(equality)])).
% cnf(290,negated_conjecture,(ok(insert_cpq(triple(esk1_0,esk2_0,bad),esk4_0))),inference(rw,[status(thm)],[174,182,theory(equality)])).
% cnf(299,negated_conjecture,($false),inference(sr,[status(thm)],[290,194,theory(equality)])).
% cnf(300,negated_conjecture,($false),299,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 109
% # ...of these trivial : 0
% # ...subsumed : 2
% # ...remaining for further processing: 107
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 101
% # ...of the previous two non-trivial : 88
% # Contextual simplify-reflections : 2
% # Paramodulations : 96
% # Factorizations : 2
% # Equation resolutions : 3
% # Current number of processed clauses: 52
% # Positive orientable unit clauses: 14
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 33
% # Current number of unprocessed clauses: 79
% # ...number of literals in the above : 258
% # Clause-clause subsumption calls (NU) : 22
% # Rec. Clause-clause subsumption calls : 22
% # Unit Clause-clause subsumption calls : 8
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 68 leaves, 1.85+/-1.527 terms/leaf
% # Paramod-from index: 30 leaves, 1.27+/-0.512 terms/leaf
% # Paramod-into index: 59 leaves, 1.64+/-1.399 terms/leaf
% # -------------------------------------------------
% # User time : 0.020 s
% # System time : 0.006 s
% # Total time : 0.026 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.19 WC
% FINAL PrfWatch: 0.11 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP21469/SWV377+1.tptp
%
%------------------------------------------------------------------------------