TSTP Solution File: SYN393+1.003 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN393+1.003 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art02.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:29 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/SystemOnTPTP13484/SYN393+1.003.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP13484/SYN393+1.003.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13484/SYN393+1.003.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 13534
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.008 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, conjecture,(((p1<=>p2)<=>p3)<=>(p1<=>(p2<=>p3))),file('/tmp/SRASS.s.p', pel12)).
% fof(2, negated_conjecture,~((((p1<=>p2)<=>p3)<=>(p1<=>(p2<=>p3)))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,((((((~(p1)|~(p2))&(p1|p2))|~(p3))&(((~(p1)|p2)&(~(p2)|p1))|p3))|((~(p1)|((~(p2)|~(p3))&(p2|p3)))&(p1|((~(p2)|p3)&(~(p3)|p2)))))&(((((~(p1)|~(p2))&(p1|p2))|p3)&(~(p3)|((~(p1)|p2)&(~(p2)|p1))))|((~(p1)|((~(p2)|p3)&(~(p3)|p2)))&(((~(p2)|~(p3))&(p2|p3))|p1)))),inference(fof_nnf,[status(thm)],[2])).
% fof(4, negated_conjecture,((((((((~(p2)|~(p3))|~(p1))|((~(p1)|~(p2))|~(p3)))&(((p2|p3)|~(p1))|((~(p1)|~(p2))|~(p3))))&((((~(p2)|p3)|p1)|((~(p1)|~(p2))|~(p3)))&(((~(p3)|p2)|p1)|((~(p1)|~(p2))|~(p3)))))&(((((~(p2)|~(p3))|~(p1))|((p1|p2)|~(p3)))&(((p2|p3)|~(p1))|((p1|p2)|~(p3))))&((((~(p2)|p3)|p1)|((p1|p2)|~(p3)))&(((~(p3)|p2)|p1)|((p1|p2)|~(p3))))))&((((((~(p2)|~(p3))|~(p1))|((~(p1)|p2)|p3))&(((p2|p3)|~(p1))|((~(p1)|p2)|p3)))&((((~(p2)|p3)|p1)|((~(p1)|p2)|p3))&(((~(p3)|p2)|p1)|((~(p1)|p2)|p3))))&(((((~(p2)|~(p3))|~(p1))|((~(p2)|p1)|p3))&(((p2|p3)|~(p1))|((~(p2)|p1)|p3)))&((((~(p2)|p3)|p1)|((~(p2)|p1)|p3))&(((~(p3)|p2)|p1)|((~(p2)|p1)|p3))))))&(((((((~(p2)|p3)|~(p1))|((~(p1)|~(p2))|p3))&(((~(p3)|p2)|~(p1))|((~(p1)|~(p2))|p3)))&((((~(p2)|~(p3))|p1)|((~(p1)|~(p2))|p3))&(((p2|p3)|p1)|((~(p1)|~(p2))|p3))))&(((((~(p2)|p3)|~(p1))|((p1|p2)|p3))&(((~(p3)|p2)|~(p1))|((p1|p2)|p3)))&((((~(p2)|~(p3))|p1)|((p1|p2)|p3))&(((p2|p3)|p1)|((p1|p2)|p3)))))&((((((~(p2)|p3)|~(p1))|((~(p1)|p2)|~(p3)))&(((~(p3)|p2)|~(p1))|((~(p1)|p2)|~(p3))))&((((~(p2)|~(p3))|p1)|((~(p1)|p2)|~(p3)))&(((p2|p3)|p1)|((~(p1)|p2)|~(p3)))))&(((((~(p2)|p3)|~(p1))|((~(p2)|p1)|~(p3)))&(((~(p3)|p2)|~(p1))|((~(p2)|p1)|~(p3))))&((((~(p2)|~(p3))|p1)|((~(p2)|p1)|~(p3)))&(((p2|p3)|p1)|((~(p2)|p1)|~(p3)))))))),inference(distribute,[status(thm)],[3])).
% cnf(6,negated_conjecture,(p1|p1|~p3|~p2|~p3|~p2),inference(split_conjunct,[status(thm)],[4])).
% cnf(11,negated_conjecture,(p2|p2|~p3|~p1|~p1|~p3),inference(split_conjunct,[status(thm)],[4])).
% cnf(13,negated_conjecture,(p3|p2|p1|p1|p3|p2),inference(split_conjunct,[status(thm)],[4])).
% cnf(20,negated_conjecture,(p3|p3|~p2|~p1|~p1|~p2),inference(split_conjunct,[status(thm)],[4])).
% cnf(22,negated_conjecture,(p3|p1|p1|p3|~p2|~p2),inference(split_conjunct,[status(thm)],[4])).
% cnf(27,negated_conjecture,(p3|p2|p3|p2|~p1|~p1),inference(split_conjunct,[status(thm)],[4])).
% cnf(29,negated_conjecture,(p2|p1|p1|p2|~p3|~p3),inference(split_conjunct,[status(thm)],[4])).
% cnf(36,negated_conjecture,(~p3|~p2|~p1|~p1|~p3|~p2),inference(split_conjunct,[status(thm)],[4])).
% cnf(37,negated_conjecture,(p2|p1),inference(csr,[status(thm)],[29,13])).
% cnf(38,negated_conjecture,(p3|p1),inference(csr,[status(thm)],[22,37])).
% cnf(39,negated_conjecture,(p3|p2),inference(csr,[status(thm)],[27,37])).
% cnf(40,negated_conjecture,(p1|~p2),inference(csr,[status(thm)],[6,38])).
% cnf(41,negated_conjecture,(p1),inference(csr,[status(thm)],[40,37])).
% cnf(42,negated_conjecture,(p2|$false|~p3),inference(rw,[status(thm)],[11,41,theory(equality)])).
% cnf(43,negated_conjecture,(p2|~p3),inference(cn,[status(thm)],[42,theory(equality)])).
% cnf(44,negated_conjecture,(p2),inference(csr,[status(thm)],[43,39])).
% cnf(46,negated_conjecture,(p3|$false|~p2),inference(rw,[status(thm)],[20,41,theory(equality)])).
% cnf(47,negated_conjecture,(p3|$false|$false),inference(rw,[status(thm)],[46,44,theory(equality)])).
% cnf(48,negated_conjecture,(p3),inference(cn,[status(thm)],[47,theory(equality)])).
% cnf(49,negated_conjecture,($false|~p2|~p3),inference(rw,[status(thm)],[36,41,theory(equality)])).
% cnf(50,negated_conjecture,($false|$false|~p3),inference(rw,[status(thm)],[49,44,theory(equality)])).
% cnf(51,negated_conjecture,($false|$false|$false),inference(rw,[status(thm)],[50,48,theory(equality)])).
% cnf(52,negated_conjecture,($false),inference(cn,[status(thm)],[51,theory(equality)])).
% cnf(53,negated_conjecture,($false),52,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 8
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 8
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 1
% # Generated clauses : 0
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 6
% # 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) : 7
% # Rec. Clause-clause subsumption calls : 7
% # Unit Clause-clause subsumption calls : 2
% # 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/SystemOnTPTP13484/SYN393+1.003.tptp
%
%------------------------------------------------------------------------------