TSTP Solution File: SYN343+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN343+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 : art09.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:23: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/SystemOnTPTP14641/SYN343+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP14641/SYN343+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14641/SYN343+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 14737
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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]:?[X3]:![X4]:(((big_f(X1,X2)=>big_f(X4,X1))=>big_f(X1,X1))=>(big_f(X1,X1)&big_f(X2,X3))),file('/tmp/SRASS.s.p', church_46_16_2)).
% fof(2, negated_conjecture,~(?[X1]:?[X2]:?[X3]:![X4]:(((big_f(X1,X2)=>big_f(X4,X1))=>big_f(X1,X1))=>(big_f(X1,X1)&big_f(X2,X3)))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,![X1]:![X2]:![X3]:?[X4]:(((big_f(X1,X2)&~(big_f(X4,X1)))|big_f(X1,X1))&(~(big_f(X1,X1))|~(big_f(X2,X3)))),inference(fof_nnf,[status(thm)],[2])).
% fof(4, negated_conjecture,![X5]:![X6]:![X7]:?[X8]:(((big_f(X5,X6)&~(big_f(X8,X5)))|big_f(X5,X5))&(~(big_f(X5,X5))|~(big_f(X6,X7)))),inference(variable_rename,[status(thm)],[3])).
% fof(5, negated_conjecture,![X5]:![X6]:![X7]:(((big_f(X5,X6)&~(big_f(esk1_3(X5,X6,X7),X5)))|big_f(X5,X5))&(~(big_f(X5,X5))|~(big_f(X6,X7)))),inference(skolemize,[status(esa)],[4])).
% fof(6, negated_conjecture,![X5]:![X6]:![X7]:(((big_f(X5,X6)|big_f(X5,X5))&(~(big_f(esk1_3(X5,X6,X7),X5))|big_f(X5,X5)))&(~(big_f(X5,X5))|~(big_f(X6,X7)))),inference(distribute,[status(thm)],[5])).
% cnf(7,negated_conjecture,(~big_f(X1,X2)|~big_f(X3,X3)),inference(split_conjunct,[status(thm)],[6])).
% cnf(9,negated_conjecture,(big_f(X1,X1)|big_f(X1,X2)),inference(split_conjunct,[status(thm)],[6])).
% fof(10, plain,(~(epred1_0)<=>![X3]:~(big_f(X3,X3))),introduced(definition),['split']).
% cnf(11,plain,(epred1_0|~big_f(X3,X3)),inference(split_equiv,[status(thm)],[10])).
% fof(12, plain,(~(epred2_0)<=>![X2]:![X1]:~(big_f(X1,X2))),introduced(definition),['split']).
% cnf(13,plain,(epred2_0|~big_f(X1,X2)),inference(split_equiv,[status(thm)],[12])).
% cnf(14,negated_conjecture,(~epred2_0|~epred1_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[7,10,theory(equality)]),12,theory(equality)]),['split']).
% cnf(15,negated_conjecture,(big_f(X3,X3)),inference(ef,[status(thm)],[9,theory(equality)])).
% cnf(17,negated_conjecture,(epred1_0|big_f(X1,X2)),inference(spm,[status(thm)],[11,9,theory(equality)])).
% cnf(22,negated_conjecture,(epred1_0),inference(spm,[status(thm)],[11,17,theory(equality)])).
% cnf(24,negated_conjecture,(~epred2_0|$false),inference(rw,[status(thm)],[14,22,theory(equality)])).
% cnf(25,negated_conjecture,(~epred2_0),inference(cn,[status(thm)],[24,theory(equality)])).
% cnf(27,negated_conjecture,(epred2_0),inference(spm,[status(thm)],[13,15,theory(equality)])).
% cnf(30,negated_conjecture,($false),inference(rw,[status(thm)],[25,27,theory(equality)])).
% cnf(31,negated_conjecture,($false),inference(cn,[status(thm)],[30,theory(equality)])).
% cnf(32,negated_conjecture,($false),31,['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 : 1
% # Backward-rewritten : 5
% # Generated clauses : 12
% # ...of the previous two non-trivial : 13
% # Contextual simplify-reflections : 0
% # Paramodulations : 7
% # Factorizations : 2
% # Equation resolutions : 0
% # Current number of processed clauses: 3
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 15
% # Rec. Clause-clause subsumption calls : 15
% # Unit Clause-clause subsumption calls : 5
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 4 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 3 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 3 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.005 s
% # System time : 0.005 s
% # Total time : 0.010 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.08 CPU 0.17 WC
% FINAL PrfWatch: 0.08 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP14641/SYN343+1.tptp
%
%------------------------------------------------------------------------------