TSTP Solution File: SYN361+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN361+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 : art03.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:25:26 EST 2010
% Result : Theorem 0.87s
% Output : Solution 0.87s
% 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/SystemOnTPTP31031/SYN361+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP31031/SYN361+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31031/SYN361+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 31127
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.009 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, conjecture,(((?[X1]:![X2]:big_p(X2,X1)&![X2]:(big_s(X2)=>?[X3]:big_q(X3,X2)))&![X2]:![X3]:(big_p(X2,X3)=>~(big_q(X2,X3))))=>?[X4]:~(big_s(X4))),file('/tmp/SRASS.s.p', x2112)).
% fof(2, negated_conjecture,~((((?[X1]:![X2]:big_p(X2,X1)&![X2]:(big_s(X2)=>?[X3]:big_q(X3,X2)))&![X2]:![X3]:(big_p(X2,X3)=>~(big_q(X2,X3))))=>?[X4]:~(big_s(X4)))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,~((((?[X1]:![X2]:big_p(X2,X1)&![X2]:(big_s(X2)=>?[X3]:big_q(X3,X2)))&![X2]:![X3]:(big_p(X2,X3)=>~(big_q(X2,X3))))=>?[X4]:~(big_s(X4)))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(4, negated_conjecture,(((?[X1]:![X2]:big_p(X2,X1)&![X2]:(~(big_s(X2))|?[X3]:big_q(X3,X2)))&![X2]:![X3]:(~(big_p(X2,X3))|~(big_q(X2,X3))))&![X4]:big_s(X4)),inference(fof_nnf,[status(thm)],[3])).
% fof(5, negated_conjecture,(((?[X5]:![X6]:big_p(X6,X5)&![X7]:(~(big_s(X7))|?[X8]:big_q(X8,X7)))&![X9]:![X10]:(~(big_p(X9,X10))|~(big_q(X9,X10))))&![X11]:big_s(X11)),inference(variable_rename,[status(thm)],[4])).
% fof(6, negated_conjecture,(((![X6]:big_p(X6,esk1_0)&![X7]:(~(big_s(X7))|big_q(esk2_1(X7),X7)))&![X9]:![X10]:(~(big_p(X9,X10))|~(big_q(X9,X10))))&![X11]:big_s(X11)),inference(skolemize,[status(esa)],[5])).
% fof(7, negated_conjecture,![X6]:![X7]:![X9]:![X10]:![X11]:(big_s(X11)&((~(big_p(X9,X10))|~(big_q(X9,X10)))&((~(big_s(X7))|big_q(esk2_1(X7),X7))&big_p(X6,esk1_0)))),inference(shift_quantors,[status(thm)],[6])).
% cnf(8,negated_conjecture,(big_p(X1,esk1_0)),inference(split_conjunct,[status(thm)],[7])).
% cnf(9,negated_conjecture,(big_q(esk2_1(X1),X1)|~big_s(X1)),inference(split_conjunct,[status(thm)],[7])).
% cnf(10,negated_conjecture,(~big_q(X1,X2)|~big_p(X1,X2)),inference(split_conjunct,[status(thm)],[7])).
% cnf(11,negated_conjecture,(big_s(X1)),inference(split_conjunct,[status(thm)],[7])).
% cnf(12,negated_conjecture,(big_q(esk2_1(X1),X1)|$false),inference(rw,[status(thm)],[9,11,theory(equality)]),['unfolding']).
% cnf(13,negated_conjecture,(~big_p(esk2_1(X1),X1)),inference(spm,[status(thm)],[10,12,theory(equality)])).
% cnf(14,negated_conjecture,($false),inference(spm,[status(thm)],[13,8,theory(equality)])).
% cnf(15,negated_conjecture,($false),14,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 7
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 7
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 2
% # ...of the previous two non-trivial : 1
% # Contextual simplify-reflections : 0
% # Paramodulations : 2
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 4
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 1
% # 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 : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 8 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 2 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 6 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.008 s
% # System time : 0.001 s
% # Total time : 0.009 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.16 WC
% FINAL PrfWatch: 0.09 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP31031/SYN361+1.tptp
%
%------------------------------------------------------------------------------