TSTP Solution File: SYN044+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN044+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 : 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 09:16:09 EST 2010
% Result : Theorem 0.46s
% Output : Solution 0.46s
% 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/SystemOnTPTP10366/SYN044+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP10366/SYN044+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10366/SYN044+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 10416
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.009 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,(r=>(p&q)),file('/tmp/SRASS.s.p', pel10_2)).
% fof(2, axiom,(p=>(q|r)),file('/tmp/SRASS.s.p', pel10_3)).
% fof(3, axiom,(q=>r),file('/tmp/SRASS.s.p', pel10_1)).
% fof(4, conjecture,(p<=>q),file('/tmp/SRASS.s.p', pel10)).
% fof(5, negated_conjecture,~((p<=>q)),inference(assume_negation,[status(cth)],[4])).
% fof(6, plain,(~(r)|(p&q)),inference(fof_nnf,[status(thm)],[1])).
% fof(7, plain,((p|~(r))&(q|~(r))),inference(distribute,[status(thm)],[6])).
% cnf(8,plain,(q|~r),inference(split_conjunct,[status(thm)],[7])).
% cnf(9,plain,(p|~r),inference(split_conjunct,[status(thm)],[7])).
% fof(10, plain,(~(p)|(q|r)),inference(fof_nnf,[status(thm)],[2])).
% cnf(11,plain,(r|q|~p),inference(split_conjunct,[status(thm)],[10])).
% fof(12, plain,(~(q)|r),inference(fof_nnf,[status(thm)],[3])).
% cnf(13,plain,(r|~q),inference(split_conjunct,[status(thm)],[12])).
% fof(14, negated_conjecture,((~(p)|~(q))&(p|q)),inference(fof_nnf,[status(thm)],[5])).
% cnf(15,negated_conjecture,(q|p),inference(split_conjunct,[status(thm)],[14])).
% cnf(16,negated_conjecture,(~q|~p),inference(split_conjunct,[status(thm)],[14])).
% cnf(17,plain,(q|r),inference(csr,[status(thm)],[11,15])).
% cnf(18,plain,(r),inference(csr,[status(thm)],[17,13])).
% cnf(19,plain,(q|$false),inference(rw,[status(thm)],[8,18,theory(equality)])).
% cnf(20,plain,(q),inference(cn,[status(thm)],[19,theory(equality)])).
% cnf(21,plain,(p|$false),inference(rw,[status(thm)],[9,18,theory(equality)])).
% cnf(22,plain,(p),inference(cn,[status(thm)],[21,theory(equality)])).
% cnf(23,negated_conjecture,($false|~p),inference(rw,[status(thm)],[16,20,theory(equality)])).
% cnf(24,negated_conjecture,(~p),inference(cn,[status(thm)],[23,theory(equality)])).
% cnf(26,negated_conjecture,($false),inference(rw,[status(thm)],[24,22,theory(equality)])).
% cnf(27,negated_conjecture,($false),inference(cn,[status(thm)],[26,theory(equality)])).
% cnf(28,negated_conjecture,($false),27,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 9
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 9
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 4
% # Generated clauses : 0
% # ...of the previous two non-trivial : 3
% # Contextual simplify-reflections : 2
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 3
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 2
% # Rec. Clause-clause subsumption calls : 2
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 4 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 3 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 3 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.005 s
% # System time : 0.004 s
% # Total time : 0.009 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP10366/SYN044+1.tptp
%
%------------------------------------------------------------------------------