TSTP Solution File: SYN056+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN056+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:17:24 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP10838/SYN056+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP10838/SYN056+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10838/SYN056+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 10934
% 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, axiom,![X1]:![X2]:((big_p(X1)&big_q(X2))=>(big_r(X1)<=>big_s(X2))),file('/tmp/SRASS.s.p', pel26_2)).
% fof(2, axiom,(?[X1]:big_p(X1)<=>?[X2]:big_q(X2)),file('/tmp/SRASS.s.p', pel26_1)).
% fof(3, conjecture,(![X1]:(big_p(X1)=>big_r(X1))<=>![X2]:(big_q(X2)=>big_s(X2))),file('/tmp/SRASS.s.p', pel26)).
% fof(4, negated_conjecture,~((![X1]:(big_p(X1)=>big_r(X1))<=>![X2]:(big_q(X2)=>big_s(X2)))),inference(assume_negation,[status(cth)],[3])).
% fof(5, plain,![X1]:![X2]:((~(big_p(X1))|~(big_q(X2)))|((~(big_r(X1))|big_s(X2))&(~(big_s(X2))|big_r(X1)))),inference(fof_nnf,[status(thm)],[1])).
% fof(6, plain,![X3]:![X4]:((~(big_p(X3))|~(big_q(X4)))|((~(big_r(X3))|big_s(X4))&(~(big_s(X4))|big_r(X3)))),inference(variable_rename,[status(thm)],[5])).
% fof(7, plain,![X3]:![X4]:(((~(big_r(X3))|big_s(X4))|(~(big_p(X3))|~(big_q(X4))))&((~(big_s(X4))|big_r(X3))|(~(big_p(X3))|~(big_q(X4))))),inference(distribute,[status(thm)],[6])).
% cnf(8,plain,(big_r(X2)|~big_q(X1)|~big_p(X2)|~big_s(X1)),inference(split_conjunct,[status(thm)],[7])).
% cnf(9,plain,(big_s(X1)|~big_q(X1)|~big_p(X2)|~big_r(X2)),inference(split_conjunct,[status(thm)],[7])).
% fof(10, plain,((![X1]:~(big_p(X1))|?[X2]:big_q(X2))&(![X2]:~(big_q(X2))|?[X1]:big_p(X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(11, plain,((![X3]:~(big_p(X3))|?[X4]:big_q(X4))&(![X5]:~(big_q(X5))|?[X6]:big_p(X6))),inference(variable_rename,[status(thm)],[10])).
% fof(12, plain,((![X3]:~(big_p(X3))|big_q(esk1_0))&(![X5]:~(big_q(X5))|big_p(esk2_0))),inference(skolemize,[status(esa)],[11])).
% fof(13, plain,![X3]:![X5]:((~(big_q(X5))|big_p(esk2_0))&(~(big_p(X3))|big_q(esk1_0))),inference(shift_quantors,[status(thm)],[12])).
% cnf(14,plain,(big_q(esk1_0)|~big_p(X1)),inference(split_conjunct,[status(thm)],[13])).
% cnf(15,plain,(big_p(esk2_0)|~big_q(X1)),inference(split_conjunct,[status(thm)],[13])).
% fof(16, negated_conjecture,((?[X1]:(big_p(X1)&~(big_r(X1)))|?[X2]:(big_q(X2)&~(big_s(X2))))&(![X1]:(~(big_p(X1))|big_r(X1))|![X2]:(~(big_q(X2))|big_s(X2)))),inference(fof_nnf,[status(thm)],[4])).
% fof(17, negated_conjecture,((?[X3]:(big_p(X3)&~(big_r(X3)))|?[X4]:(big_q(X4)&~(big_s(X4))))&(![X5]:(~(big_p(X5))|big_r(X5))|![X6]:(~(big_q(X6))|big_s(X6)))),inference(variable_rename,[status(thm)],[16])).
% fof(18, negated_conjecture,(((big_p(esk3_0)&~(big_r(esk3_0)))|(big_q(esk4_0)&~(big_s(esk4_0))))&(![X5]:(~(big_p(X5))|big_r(X5))|![X6]:(~(big_q(X6))|big_s(X6)))),inference(skolemize,[status(esa)],[17])).
% fof(19, negated_conjecture,![X5]:![X6]:(((~(big_q(X6))|big_s(X6))|(~(big_p(X5))|big_r(X5)))&((big_p(esk3_0)&~(big_r(esk3_0)))|(big_q(esk4_0)&~(big_s(esk4_0))))),inference(shift_quantors,[status(thm)],[18])).
% fof(20, negated_conjecture,![X5]:![X6]:(((~(big_q(X6))|big_s(X6))|(~(big_p(X5))|big_r(X5)))&(((big_q(esk4_0)|big_p(esk3_0))&(~(big_s(esk4_0))|big_p(esk3_0)))&((big_q(esk4_0)|~(big_r(esk3_0)))&(~(big_s(esk4_0))|~(big_r(esk3_0)))))),inference(distribute,[status(thm)],[19])).
% cnf(21,negated_conjecture,(~big_r(esk3_0)|~big_s(esk4_0)),inference(split_conjunct,[status(thm)],[20])).
% cnf(22,negated_conjecture,(big_q(esk4_0)|~big_r(esk3_0)),inference(split_conjunct,[status(thm)],[20])).
% cnf(23,negated_conjecture,(big_p(esk3_0)|~big_s(esk4_0)),inference(split_conjunct,[status(thm)],[20])).
% cnf(24,negated_conjecture,(big_p(esk3_0)|big_q(esk4_0)),inference(split_conjunct,[status(thm)],[20])).
% cnf(25,negated_conjecture,(big_r(X1)|big_s(X2)|~big_p(X1)|~big_q(X2)),inference(split_conjunct,[status(thm)],[20])).
% cnf(26,plain,(big_r(X2)|~big_q(X1)|~big_p(X2)),inference(csr,[status(thm)],[8,25])).
% cnf(27,plain,(big_s(X1)|~big_q(X1)|~big_p(X2)),inference(csr,[status(thm)],[9,26])).
% cnf(28,negated_conjecture,(big_p(esk2_0)|big_p(esk3_0)),inference(spm,[status(thm)],[15,24,theory(equality)])).
% cnf(30,negated_conjecture,(big_q(esk1_0)|big_p(esk3_0)),inference(spm,[status(thm)],[14,28,theory(equality)])).
% cnf(32,negated_conjecture,(big_q(esk1_0)),inference(csr,[status(thm)],[30,14])).
% cnf(33,negated_conjecture,(big_p(esk2_0)),inference(spm,[status(thm)],[15,32,theory(equality)])).
% cnf(34,negated_conjecture,(big_r(X1)|~big_p(X1)),inference(spm,[status(thm)],[26,32,theory(equality)])).
% cnf(36,negated_conjecture,(big_s(X1)|~big_q(X1)),inference(spm,[status(thm)],[27,33,theory(equality)])).
% cnf(38,negated_conjecture,(big_q(esk4_0)|~big_p(esk3_0)),inference(spm,[status(thm)],[22,34,theory(equality)])).
% cnf(39,negated_conjecture,(~big_s(esk4_0)|~big_p(esk3_0)),inference(spm,[status(thm)],[21,34,theory(equality)])).
% cnf(40,negated_conjecture,(~big_s(esk4_0)),inference(csr,[status(thm)],[39,23])).
% cnf(41,negated_conjecture,(big_q(esk4_0)),inference(csr,[status(thm)],[38,24])).
% cnf(44,negated_conjecture,(~big_q(esk4_0)),inference(spm,[status(thm)],[40,36,theory(equality)])).
% cnf(47,negated_conjecture,($false),inference(rw,[status(thm)],[44,41,theory(equality)])).
% cnf(48,negated_conjecture,($false),inference(cn,[status(thm)],[47,theory(equality)])).
% cnf(49,negated_conjecture,($false),48,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 24
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 24
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 5
% # Backward-rewritten : 3
% # Generated clauses : 11
% # ...of the previous two non-trivial : 10
% # Contextual simplify-reflections : 5
% # Paramodulations : 11
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 8
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 4
% # Current number of unprocessed clauses: 1
% # ...number of literals in the above : 1
% # Clause-clause subsumption calls (NU) : 8
% # Rec. Clause-clause subsumption calls : 8
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 15 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 5 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 11 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.007 s
% # System time : 0.004 s
% # Total time : 0.011 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/SystemOnTPTP10838/SYN056+1.tptp
%
%------------------------------------------------------------------------------