TSTP Solution File: SYN392+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN392+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 : art04.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:28:25 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/SystemOnTPTP19035/SYN392+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP19035/SYN392+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19035/SYN392+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 19085
% 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,((p1<=>p2)<=>((p2|~(p1))&(~(p2)|p1))),file('/tmp/SRASS.s.p', pel14)).
% fof(2, negated_conjecture,~(((p1<=>p2)<=>((p2|~(p1))&(~(p2)|p1)))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,~(((p1<=>p2)<=>((p2|~(p1))&(~(p2)|p1)))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(4, negated_conjecture,((((~(p1)|~(p2))&(p1|p2))|((~(p2)&p1)|(p2&~(p1))))&(((~(p1)|p2)&(~(p2)|p1))|((p2|~(p1))&(~(p2)|p1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(5, negated_conjecture,((((((p2|~(p2))|(~(p1)|~(p2)))&((~(p1)|~(p2))|(~(p1)|~(p2))))&(((p2|p1)|(~(p1)|~(p2)))&((~(p1)|p1)|(~(p1)|~(p2)))))&((((p2|~(p2))|(p1|p2))&((~(p1)|~(p2))|(p1|p2)))&(((p2|p1)|(p1|p2))&((~(p1)|p1)|(p1|p2)))))&((((p2|~(p1))|(~(p1)|p2))&((~(p2)|p1)|(~(p1)|p2)))&(((p2|~(p1))|(~(p2)|p1))&((~(p2)|p1)|(~(p2)|p1))))),inference(distribute,[status(thm)],[4])).
% cnf(6,negated_conjecture,(p1|p1|~p2|~p2),inference(split_conjunct,[status(thm)],[5])).
% cnf(9,negated_conjecture,(p2|p2|~p1|~p1),inference(split_conjunct,[status(thm)],[5])).
% cnf(11,negated_conjecture,(p2|p1|p1|p2),inference(split_conjunct,[status(thm)],[5])).
% cnf(16,negated_conjecture,(~p2|~p1|~p2|~p1),inference(split_conjunct,[status(thm)],[5])).
% cnf(18,negated_conjecture,(p1),inference(csr,[status(thm)],[6,11])).
% cnf(19,negated_conjecture,(p2|$false),inference(rw,[status(thm)],[9,18,theory(equality)])).
% cnf(20,negated_conjecture,(p2),inference(cn,[status(thm)],[19,theory(equality)])).
% cnf(21,negated_conjecture,($false|~p2),inference(rw,[status(thm)],[16,18,theory(equality)])).
% cnf(22,negated_conjecture,($false|$false),inference(rw,[status(thm)],[21,20,theory(equality)])).
% cnf(23,negated_conjecture,($false),inference(cn,[status(thm)],[22,theory(equality)])).
% cnf(24,negated_conjecture,($false),23,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 4
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 4
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 0
% # Generated clauses : 0
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 1
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 2
% # Positive orientable unit clauses: 2
% # 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) : 1
% # Rec. Clause-clause subsumption calls : 1
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 3 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 2 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 2 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.008 s
% # System time : 0.003 s
% # Total time : 0.011 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.08 CPU 0.15 WC
% FINAL PrfWatch: 0.08 CPU 0.15 WC
% SZS output end Solution for /tmp/SystemOnTPTP19035/SYN392+1.tptp
%
%------------------------------------------------------------------------------