TSTP Solution File: SYN054+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN054+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:17:10 EST 2010
% Result : Theorem 0.86s
% Output : Solution 0.86s
% 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/SystemOnTPTP15070/SYN054+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP15070/SYN054+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15070/SYN054+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 15166
% 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, axiom,![X1]:(big_p(X1)=>(big_q(X1)|big_r(X1))),file('/tmp/SRASS.s.p', pel24_2)).
% fof(2, axiom,(~(?[X1]:big_p(X1))=>?[X2]:big_q(X2)),file('/tmp/SRASS.s.p', pel24_3)).
% fof(3, axiom,~(?[X1]:(big_s(X1)&big_q(X1))),file('/tmp/SRASS.s.p', pel24_1)).
% fof(4, axiom,![X1]:((big_q(X1)|big_r(X1))=>big_s(X1)),file('/tmp/SRASS.s.p', pel24_4)).
% fof(5, conjecture,?[X1]:(big_p(X1)&big_r(X1)),file('/tmp/SRASS.s.p', pel24)).
% fof(6, negated_conjecture,~(?[X1]:(big_p(X1)&big_r(X1))),inference(assume_negation,[status(cth)],[5])).
% fof(7, plain,![X1]:(~(big_p(X1))|(big_q(X1)|big_r(X1))),inference(fof_nnf,[status(thm)],[1])).
% fof(8, plain,![X2]:(~(big_p(X2))|(big_q(X2)|big_r(X2))),inference(variable_rename,[status(thm)],[7])).
% cnf(9,plain,(big_r(X1)|big_q(X1)|~big_p(X1)),inference(split_conjunct,[status(thm)],[8])).
% fof(10, plain,(?[X1]:big_p(X1)|?[X2]:big_q(X2)),inference(fof_nnf,[status(thm)],[2])).
% fof(11, plain,(?[X3]:big_p(X3)|?[X4]:big_q(X4)),inference(variable_rename,[status(thm)],[10])).
% fof(12, plain,(big_p(esk1_0)|big_q(esk2_0)),inference(skolemize,[status(esa)],[11])).
% cnf(13,plain,(big_q(esk2_0)|big_p(esk1_0)),inference(split_conjunct,[status(thm)],[12])).
% fof(14, plain,![X1]:(~(big_s(X1))|~(big_q(X1))),inference(fof_nnf,[status(thm)],[3])).
% fof(15, plain,![X2]:(~(big_s(X2))|~(big_q(X2))),inference(variable_rename,[status(thm)],[14])).
% cnf(16,plain,(~big_q(X1)|~big_s(X1)),inference(split_conjunct,[status(thm)],[15])).
% fof(17, plain,![X1]:((~(big_q(X1))&~(big_r(X1)))|big_s(X1)),inference(fof_nnf,[status(thm)],[4])).
% fof(18, plain,![X2]:((~(big_q(X2))&~(big_r(X2)))|big_s(X2)),inference(variable_rename,[status(thm)],[17])).
% fof(19, plain,![X2]:((~(big_q(X2))|big_s(X2))&(~(big_r(X2))|big_s(X2))),inference(distribute,[status(thm)],[18])).
% cnf(21,plain,(big_s(X1)|~big_q(X1)),inference(split_conjunct,[status(thm)],[19])).
% fof(22, negated_conjecture,![X1]:(~(big_p(X1))|~(big_r(X1))),inference(fof_nnf,[status(thm)],[6])).
% fof(23, negated_conjecture,![X2]:(~(big_p(X2))|~(big_r(X2))),inference(variable_rename,[status(thm)],[22])).
% cnf(24,negated_conjecture,(~big_r(X1)|~big_p(X1)),inference(split_conjunct,[status(thm)],[23])).
% cnf(25,plain,(big_q(X1)|~big_p(X1)),inference(csr,[status(thm)],[9,24])).
% cnf(26,plain,(~big_q(X1)),inference(csr,[status(thm)],[16,21])).
% cnf(27,plain,(big_p(esk1_0)),inference(sr,[status(thm)],[13,26,theory(equality)])).
% cnf(28,plain,(~big_p(X1)),inference(sr,[status(thm)],[25,26,theory(equality)])).
% cnf(29,plain,($false),inference(sr,[status(thm)],[27,28,theory(equality)])).
% cnf(30,plain,($false),29,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 12
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 12
% # 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 : 2
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 4
% # Positive orientable unit clauses: 0
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 2
% # Current number of unprocessed clauses: 1
% # ...number of literals in the above : 2
% # Clause-clause subsumption calls (NU) : 2
% # Rec. Clause-clause subsumption calls : 2
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 5 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 0 leaves, 0.00+/-0.000 terms/leaf
% # Paramod-into index: 3 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.006 s
% # System time : 0.003 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/SystemOnTPTP15070/SYN054+1.tptp
%
%------------------------------------------------------------------------------