TSTP Solution File: SYN068+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN068+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:23:32 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/SystemOnTPTP25598/SYN068+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP25598/SYN068+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25598/SYN068+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 25730
% 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_f(X1)=>(?[X2]:(big_g(X2)&big_h(X1,X2))&?[X3]:(big_g(X3)&~(big_h(X1,X3))))),file('/tmp/SRASS.s.p', pel44_1)).
% fof(2, axiom,?[X1]:(big_j(X1)&![X2]:(big_g(X2)=>big_h(X1,X2))),file('/tmp/SRASS.s.p', pel44_2)).
% fof(3, conjecture,?[X1]:(big_j(X1)&~(big_f(X1))),file('/tmp/SRASS.s.p', pel44)).
% fof(4, negated_conjecture,~(?[X1]:(big_j(X1)&~(big_f(X1)))),inference(assume_negation,[status(cth)],[3])).
% fof(5, plain,![X1]:(big_f(X1)=>(?[X2]:(big_g(X2)&big_h(X1,X2))&?[X3]:(big_g(X3)&~(big_h(X1,X3))))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(6, negated_conjecture,~(?[X1]:(big_j(X1)&~(big_f(X1)))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(7, plain,![X1]:(~(big_f(X1))|(?[X2]:(big_g(X2)&big_h(X1,X2))&?[X3]:(big_g(X3)&~(big_h(X1,X3))))),inference(fof_nnf,[status(thm)],[5])).
% fof(8, plain,![X4]:(~(big_f(X4))|(?[X5]:(big_g(X5)&big_h(X4,X5))&?[X6]:(big_g(X6)&~(big_h(X4,X6))))),inference(variable_rename,[status(thm)],[7])).
% fof(9, plain,![X4]:(~(big_f(X4))|((big_g(esk1_1(X4))&big_h(X4,esk1_1(X4)))&(big_g(esk2_1(X4))&~(big_h(X4,esk2_1(X4)))))),inference(skolemize,[status(esa)],[8])).
% fof(10, plain,![X4]:(((big_g(esk1_1(X4))|~(big_f(X4)))&(big_h(X4,esk1_1(X4))|~(big_f(X4))))&((big_g(esk2_1(X4))|~(big_f(X4)))&(~(big_h(X4,esk2_1(X4)))|~(big_f(X4))))),inference(distribute,[status(thm)],[9])).
% cnf(11,plain,(~big_f(X1)|~big_h(X1,esk2_1(X1))),inference(split_conjunct,[status(thm)],[10])).
% cnf(12,plain,(big_g(esk2_1(X1))|~big_f(X1)),inference(split_conjunct,[status(thm)],[10])).
% fof(15, plain,?[X1]:(big_j(X1)&![X2]:(~(big_g(X2))|big_h(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(16, plain,?[X3]:(big_j(X3)&![X4]:(~(big_g(X4))|big_h(X3,X4))),inference(variable_rename,[status(thm)],[15])).
% fof(17, plain,(big_j(esk3_0)&![X4]:(~(big_g(X4))|big_h(esk3_0,X4))),inference(skolemize,[status(esa)],[16])).
% fof(18, plain,![X4]:((~(big_g(X4))|big_h(esk3_0,X4))&big_j(esk3_0)),inference(shift_quantors,[status(thm)],[17])).
% cnf(19,plain,(big_j(esk3_0)),inference(split_conjunct,[status(thm)],[18])).
% cnf(20,plain,(big_h(esk3_0,X1)|~big_g(X1)),inference(split_conjunct,[status(thm)],[18])).
% fof(21, negated_conjecture,![X1]:(~(big_j(X1))|big_f(X1)),inference(fof_nnf,[status(thm)],[6])).
% fof(22, negated_conjecture,![X2]:(~(big_j(X2))|big_f(X2)),inference(variable_rename,[status(thm)],[21])).
% cnf(23,negated_conjecture,(big_f(X1)|~big_j(X1)),inference(split_conjunct,[status(thm)],[22])).
% cnf(24,negated_conjecture,(big_f(esk3_0)),inference(spm,[status(thm)],[23,19,theory(equality)])).
% cnf(25,plain,(~big_f(esk3_0)|~big_g(esk2_1(esk3_0))),inference(spm,[status(thm)],[11,20,theory(equality)])).
% cnf(26,plain,($false|~big_g(esk2_1(esk3_0))),inference(rw,[status(thm)],[25,24,theory(equality)])).
% cnf(27,plain,(~big_g(esk2_1(esk3_0))),inference(cn,[status(thm)],[26,theory(equality)])).
% cnf(28,plain,(~big_f(esk3_0)),inference(spm,[status(thm)],[27,12,theory(equality)])).
% cnf(29,plain,($false),inference(rw,[status(thm)],[28,24,theory(equality)])).
% cnf(30,plain,($false),inference(cn,[status(thm)],[29,theory(equality)])).
% cnf(31,plain,($false),30,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 16
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 16
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 3
% # ...of the previous two non-trivial : 2
% # Contextual simplify-reflections : 0
% # Paramodulations : 3
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 9
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 6
% # 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: 16 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 6 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 13 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.007 s
% # System time : 0.005 s
% # Total time : 0.012 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.17 WC
% FINAL PrfWatch: 0.11 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP25598/SYN068+1.tptp
%
%------------------------------------------------------------------------------