TSTP Solution File: SYN082+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN082+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:25:05 EST 2010
% Result : Theorem 1.09s
% Output : Solution 1.09s
% 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/SystemOnTPTP26645/SYN082+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP26645/SYN082+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26645/SYN082+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 26777
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, conjecture,![X1]:(big_f(X1,f(X1))<=>?[X2]:(![X3]:(big_f(X3,X2)=>big_f(X3,f(X1)))&big_f(X1,X2))),file('/tmp/SRASS.s.p', pel60)).
% fof(2, negated_conjecture,~(![X1]:(big_f(X1,f(X1))<=>?[X2]:(![X3]:(big_f(X3,X2)=>big_f(X3,f(X1)))&big_f(X1,X2)))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,?[X1]:((~(big_f(X1,f(X1)))|![X2]:(?[X3]:(big_f(X3,X2)&~(big_f(X3,f(X1))))|~(big_f(X1,X2))))&(big_f(X1,f(X1))|?[X2]:(![X3]:(~(big_f(X3,X2))|big_f(X3,f(X1)))&big_f(X1,X2)))),inference(fof_nnf,[status(thm)],[2])).
% fof(4, negated_conjecture,?[X4]:((~(big_f(X4,f(X4)))|![X5]:(?[X6]:(big_f(X6,X5)&~(big_f(X6,f(X4))))|~(big_f(X4,X5))))&(big_f(X4,f(X4))|?[X7]:(![X8]:(~(big_f(X8,X7))|big_f(X8,f(X4)))&big_f(X4,X7)))),inference(variable_rename,[status(thm)],[3])).
% fof(5, negated_conjecture,((~(big_f(esk1_0,f(esk1_0)))|![X5]:((big_f(esk2_1(X5),X5)&~(big_f(esk2_1(X5),f(esk1_0))))|~(big_f(esk1_0,X5))))&(big_f(esk1_0,f(esk1_0))|(![X8]:(~(big_f(X8,esk3_0))|big_f(X8,f(esk1_0)))&big_f(esk1_0,esk3_0)))),inference(skolemize,[status(esa)],[4])).
% fof(6, negated_conjecture,![X5]:![X8]:((((~(big_f(X8,esk3_0))|big_f(X8,f(esk1_0)))&big_f(esk1_0,esk3_0))|big_f(esk1_0,f(esk1_0)))&(((big_f(esk2_1(X5),X5)&~(big_f(esk2_1(X5),f(esk1_0))))|~(big_f(esk1_0,X5)))|~(big_f(esk1_0,f(esk1_0))))),inference(shift_quantors,[status(thm)],[5])).
% fof(7, negated_conjecture,![X5]:![X8]:((((~(big_f(X8,esk3_0))|big_f(X8,f(esk1_0)))|big_f(esk1_0,f(esk1_0)))&(big_f(esk1_0,esk3_0)|big_f(esk1_0,f(esk1_0))))&(((big_f(esk2_1(X5),X5)|~(big_f(esk1_0,X5)))|~(big_f(esk1_0,f(esk1_0))))&((~(big_f(esk2_1(X5),f(esk1_0)))|~(big_f(esk1_0,X5)))|~(big_f(esk1_0,f(esk1_0)))))),inference(distribute,[status(thm)],[6])).
% cnf(8,negated_conjecture,(~big_f(esk1_0,f(esk1_0))|~big_f(esk1_0,X1)|~big_f(esk2_1(X1),f(esk1_0))),inference(split_conjunct,[status(thm)],[7])).
% cnf(9,negated_conjecture,(big_f(esk2_1(X1),X1)|~big_f(esk1_0,f(esk1_0))|~big_f(esk1_0,X1)),inference(split_conjunct,[status(thm)],[7])).
% cnf(10,negated_conjecture,(big_f(esk1_0,f(esk1_0))|big_f(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[7])).
% cnf(11,negated_conjecture,(big_f(esk1_0,f(esk1_0))|big_f(X1,f(esk1_0))|~big_f(X1,esk3_0)),inference(split_conjunct,[status(thm)],[7])).
% cnf(13,negated_conjecture,(~big_f(esk1_0,f(esk1_0))),inference(spm,[status(thm)],[8,9,theory(equality)])).
% cnf(14,negated_conjecture,(big_f(esk1_0,esk3_0)),inference(sr,[status(thm)],[10,13,theory(equality)])).
% cnf(15,negated_conjecture,(big_f(esk1_0,f(esk1_0))),inference(spm,[status(thm)],[11,14,theory(equality)])).
% cnf(16,negated_conjecture,($false),inference(sr,[status(thm)],[15,13,theory(equality)])).
% cnf(17,negated_conjecture,($false),16,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 10
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 10
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 4
% # ...of the previous two non-trivial : 2
% # Contextual simplify-reflections : 0
% # Paramodulations : 3
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 5
% # Positive orientable unit clauses: 1
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 3
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 4
% # 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: 12 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 2 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 9 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.008 s
% # System time : 0.003 s
% # Total time : 0.011 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/SystemOnTPTP26645/SYN082+1.tptp
%
%------------------------------------------------------------------------------