TSTP Solution File: SYN047+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN047+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:23 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/SystemOnTPTP9531/SYN047+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP9531/SYN047+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9531/SYN047+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 9581
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, conjecture,(((p&(q=>r))=>s)<=>(((~(p)|q)|s)&((~(p)|~(r))|s))),file('/tmp/SRASS.s.p', pel17)).
% fof(2, negated_conjecture,~((((p&(q=>r))=>s)<=>(((~(p)|q)|s)&((~(p)|~(r))|s)))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,~((((p&(q=>r))=>s)<=>(((~(p)|q)|s)&((~(p)|~(r))|s)))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(4, negated_conjecture,((((p&(~(q)|r))&~(s))|(((p&~(q))&~(s))|((p&r)&~(s))))&(((~(p)|(q&~(r)))|s)|(((~(p)|q)|s)&((~(p)|~(r))|s)))),inference(fof_nnf,[status(thm)],[3])).
% fof(5, negated_conjecture,(((((((((p|p)|p)&((r|p)|p))&((~(s)|p)|p))&((((p|~(q))|p)&((r|~(q))|p))&((~(s)|~(q))|p)))&((((p|~(s))|p)&((r|~(s))|p))&((~(s)|~(s))|p)))&((((((p|p)|(~(q)|r))&((r|p)|(~(q)|r)))&((~(s)|p)|(~(q)|r)))&((((p|~(q))|(~(q)|r))&((r|~(q))|(~(q)|r)))&((~(s)|~(q))|(~(q)|r))))&((((p|~(s))|(~(q)|r))&((r|~(s))|(~(q)|r)))&((~(s)|~(s))|(~(q)|r)))))&((((((p|p)|~(s))&((r|p)|~(s)))&((~(s)|p)|~(s)))&((((p|~(q))|~(s))&((r|~(q))|~(s)))&((~(s)|~(q))|~(s))))&((((p|~(s))|~(s))&((r|~(s))|~(s)))&((~(s)|~(s))|~(s)))))&(((((~(p)|q)|s)|((q|~(p))|s))&(((~(p)|~(r))|s)|((q|~(p))|s)))&((((~(p)|q)|s)|((~(r)|~(p))|s))&(((~(p)|~(r))|s)|((~(r)|~(p))|s))))),inference(distribute,[status(thm)],[4])).
% cnf(6,negated_conjecture,(s|s|~p|~r|~r|~p),inference(split_conjunct,[status(thm)],[5])).
% cnf(9,negated_conjecture,(s|q|s|q|~p|~p),inference(split_conjunct,[status(thm)],[5])).
% cnf(10,negated_conjecture,(~s|~s|~s),inference(split_conjunct,[status(thm)],[5])).
% cnf(23,negated_conjecture,(r|r|~q|~q),inference(split_conjunct,[status(thm)],[5])).
% cnf(36,negated_conjecture,(p|p|p),inference(split_conjunct,[status(thm)],[5])).
% cnf(51,negated_conjecture,(q|s|$false),inference(rw,[status(thm)],[9,36,theory(equality)])).
% cnf(52,negated_conjecture,(q|s),inference(cn,[status(thm)],[51,theory(equality)])).
% cnf(53,negated_conjecture,(q),inference(sr,[status(thm)],[52,10,theory(equality)])).
% cnf(54,negated_conjecture,(r|$false),inference(rw,[status(thm)],[23,53,theory(equality)])).
% cnf(55,negated_conjecture,(r),inference(cn,[status(thm)],[54,theory(equality)])).
% cnf(70,negated_conjecture,(s|$false|~r),inference(rw,[status(thm)],[6,36,theory(equality)])).
% cnf(71,negated_conjecture,(s|~r),inference(cn,[status(thm)],[70,theory(equality)])).
% cnf(72,negated_conjecture,(~r),inference(sr,[status(thm)],[71,10,theory(equality)])).
% cnf(85,negated_conjecture,($false),inference(sr,[status(thm)],[55,72,theory(equality)])).
% cnf(86,negated_conjecture,($false),85,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 32
% # ...of these trivial : 20
% # ...subsumed : 6
% # ...remaining for further processing: 6
% # 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: 4
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # 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: 5 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 2 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 4 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.008 s
% # System time : 0.004 s
% # Total time : 0.012 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.08 CPU 0.17 WC
% FINAL PrfWatch: 0.08 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP9531/SYN047+1.tptp
%
%------------------------------------------------------------------------------