TSTP Solution File: SYN349+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN349+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:24:08 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/SystemOnTPTP14900/SYN349+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP14900/SYN349+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14900/SYN349+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 14996
% 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, conjecture,?[X1]:![X2]:?[X3]:![X4]:((big_f(X1,X4)<=>big_f(X2,X4))=>(((big_f(X1,X4)<=>big_f(X4,X3))<=>big_f(X3,X4))<=>big_f(X4,X2))),file('/tmp/SRASS.s.p', church_46_17_5)).
% fof(2, negated_conjecture,~(?[X1]:![X2]:?[X3]:![X4]:((big_f(X1,X4)<=>big_f(X2,X4))=>(((big_f(X1,X4)<=>big_f(X4,X3))<=>big_f(X3,X4))<=>big_f(X4,X2)))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,![X1]:?[X2]:![X3]:?[X4]:(((~(big_f(X1,X4))|big_f(X2,X4))&(~(big_f(X2,X4))|big_f(X1,X4)))&((((((~(big_f(X1,X4))|~(big_f(X4,X3)))&(big_f(X1,X4)|big_f(X4,X3)))|~(big_f(X3,X4)))&(((~(big_f(X1,X4))|big_f(X4,X3))&(~(big_f(X4,X3))|big_f(X1,X4)))|big_f(X3,X4)))|~(big_f(X4,X2)))&(((((~(big_f(X1,X4))|~(big_f(X4,X3)))&(big_f(X1,X4)|big_f(X4,X3)))|big_f(X3,X4))&(~(big_f(X3,X4))|((~(big_f(X1,X4))|big_f(X4,X3))&(~(big_f(X4,X3))|big_f(X1,X4)))))|big_f(X4,X2)))),inference(fof_nnf,[status(thm)],[2])).
% fof(4, negated_conjecture,![X5]:?[X6]:![X7]:?[X8]:(((~(big_f(X5,X8))|big_f(X6,X8))&(~(big_f(X6,X8))|big_f(X5,X8)))&((((((~(big_f(X5,X8))|~(big_f(X8,X7)))&(big_f(X5,X8)|big_f(X8,X7)))|~(big_f(X7,X8)))&(((~(big_f(X5,X8))|big_f(X8,X7))&(~(big_f(X8,X7))|big_f(X5,X8)))|big_f(X7,X8)))|~(big_f(X8,X6)))&(((((~(big_f(X5,X8))|~(big_f(X8,X7)))&(big_f(X5,X8)|big_f(X8,X7)))|big_f(X7,X8))&(~(big_f(X7,X8))|((~(big_f(X5,X8))|big_f(X8,X7))&(~(big_f(X8,X7))|big_f(X5,X8)))))|big_f(X8,X6)))),inference(variable_rename,[status(thm)],[3])).
% fof(5, negated_conjecture,![X5]:![X7]:(((~(big_f(X5,esk2_2(X5,X7)))|big_f(esk1_1(X5),esk2_2(X5,X7)))&(~(big_f(esk1_1(X5),esk2_2(X5,X7)))|big_f(X5,esk2_2(X5,X7))))&((((((~(big_f(X5,esk2_2(X5,X7)))|~(big_f(esk2_2(X5,X7),X7)))&(big_f(X5,esk2_2(X5,X7))|big_f(esk2_2(X5,X7),X7)))|~(big_f(X7,esk2_2(X5,X7))))&(((~(big_f(X5,esk2_2(X5,X7)))|big_f(esk2_2(X5,X7),X7))&(~(big_f(esk2_2(X5,X7),X7))|big_f(X5,esk2_2(X5,X7))))|big_f(X7,esk2_2(X5,X7))))|~(big_f(esk2_2(X5,X7),esk1_1(X5))))&(((((~(big_f(X5,esk2_2(X5,X7)))|~(big_f(esk2_2(X5,X7),X7)))&(big_f(X5,esk2_2(X5,X7))|big_f(esk2_2(X5,X7),X7)))|big_f(X7,esk2_2(X5,X7)))&(~(big_f(X7,esk2_2(X5,X7)))|((~(big_f(X5,esk2_2(X5,X7)))|big_f(esk2_2(X5,X7),X7))&(~(big_f(esk2_2(X5,X7),X7))|big_f(X5,esk2_2(X5,X7))))))|big_f(esk2_2(X5,X7),esk1_1(X5))))),inference(skolemize,[status(esa)],[4])).
% fof(6, negated_conjecture,![X5]:![X7]:(((~(big_f(X5,esk2_2(X5,X7)))|big_f(esk1_1(X5),esk2_2(X5,X7)))&(~(big_f(esk1_1(X5),esk2_2(X5,X7)))|big_f(X5,esk2_2(X5,X7))))&((((((~(big_f(X5,esk2_2(X5,X7)))|~(big_f(esk2_2(X5,X7),X7)))|~(big_f(X7,esk2_2(X5,X7))))|~(big_f(esk2_2(X5,X7),esk1_1(X5))))&(((big_f(X5,esk2_2(X5,X7))|big_f(esk2_2(X5,X7),X7))|~(big_f(X7,esk2_2(X5,X7))))|~(big_f(esk2_2(X5,X7),esk1_1(X5)))))&((((~(big_f(X5,esk2_2(X5,X7)))|big_f(esk2_2(X5,X7),X7))|big_f(X7,esk2_2(X5,X7)))|~(big_f(esk2_2(X5,X7),esk1_1(X5))))&(((~(big_f(esk2_2(X5,X7),X7))|big_f(X5,esk2_2(X5,X7)))|big_f(X7,esk2_2(X5,X7)))|~(big_f(esk2_2(X5,X7),esk1_1(X5))))))&(((((~(big_f(X5,esk2_2(X5,X7)))|~(big_f(esk2_2(X5,X7),X7)))|big_f(X7,esk2_2(X5,X7)))|big_f(esk2_2(X5,X7),esk1_1(X5)))&(((big_f(X5,esk2_2(X5,X7))|big_f(esk2_2(X5,X7),X7))|big_f(X7,esk2_2(X5,X7)))|big_f(esk2_2(X5,X7),esk1_1(X5))))&((((~(big_f(X5,esk2_2(X5,X7)))|big_f(esk2_2(X5,X7),X7))|~(big_f(X7,esk2_2(X5,X7))))|big_f(esk2_2(X5,X7),esk1_1(X5)))&(((~(big_f(esk2_2(X5,X7),X7))|big_f(X5,esk2_2(X5,X7)))|~(big_f(X7,esk2_2(X5,X7))))|big_f(esk2_2(X5,X7),esk1_1(X5))))))),inference(distribute,[status(thm)],[5])).
% cnf(8,negated_conjecture,(big_f(esk2_2(X1,X2),esk1_1(X1))|big_f(esk2_2(X1,X2),X2)|~big_f(X2,esk2_2(X1,X2))|~big_f(X1,esk2_2(X1,X2))),inference(split_conjunct,[status(thm)],[6])).
% cnf(9,negated_conjecture,(big_f(esk2_2(X1,X2),esk1_1(X1))|big_f(X2,esk2_2(X1,X2))|big_f(esk2_2(X1,X2),X2)|big_f(X1,esk2_2(X1,X2))),inference(split_conjunct,[status(thm)],[6])).
% cnf(11,negated_conjecture,(big_f(X2,esk2_2(X1,X2))|big_f(X1,esk2_2(X1,X2))|~big_f(esk2_2(X1,X2),esk1_1(X1))|~big_f(esk2_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[6])).
% cnf(14,negated_conjecture,(~big_f(esk2_2(X1,X2),esk1_1(X1))|~big_f(X2,esk2_2(X1,X2))|~big_f(esk2_2(X1,X2),X2)|~big_f(X1,esk2_2(X1,X2))),inference(split_conjunct,[status(thm)],[6])).
% cnf(15,negated_conjecture,(big_f(X1,esk2_2(X1,X2))|~big_f(esk1_1(X1),esk2_2(X1,X2))),inference(split_conjunct,[status(thm)],[6])).
% cnf(16,negated_conjecture,(big_f(esk1_1(X1),esk2_2(X1,X2))|~big_f(X1,esk2_2(X1,X2))),inference(split_conjunct,[status(thm)],[6])).
% cnf(18,negated_conjecture,(big_f(esk1_1(X3),esk2_2(X3,esk1_1(X3)))|big_f(X3,esk2_2(X3,esk1_1(X3)))|big_f(esk2_2(X3,esk1_1(X3)),esk1_1(X3))),inference(ef,[status(thm)],[9,theory(equality)])).
% cnf(22,negated_conjecture,(big_f(esk2_2(X1,esk1_1(X1)),esk1_1(X1))|~big_f(X1,esk2_2(X1,esk1_1(X1)))),inference(spm,[status(thm)],[8,16,theory(equality)])).
% cnf(30,negated_conjecture,(~big_f(esk1_1(X1),esk2_2(X1,esk1_1(X1)))|~big_f(X1,esk2_2(X1,esk1_1(X1)))|~big_f(esk2_2(X1,esk1_1(X1)),esk1_1(X1))),inference(spm,[status(thm)],[14,22,theory(equality)])).
% cnf(33,negated_conjecture,(~big_f(esk1_1(X1),esk2_2(X1,esk1_1(X1)))|~big_f(X1,esk2_2(X1,esk1_1(X1)))),inference(csr,[status(thm)],[30,22])).
% cnf(34,negated_conjecture,(~big_f(esk1_1(X1),esk2_2(X1,esk1_1(X1)))),inference(csr,[status(thm)],[33,15])).
% cnf(35,negated_conjecture,(~big_f(X1,esk2_2(X1,esk1_1(X1)))),inference(spm,[status(thm)],[34,16,theory(equality)])).
% cnf(36,negated_conjecture,(big_f(X3,esk2_2(X3,esk1_1(X3)))|big_f(esk2_2(X3,esk1_1(X3)),esk1_1(X3))),inference(sr,[status(thm)],[18,34,theory(equality)])).
% cnf(37,negated_conjecture,(big_f(esk2_2(X3,esk1_1(X3)),esk1_1(X3))),inference(csr,[status(thm)],[36,22])).
% cnf(42,negated_conjecture,(big_f(esk1_1(X1),esk2_2(X1,esk1_1(X1)))|big_f(X1,esk2_2(X1,esk1_1(X1)))|~big_f(esk2_2(X1,esk1_1(X1)),esk1_1(X1))),inference(spm,[status(thm)],[11,37,theory(equality)])).
% cnf(49,negated_conjecture,(big_f(esk1_1(X1),esk2_2(X1,esk1_1(X1)))|big_f(X1,esk2_2(X1,esk1_1(X1)))|$false),inference(rw,[status(thm)],[42,37,theory(equality)])).
% cnf(50,negated_conjecture,(big_f(esk1_1(X1),esk2_2(X1,esk1_1(X1)))|big_f(X1,esk2_2(X1,esk1_1(X1)))),inference(cn,[status(thm)],[49,theory(equality)])).
% cnf(51,negated_conjecture,(big_f(X1,esk2_2(X1,esk1_1(X1)))),inference(sr,[status(thm)],[50,34,theory(equality)])).
% cnf(56,negated_conjecture,($false),inference(rw,[status(thm)],[35,51,theory(equality)])).
% cnf(57,negated_conjecture,($false),inference(cn,[status(thm)],[56,theory(equality)])).
% cnf(58,negated_conjecture,($false),57,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 26
% # ...of these trivial : 1
% # ...subsumed : 0
% # ...remaining for further processing: 25
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 0
% # Generated clauses : 23
% # ...of the previous two non-trivial : 9
% # Contextual simplify-reflections : 3
% # Paramodulations : 21
% # Factorizations : 2
% # Equation resolutions : 0
% # Current number of processed clauses: 13
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 10
% # Current number of unprocessed clauses: 1
% # ...number of literals in the above : 2
% # Clause-clause subsumption calls (NU) : 111
% # Rec. Clause-clause subsumption calls : 47
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 11 leaves, 1.64+/-0.881 terms/leaf
% # Paramod-from index: 5 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 10 leaves, 1.30+/-0.458 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.001 s
% # Total time : 0.011 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/SystemOnTPTP14900/SYN349+1.tptp
%
%------------------------------------------------------------------------------