TSTP Solution File: SYN084+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN084+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:20:31 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP11874/SYN084+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP11874/SYN084+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11874/SYN084+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 11970
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, conjecture,(![X1]:((big_p(a)&(big_p(X1)=>big_p(f(X1))))=>big_p(f(f(X1))))<=>![X2]:(((~(big_p(a))|big_p(X2))|big_p(f(f(X2))))&((~(big_p(a))|~(big_p(f(X2))))|big_p(f(f(X2)))))),file('/tmp/SRASS.s.p', pel62)).
% fof(2, negated_conjecture,~((![X1]:((big_p(a)&(big_p(X1)=>big_p(f(X1))))=>big_p(f(f(X1))))<=>![X2]:(((~(big_p(a))|big_p(X2))|big_p(f(f(X2))))&((~(big_p(a))|~(big_p(f(X2))))|big_p(f(f(X2))))))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,~((![X1]:((big_p(a)&(big_p(X1)=>big_p(f(X1))))=>big_p(f(f(X1))))<=>![X2]:(((~(big_p(a))|big_p(X2))|big_p(f(f(X2))))&((~(big_p(a))|~(big_p(f(X2))))|big_p(f(f(X2))))))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(4, negated_conjecture,((?[X1]:((big_p(a)&(~(big_p(X1))|big_p(f(X1))))&~(big_p(f(f(X1)))))|?[X2]:(((big_p(a)&~(big_p(X2)))&~(big_p(f(f(X2)))))|((big_p(a)&big_p(f(X2)))&~(big_p(f(f(X2)))))))&(![X1]:((~(big_p(a))|(big_p(X1)&~(big_p(f(X1)))))|big_p(f(f(X1))))|![X2]:(((~(big_p(a))|big_p(X2))|big_p(f(f(X2))))&((~(big_p(a))|~(big_p(f(X2))))|big_p(f(f(X2))))))),inference(fof_nnf,[status(thm)],[3])).
% fof(5, negated_conjecture,((?[X3]:((big_p(a)&(~(big_p(X3))|big_p(f(X3))))&~(big_p(f(f(X3)))))|?[X4]:(((big_p(a)&~(big_p(X4)))&~(big_p(f(f(X4)))))|((big_p(a)&big_p(f(X4)))&~(big_p(f(f(X4)))))))&(![X5]:((~(big_p(a))|(big_p(X5)&~(big_p(f(X5)))))|big_p(f(f(X5))))|![X6]:(((~(big_p(a))|big_p(X6))|big_p(f(f(X6))))&((~(big_p(a))|~(big_p(f(X6))))|big_p(f(f(X6))))))),inference(variable_rename,[status(thm)],[4])).
% fof(6, negated_conjecture,((((big_p(a)&(~(big_p(esk1_0))|big_p(f(esk1_0))))&~(big_p(f(f(esk1_0)))))|(((big_p(a)&~(big_p(esk2_0)))&~(big_p(f(f(esk2_0)))))|((big_p(a)&big_p(f(esk2_0)))&~(big_p(f(f(esk2_0)))))))&(![X5]:((~(big_p(a))|(big_p(X5)&~(big_p(f(X5)))))|big_p(f(f(X5))))|![X6]:(((~(big_p(a))|big_p(X6))|big_p(f(f(X6))))&((~(big_p(a))|~(big_p(f(X6))))|big_p(f(f(X6))))))),inference(skolemize,[status(esa)],[5])).
% fof(7, negated_conjecture,![X5]:![X6]:(((((~(big_p(a))|big_p(X6))|big_p(f(f(X6))))&((~(big_p(a))|~(big_p(f(X6))))|big_p(f(f(X6)))))|((~(big_p(a))|(big_p(X5)&~(big_p(f(X5)))))|big_p(f(f(X5)))))&(((big_p(a)&(~(big_p(esk1_0))|big_p(f(esk1_0))))&~(big_p(f(f(esk1_0)))))|(((big_p(a)&~(big_p(esk2_0)))&~(big_p(f(f(esk2_0)))))|((big_p(a)&big_p(f(esk2_0)))&~(big_p(f(f(esk2_0)))))))),inference(shift_quantors,[status(thm)],[6])).
% fof(8, negated_conjecture,![X5]:![X6]:((((((big_p(X5)|~(big_p(a)))|big_p(f(f(X5))))|((~(big_p(a))|big_p(X6))|big_p(f(f(X6)))))&(((~(big_p(f(X5)))|~(big_p(a)))|big_p(f(f(X5))))|((~(big_p(a))|big_p(X6))|big_p(f(f(X6))))))&((((big_p(X5)|~(big_p(a)))|big_p(f(f(X5))))|((~(big_p(a))|~(big_p(f(X6))))|big_p(f(f(X6)))))&(((~(big_p(f(X5)))|~(big_p(a)))|big_p(f(f(X5))))|((~(big_p(a))|~(big_p(f(X6))))|big_p(f(f(X6)))))))&((((((((big_p(a)|big_p(a))|big_p(a))&((big_p(f(esk2_0))|big_p(a))|big_p(a)))&((~(big_p(f(f(esk2_0))))|big_p(a))|big_p(a)))&((((big_p(a)|~(big_p(esk2_0)))|big_p(a))&((big_p(f(esk2_0))|~(big_p(esk2_0)))|big_p(a)))&((~(big_p(f(f(esk2_0))))|~(big_p(esk2_0)))|big_p(a))))&((((big_p(a)|~(big_p(f(f(esk2_0)))))|big_p(a))&((big_p(f(esk2_0))|~(big_p(f(f(esk2_0)))))|big_p(a)))&((~(big_p(f(f(esk2_0))))|~(big_p(f(f(esk2_0)))))|big_p(a))))&((((((big_p(a)|big_p(a))|(~(big_p(esk1_0))|big_p(f(esk1_0))))&((big_p(f(esk2_0))|big_p(a))|(~(big_p(esk1_0))|big_p(f(esk1_0)))))&((~(big_p(f(f(esk2_0))))|big_p(a))|(~(big_p(esk1_0))|big_p(f(esk1_0)))))&((((big_p(a)|~(big_p(esk2_0)))|(~(big_p(esk1_0))|big_p(f(esk1_0))))&((big_p(f(esk2_0))|~(big_p(esk2_0)))|(~(big_p(esk1_0))|big_p(f(esk1_0)))))&((~(big_p(f(f(esk2_0))))|~(big_p(esk2_0)))|(~(big_p(esk1_0))|big_p(f(esk1_0))))))&((((big_p(a)|~(big_p(f(f(esk2_0)))))|(~(big_p(esk1_0))|big_p(f(esk1_0))))&((big_p(f(esk2_0))|~(big_p(f(f(esk2_0)))))|(~(big_p(esk1_0))|big_p(f(esk1_0)))))&((~(big_p(f(f(esk2_0))))|~(big_p(f(f(esk2_0)))))|(~(big_p(esk1_0))|big_p(f(esk1_0)))))))&((((((big_p(a)|big_p(a))|~(big_p(f(f(esk1_0)))))&((big_p(f(esk2_0))|big_p(a))|~(big_p(f(f(esk1_0))))))&((~(big_p(f(f(esk2_0))))|big_p(a))|~(big_p(f(f(esk1_0))))))&((((big_p(a)|~(big_p(esk2_0)))|~(big_p(f(f(esk1_0)))))&((big_p(f(esk2_0))|~(big_p(esk2_0)))|~(big_p(f(f(esk1_0))))))&((~(big_p(f(f(esk2_0))))|~(big_p(esk2_0)))|~(big_p(f(f(esk1_0)))))))&((((big_p(a)|~(big_p(f(f(esk2_0)))))|~(big_p(f(f(esk1_0)))))&((big_p(f(esk2_0))|~(big_p(f(f(esk2_0)))))|~(big_p(f(f(esk1_0))))))&((~(big_p(f(f(esk2_0))))|~(big_p(f(f(esk2_0)))))|~(big_p(f(f(esk1_0))))))))),inference(distribute,[status(thm)],[7])).
% cnf(9,negated_conjecture,(~big_p(f(f(esk1_0)))|~big_p(f(f(esk2_0)))|~big_p(f(f(esk2_0)))),inference(split_conjunct,[status(thm)],[8])).
% cnf(13,negated_conjecture,(big_p(f(esk2_0))|~big_p(f(f(esk1_0)))|~big_p(esk2_0)),inference(split_conjunct,[status(thm)],[8])).
% cnf(18,negated_conjecture,(big_p(f(esk1_0))|~big_p(esk1_0)|~big_p(f(f(esk2_0)))|~big_p(f(f(esk2_0)))),inference(split_conjunct,[status(thm)],[8])).
% cnf(22,negated_conjecture,(big_p(f(esk1_0))|big_p(f(esk2_0))|~big_p(esk1_0)|~big_p(esk2_0)),inference(split_conjunct,[status(thm)],[8])).
% cnf(35,negated_conjecture,(big_p(a)|big_p(a)|big_p(a)),inference(split_conjunct,[status(thm)],[8])).
% cnf(36,negated_conjecture,(big_p(f(f(X1)))|big_p(f(f(X2)))|~big_p(f(X1))|~big_p(a)|~big_p(a)|~big_p(f(X2))),inference(split_conjunct,[status(thm)],[8])).
% cnf(39,negated_conjecture,(big_p(f(f(X1)))|big_p(X1)|big_p(f(f(X2)))|big_p(X2)|~big_p(a)|~big_p(a)),inference(split_conjunct,[status(thm)],[8])).
% cnf(62,negated_conjecture,(big_p(X2)|big_p(X1)|big_p(f(f(X2)))|big_p(f(f(X1)))|$false),inference(rw,[status(thm)],[39,35,theory(equality)])).
% cnf(63,negated_conjecture,(big_p(X2)|big_p(X1)|big_p(f(f(X2)))|big_p(f(f(X1)))),inference(cn,[status(thm)],[62,theory(equality)])).
% cnf(64,negated_conjecture,(big_p(f(f(X3)))|big_p(X3)),inference(ef,[status(thm)],[63,theory(equality)])).
% cnf(79,negated_conjecture,(big_p(f(f(X2)))|big_p(f(f(X1)))|$false|~big_p(f(X2))|~big_p(f(X1))),inference(rw,[status(thm)],[36,35,theory(equality)])).
% cnf(80,negated_conjecture,(big_p(f(f(X2)))|big_p(f(f(X1)))|~big_p(f(X2))|~big_p(f(X1))),inference(cn,[status(thm)],[79,theory(equality)])).
% cnf(81,negated_conjecture,(big_p(f(f(X1)))|big_p(f(f(esk1_0)))|big_p(f(esk2_0))|~big_p(f(X1))|~big_p(esk1_0)|~big_p(esk2_0)),inference(spm,[status(thm)],[80,22,theory(equality)])).
% cnf(85,negated_conjecture,(big_p(f(esk2_0))|big_p(esk1_0)|~big_p(esk2_0)),inference(spm,[status(thm)],[13,64,theory(equality)])).
% cnf(86,negated_conjecture,(big_p(esk1_0)|~big_p(f(f(esk2_0)))),inference(spm,[status(thm)],[9,64,theory(equality)])).
% cnf(88,negated_conjecture,(big_p(esk1_0)|big_p(esk2_0)),inference(spm,[status(thm)],[86,64,theory(equality)])).
% cnf(89,negated_conjecture,(big_p(f(esk2_0))|big_p(esk1_0)),inference(csr,[status(thm)],[85,88])).
% cnf(90,negated_conjecture,(big_p(f(f(X1)))|big_p(f(f(esk2_0)))|big_p(esk1_0)|~big_p(f(X1))),inference(spm,[status(thm)],[80,89,theory(equality)])).
% cnf(91,negated_conjecture,(big_p(f(f(esk1_0)))|big_p(f(f(X1)))|big_p(f(esk2_0))|~big_p(f(X1))|~big_p(esk2_0)),inference(csr,[status(thm)],[81,64])).
% cnf(92,negated_conjecture,(big_p(f(f(X1)))|big_p(f(esk2_0))|~big_p(f(X1))|~big_p(esk2_0)),inference(csr,[status(thm)],[91,13])).
% cnf(94,negated_conjecture,(big_p(f(esk2_0))|~big_p(esk2_0)|~big_p(f(esk1_0))),inference(spm,[status(thm)],[13,92,theory(equality)])).
% cnf(100,negated_conjecture,(big_p(f(f(X1)))|big_p(esk1_0)|~big_p(f(X1))),inference(csr,[status(thm)],[90,86])).
% cnf(106,negated_conjecture,(big_p(esk1_0)|~big_p(f(esk2_0))),inference(spm,[status(thm)],[86,100,theory(equality)])).
% cnf(107,negated_conjecture,(big_p(esk1_0)),inference(csr,[status(thm)],[106,89])).
% cnf(111,negated_conjecture,(big_p(f(esk1_0))|~big_p(f(f(esk2_0)))|$false),inference(rw,[status(thm)],[18,107,theory(equality)])).
% cnf(112,negated_conjecture,(big_p(f(esk1_0))|~big_p(f(f(esk2_0)))),inference(cn,[status(thm)],[111,theory(equality)])).
% cnf(113,negated_conjecture,(big_p(f(esk2_0))|big_p(f(esk1_0))|$false|~big_p(esk2_0)),inference(rw,[status(thm)],[22,107,theory(equality)])).
% cnf(114,negated_conjecture,(big_p(f(esk2_0))|big_p(f(esk1_0))|~big_p(esk2_0)),inference(cn,[status(thm)],[113,theory(equality)])).
% cnf(115,negated_conjecture,(big_p(f(esk1_0))|big_p(esk2_0)),inference(spm,[status(thm)],[112,64,theory(equality)])).
% cnf(117,negated_conjecture,(big_p(f(f(X1)))|big_p(f(f(esk1_0)))|big_p(esk2_0)|~big_p(f(X1))),inference(spm,[status(thm)],[80,115,theory(equality)])).
% cnf(119,negated_conjecture,(big_p(f(esk2_0))|big_p(f(esk1_0))),inference(csr,[status(thm)],[114,115])).
% cnf(121,negated_conjecture,(big_p(f(esk2_0))|~big_p(esk2_0)),inference(spm,[status(thm)],[94,119,theory(equality)])).
% cnf(136,negated_conjecture,(big_p(f(f(esk1_0)))|big_p(esk2_0)),inference(spm,[status(thm)],[117,115,theory(equality)])).
% cnf(143,negated_conjecture,(big_p(esk2_0)|~big_p(f(f(esk2_0)))),inference(spm,[status(thm)],[9,136,theory(equality)])).
% cnf(144,negated_conjecture,(big_p(esk2_0)),inference(csr,[status(thm)],[143,64])).
% cnf(146,negated_conjecture,(big_p(f(esk2_0))|$false),inference(rw,[status(thm)],[121,144,theory(equality)])).
% cnf(147,negated_conjecture,(big_p(f(esk2_0))),inference(cn,[status(thm)],[146,theory(equality)])).
% cnf(150,negated_conjecture,(big_p(f(f(X1)))|big_p(f(f(esk2_0)))|~big_p(f(X1))),inference(spm,[status(thm)],[80,147,theory(equality)])).
% cnf(159,negated_conjecture,(big_p(f(f(esk2_0)))),inference(spm,[status(thm)],[150,147,theory(equality)])).
% cnf(166,negated_conjecture,(~big_p(f(f(esk1_0)))|$false),inference(rw,[status(thm)],[9,159,theory(equality)])).
% cnf(167,negated_conjecture,(~big_p(f(f(esk1_0)))),inference(cn,[status(thm)],[166,theory(equality)])).
% cnf(168,negated_conjecture,(big_p(f(esk1_0))|$false),inference(rw,[status(thm)],[112,159,theory(equality)])).
% cnf(169,negated_conjecture,(big_p(f(esk1_0))),inference(cn,[status(thm)],[168,theory(equality)])).
% cnf(173,negated_conjecture,(big_p(f(f(X1)))|big_p(f(f(esk1_0)))|~big_p(f(X1))),inference(spm,[status(thm)],[80,169,theory(equality)])).
% cnf(177,negated_conjecture,(big_p(f(f(X1)))|~big_p(f(X1))),inference(sr,[status(thm)],[173,167,theory(equality)])).
% cnf(178,negated_conjecture,(~big_p(f(esk1_0))),inference(spm,[status(thm)],[167,177,theory(equality)])).
% cnf(179,negated_conjecture,($false),inference(rw,[status(thm)],[178,169,theory(equality)])).
% cnf(180,negated_conjecture,($false),inference(cn,[status(thm)],[179,theory(equality)])).
% cnf(181,negated_conjecture,($false),180,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 60
% # ...of these trivial : 18
% # ...subsumed : 6
% # ...remaining for further processing: 36
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 12
% # Backward-rewritten : 14
% # Generated clauses : 80
% # ...of the previous two non-trivial : 74
% # Contextual simplify-reflections : 12
% # Paramodulations : 76
% # Factorizations : 4
% # Equation resolutions : 0
% # Current number of processed clauses: 10
% # Positive orientable unit clauses: 6
% # 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) : 145
% # Rec. Clause-clause subsumption calls : 112
% # Unit Clause-clause subsumption calls : 5
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 9
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 19 leaves, 1.16+/-0.670 terms/leaf
% # Paramod-from index: 6 leaves, 1.33+/-0.745 terms/leaf
% # Paramod-into index: 16 leaves, 1.19+/-0.726 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.004 s
% # Total time : 0.016 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.16 WC
% FINAL PrfWatch: 0.10 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP11874/SYN084+1.tptp
%
%------------------------------------------------------------------------------