TSTP Solution File: SWV416+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWV416+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 : art03.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:57:52 EST 2010
% Result : Theorem 1.05s
% Output : Solution 1.05s
% 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/SystemOnTPTP32259/SWV416+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP32259/SWV416+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32259/SWV416+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 32355
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(pi_remove(X1,X2)<=>pi_sharp_remove(i(X1),X2)),file('/tmp/SRASS.s.p', ax57)).
% fof(3, axiom,![X1]:![X2]:![X3]:![X4]:(contains_pq(i(triple(X1,X2,X3)),X4)=>i(remove_cpq(triple(X1,X2,X3),X4))=remove_pq(i(triple(X1,X2,X3)),X4)),file('/tmp/SRASS.s.p', main3_li34)).
% fof(7, axiom,![X1]:![X2]:(pi_sharp_remove(X1,X2)<=>contains_pq(X1,X2)),file('/tmp/SRASS.s.p', ax56)).
% fof(65, conjecture,![X1]:![X2]:![X3]:![X4]:(pi_remove(triple(X1,X2,X3),X4)=>(phi(remove_cpq(triple(X1,X2,X3),X4))=>(pi_sharp_remove(i(triple(X1,X2,X3)),X4)&i(remove_cpq(triple(X1,X2,X3),X4))=remove_pq(i(triple(X1,X2,X3)),X4)))),file('/tmp/SRASS.s.p', co3)).
% fof(66, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:(pi_remove(triple(X1,X2,X3),X4)=>(phi(remove_cpq(triple(X1,X2,X3),X4))=>(pi_sharp_remove(i(triple(X1,X2,X3)),X4)&i(remove_cpq(triple(X1,X2,X3),X4))=remove_pq(i(triple(X1,X2,X3)),X4))))),inference(assume_negation,[status(cth)],[65])).
% fof(78, plain,![X1]:![X2]:((~(pi_remove(X1,X2))|pi_sharp_remove(i(X1),X2))&(~(pi_sharp_remove(i(X1),X2))|pi_remove(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(79, plain,![X3]:![X4]:((~(pi_remove(X3,X4))|pi_sharp_remove(i(X3),X4))&(~(pi_sharp_remove(i(X3),X4))|pi_remove(X3,X4))),inference(variable_rename,[status(thm)],[78])).
% cnf(81,plain,(pi_sharp_remove(i(X1),X2)|~pi_remove(X1,X2)),inference(split_conjunct,[status(thm)],[79])).
% fof(84, plain,![X1]:![X2]:![X3]:![X4]:(~(contains_pq(i(triple(X1,X2,X3)),X4))|i(remove_cpq(triple(X1,X2,X3),X4))=remove_pq(i(triple(X1,X2,X3)),X4)),inference(fof_nnf,[status(thm)],[3])).
% fof(85, plain,![X5]:![X6]:![X7]:![X8]:(~(contains_pq(i(triple(X5,X6,X7)),X8))|i(remove_cpq(triple(X5,X6,X7),X8))=remove_pq(i(triple(X5,X6,X7)),X8)),inference(variable_rename,[status(thm)],[84])).
% cnf(86,plain,(i(remove_cpq(triple(X1,X2,X3),X4))=remove_pq(i(triple(X1,X2,X3)),X4)|~contains_pq(i(triple(X1,X2,X3)),X4)),inference(split_conjunct,[status(thm)],[85])).
% fof(94, plain,![X1]:![X2]:((~(pi_sharp_remove(X1,X2))|contains_pq(X1,X2))&(~(contains_pq(X1,X2))|pi_sharp_remove(X1,X2))),inference(fof_nnf,[status(thm)],[7])).
% fof(95, plain,![X3]:![X4]:((~(pi_sharp_remove(X3,X4))|contains_pq(X3,X4))&(~(contains_pq(X3,X4))|pi_sharp_remove(X3,X4))),inference(variable_rename,[status(thm)],[94])).
% cnf(97,plain,(contains_pq(X1,X2)|~pi_sharp_remove(X1,X2)),inference(split_conjunct,[status(thm)],[95])).
% fof(283, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:(pi_remove(triple(X1,X2,X3),X4)&(phi(remove_cpq(triple(X1,X2,X3),X4))&(~(pi_sharp_remove(i(triple(X1,X2,X3)),X4))|~(i(remove_cpq(triple(X1,X2,X3),X4))=remove_pq(i(triple(X1,X2,X3)),X4))))),inference(fof_nnf,[status(thm)],[66])).
% fof(284, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:(pi_remove(triple(X5,X6,X7),X8)&(phi(remove_cpq(triple(X5,X6,X7),X8))&(~(pi_sharp_remove(i(triple(X5,X6,X7)),X8))|~(i(remove_cpq(triple(X5,X6,X7),X8))=remove_pq(i(triple(X5,X6,X7)),X8))))),inference(variable_rename,[status(thm)],[283])).
% fof(285, negated_conjecture,(pi_remove(triple(esk5_0,esk6_0,esk7_0),esk8_0)&(phi(remove_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0))&(~(pi_sharp_remove(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0))|~(i(remove_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0))=remove_pq(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0))))),inference(skolemize,[status(esa)],[284])).
% cnf(286,negated_conjecture,(i(remove_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0))!=remove_pq(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0)|~pi_sharp_remove(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0)),inference(split_conjunct,[status(thm)],[285])).
% cnf(288,negated_conjecture,(pi_remove(triple(esk5_0,esk6_0,esk7_0),esk8_0)),inference(split_conjunct,[status(thm)],[285])).
% cnf(300,plain,(contains_pq(i(X1),X2)|~pi_remove(X1,X2)),inference(spm,[status(thm)],[97,81,theory(equality)])).
% cnf(418,negated_conjecture,(remove_pq(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0)!=i(remove_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0))|~pi_remove(triple(esk5_0,esk6_0,esk7_0),esk8_0)),inference(spm,[status(thm)],[286,81,theory(equality)])).
% cnf(419,negated_conjecture,(remove_pq(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0)!=i(remove_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0))|$false),inference(rw,[status(thm)],[418,288,theory(equality)])).
% cnf(420,negated_conjecture,(remove_pq(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0)!=i(remove_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0))),inference(cn,[status(thm)],[419,theory(equality)])).
% cnf(534,negated_conjecture,(~contains_pq(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0)),inference(spm,[status(thm)],[420,86,theory(equality)])).
% cnf(541,negated_conjecture,(contains_pq(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0)),inference(spm,[status(thm)],[300,288,theory(equality)])).
% cnf(543,negated_conjecture,($false),inference(sr,[status(thm)],[541,534,theory(equality)])).
% cnf(544,negated_conjecture,($false),543,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 196
% # ...of these trivial : 0
% # ...subsumed : 3
% # ...remaining for further processing: 193
% # Other redundant clauses eliminated : 4
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 225
% # ...of the previous two non-trivial : 197
% # Contextual simplify-reflections : 2
% # Paramodulations : 220
% # Factorizations : 2
% # Equation resolutions : 4
% # Current number of processed clauses: 101
% # Positive orientable unit clauses: 21
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 10
% # Non-unit-clauses : 67
% # Current number of unprocessed clauses: 179
% # ...number of literals in the above : 461
% # Clause-clause subsumption calls (NU) : 157
% # Rec. Clause-clause subsumption calls : 152
% # Unit Clause-clause subsumption calls : 10
% # Rewrite failures with RHS unbound : 22
% # Indexed BW rewrite attempts : 11
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 134 leaves, 1.51+/-1.208 terms/leaf
% # Paramod-from index: 58 leaves, 1.21+/-0.446 terms/leaf
% # Paramod-into index: 112 leaves, 1.44+/-1.171 terms/leaf
% # -------------------------------------------------
% # User time : 0.035 s
% # System time : 0.002 s
% # Total time : 0.037 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.22 WC
% FINAL PrfWatch: 0.14 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP32259/SWV416+1.tptp
%
%------------------------------------------------------------------------------