TSTP Solution File: SYN058+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN058+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 09:22:25 EST 2010
% Result : Theorem 1.10s
% Output : Solution 1.10s
% 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/SystemOnTPTP24551/SYN058+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP24551/SYN058+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24551/SYN058+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 24683
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,(?[X1]:big_s(X1)=>![X2]:(big_f(X2)=>big_g(X2))),file('/tmp/SRASS.s.p', pel28_3)).
% fof(2, axiom,![X1]:(big_p(X1)=>![X3]:big_q(X3)),file('/tmp/SRASS.s.p', pel28_1)).
% fof(3, axiom,(![X1]:(big_q(X1)|big_r(X1))=>?[X2]:(big_q(X2)&big_s(X2))),file('/tmp/SRASS.s.p', pel28_2)).
% fof(4, conjecture,![X1]:((big_p(X1)&big_f(X1))=>big_g(X1)),file('/tmp/SRASS.s.p', pel28)).
% fof(5, negated_conjecture,~(![X1]:((big_p(X1)&big_f(X1))=>big_g(X1))),inference(assume_negation,[status(cth)],[4])).
% fof(6, plain,(![X1]:~(big_s(X1))|![X2]:(~(big_f(X2))|big_g(X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(7, plain,(![X3]:~(big_s(X3))|![X4]:(~(big_f(X4))|big_g(X4))),inference(variable_rename,[status(thm)],[6])).
% fof(8, plain,![X3]:![X4]:((~(big_f(X4))|big_g(X4))|~(big_s(X3))),inference(shift_quantors,[status(thm)],[7])).
% cnf(9,plain,(big_g(X2)|~big_s(X1)|~big_f(X2)),inference(split_conjunct,[status(thm)],[8])).
% fof(10, plain,![X1]:(~(big_p(X1))|![X3]:big_q(X3)),inference(fof_nnf,[status(thm)],[2])).
% fof(11, plain,![X4]:(~(big_p(X4))|![X5]:big_q(X5)),inference(variable_rename,[status(thm)],[10])).
% fof(12, plain,![X4]:![X5]:(big_q(X5)|~(big_p(X4))),inference(shift_quantors,[status(thm)],[11])).
% cnf(13,plain,(big_q(X2)|~big_p(X1)),inference(split_conjunct,[status(thm)],[12])).
% fof(14, plain,(?[X1]:(~(big_q(X1))&~(big_r(X1)))|?[X2]:(big_q(X2)&big_s(X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(15, plain,(?[X3]:(~(big_q(X3))&~(big_r(X3)))|?[X4]:(big_q(X4)&big_s(X4))),inference(variable_rename,[status(thm)],[14])).
% fof(16, plain,((~(big_q(esk1_0))&~(big_r(esk1_0)))|(big_q(esk2_0)&big_s(esk2_0))),inference(skolemize,[status(esa)],[15])).
% fof(17, plain,(((big_q(esk2_0)|~(big_q(esk1_0)))&(big_s(esk2_0)|~(big_q(esk1_0))))&((big_q(esk2_0)|~(big_r(esk1_0)))&(big_s(esk2_0)|~(big_r(esk1_0))))),inference(distribute,[status(thm)],[16])).
% cnf(20,plain,(big_s(esk2_0)|~big_q(esk1_0)),inference(split_conjunct,[status(thm)],[17])).
% fof(22, negated_conjecture,?[X1]:((big_p(X1)&big_f(X1))&~(big_g(X1))),inference(fof_nnf,[status(thm)],[5])).
% fof(23, negated_conjecture,?[X2]:((big_p(X2)&big_f(X2))&~(big_g(X2))),inference(variable_rename,[status(thm)],[22])).
% fof(24, negated_conjecture,((big_p(esk3_0)&big_f(esk3_0))&~(big_g(esk3_0))),inference(skolemize,[status(esa)],[23])).
% cnf(25,negated_conjecture,(~big_g(esk3_0)),inference(split_conjunct,[status(thm)],[24])).
% cnf(26,negated_conjecture,(big_f(esk3_0)),inference(split_conjunct,[status(thm)],[24])).
% cnf(27,negated_conjecture,(big_p(esk3_0)),inference(split_conjunct,[status(thm)],[24])).
% cnf(28,negated_conjecture,(big_q(X1)),inference(spm,[status(thm)],[13,27,theory(equality)])).
% cnf(31,plain,(big_s(esk2_0)|$false),inference(rw,[status(thm)],[20,28,theory(equality)])).
% cnf(32,plain,(big_s(esk2_0)),inference(cn,[status(thm)],[31,theory(equality)])).
% cnf(37,plain,(big_g(X1)|~big_f(X1)),inference(spm,[status(thm)],[9,32,theory(equality)])).
% cnf(39,negated_conjecture,(~big_f(esk3_0)),inference(spm,[status(thm)],[25,37,theory(equality)])).
% cnf(40,negated_conjecture,($false),inference(rw,[status(thm)],[39,26,theory(equality)])).
% cnf(41,negated_conjecture,($false),inference(cn,[status(thm)],[40,theory(equality)])).
% cnf(42,negated_conjecture,($false),41,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 21
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 21
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 5
% # Generated clauses : 4
% # ...of the previous two non-trivial : 4
% # Contextual simplify-reflections : 0
% # Paramodulations : 4
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 6
% # Positive orientable unit clauses: 4
% # 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) : 1
% # Rec. Clause-clause subsumption calls : 1
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 10 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 5 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 8 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.008 s
% # System time : 0.004 s
% # Total time : 0.012 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP24551/SYN058+1.tptp
%
%------------------------------------------------------------------------------