TSTP Solution File: SYN045+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN045+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art06.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 09:16:14 EST 2010
% Result : Theorem 0.45s
% Output : Solution 0.45s
% 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/SystemOnTPTP9104/SYN045+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP9104/SYN045+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9104/SYN045+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 9154
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, conjecture,((p|(q&r))<=>((p|q)&(p|r))),file('/tmp/SRASS.s.p', pel13)).
% fof(2, negated_conjecture,~(((p|(q&r))<=>((p|q)&(p|r)))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,(((~(p)&(~(q)|~(r)))|((~(p)&~(q))|(~(p)&~(r))))&((p|(q&r))|((p|q)&(p|r)))),inference(fof_nnf,[status(thm)],[2])).
% fof(4, negated_conjecture,((((((~(p)|~(p))|~(p))&((~(r)|~(p))|~(p)))&(((~(p)|~(q))|~(p))&((~(r)|~(q))|~(p))))&((((~(p)|~(p))|(~(q)|~(r)))&((~(r)|~(p))|(~(q)|~(r))))&(((~(p)|~(q))|(~(q)|~(r)))&((~(r)|~(q))|(~(q)|~(r))))))&((((p|q)|(q|p))&((p|r)|(q|p)))&(((p|q)|(r|p))&((p|r)|(r|p))))),inference(distribute,[status(thm)],[3])).
% cnf(5,negated_conjecture,(p|r|r|p),inference(split_conjunct,[status(thm)],[4])).
% cnf(8,negated_conjecture,(p|q|q|p),inference(split_conjunct,[status(thm)],[4])).
% cnf(9,negated_conjecture,(~r|~q|~q|~r),inference(split_conjunct,[status(thm)],[4])).
% cnf(16,negated_conjecture,(~p|~p|~p),inference(split_conjunct,[status(thm)],[4])).
% cnf(17,negated_conjecture,(q),inference(sr,[status(thm)],[8,16,theory(equality)])).
% cnf(18,negated_conjecture,(~r|$false),inference(rw,[status(thm)],[9,17,theory(equality)])).
% cnf(19,negated_conjecture,(~r),inference(cn,[status(thm)],[18,theory(equality)])).
% cnf(20,negated_conjecture,(r),inference(sr,[status(thm)],[5,16,theory(equality)])).
% cnf(39,negated_conjecture,($false),inference(rw,[status(thm)],[19,20,theory(equality)])).
% cnf(40,negated_conjecture,($false),inference(cn,[status(thm)],[39,theory(equality)])).
% cnf(41,negated_conjecture,($false),40,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 13
% # ...of these trivial : 2
% # ...subsumed : 6
% # ...remaining for further processing: 5
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 0
% # ...of the previous two non-trivial : 1
% # Contextual simplify-reflections : 0
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 3
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # 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: 4 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 2 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 3 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.007 s
% # System time : 0.003 s
% # Total time : 0.010 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.08 CPU 0.16 WC
% FINAL PrfWatch: 0.08 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP9104/SYN045+1.tptp
%
%------------------------------------------------------------------------------