TSTP Solution File: SYN334+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SYN334+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 : art02.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:22:21 EST 2010

% Result   : Theorem 0.86s
% Output   : Solution 0.86s
% 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/SystemOnTPTP10376/SYN334+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... found
% SZS status THM for /tmp/SystemOnTPTP10376/SYN334+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10376/SYN334+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 10472
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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]:?[X2]:![X3]:((big_f(X1,X2)=>(big_f(X1,X3)<=>big_g(X2,X3)))=>((big_f(X1,X2)<=>(big_f(X3,X3)=>big_g(X3,X3)))=>(big_g(X1,X2)<=>big_g(X3,X3)))),file('/tmp/SRASS.s.p', church_46_14_6)).
% fof(2, negated_conjecture,~(?[X1]:?[X2]:![X3]:((big_f(X1,X2)=>(big_f(X1,X3)<=>big_g(X2,X3)))=>((big_f(X1,X2)<=>(big_f(X3,X3)=>big_g(X3,X3)))=>(big_g(X1,X2)<=>big_g(X3,X3))))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,![X1]:![X2]:?[X3]:((~(big_f(X1,X2))|((~(big_f(X1,X3))|big_g(X2,X3))&(~(big_g(X2,X3))|big_f(X1,X3))))&(((~(big_f(X1,X2))|(~(big_f(X3,X3))|big_g(X3,X3)))&((big_f(X3,X3)&~(big_g(X3,X3)))|big_f(X1,X2)))&((~(big_g(X1,X2))|~(big_g(X3,X3)))&(big_g(X1,X2)|big_g(X3,X3))))),inference(fof_nnf,[status(thm)],[2])).
% fof(4, negated_conjecture,![X4]:![X5]:?[X6]:((~(big_f(X4,X5))|((~(big_f(X4,X6))|big_g(X5,X6))&(~(big_g(X5,X6))|big_f(X4,X6))))&(((~(big_f(X4,X5))|(~(big_f(X6,X6))|big_g(X6,X6)))&((big_f(X6,X6)&~(big_g(X6,X6)))|big_f(X4,X5)))&((~(big_g(X4,X5))|~(big_g(X6,X6)))&(big_g(X4,X5)|big_g(X6,X6))))),inference(variable_rename,[status(thm)],[3])).
% fof(5, negated_conjecture,![X4]:![X5]:((~(big_f(X4,X5))|((~(big_f(X4,esk1_2(X4,X5)))|big_g(X5,esk1_2(X4,X5)))&(~(big_g(X5,esk1_2(X4,X5)))|big_f(X4,esk1_2(X4,X5)))))&(((~(big_f(X4,X5))|(~(big_f(esk1_2(X4,X5),esk1_2(X4,X5)))|big_g(esk1_2(X4,X5),esk1_2(X4,X5))))&((big_f(esk1_2(X4,X5),esk1_2(X4,X5))&~(big_g(esk1_2(X4,X5),esk1_2(X4,X5))))|big_f(X4,X5)))&((~(big_g(X4,X5))|~(big_g(esk1_2(X4,X5),esk1_2(X4,X5))))&(big_g(X4,X5)|big_g(esk1_2(X4,X5),esk1_2(X4,X5)))))),inference(skolemize,[status(esa)],[4])).
% fof(6, negated_conjecture,![X4]:![X5]:((((~(big_f(X4,esk1_2(X4,X5)))|big_g(X5,esk1_2(X4,X5)))|~(big_f(X4,X5)))&((~(big_g(X5,esk1_2(X4,X5)))|big_f(X4,esk1_2(X4,X5)))|~(big_f(X4,X5))))&(((~(big_f(X4,X5))|(~(big_f(esk1_2(X4,X5),esk1_2(X4,X5)))|big_g(esk1_2(X4,X5),esk1_2(X4,X5))))&((big_f(esk1_2(X4,X5),esk1_2(X4,X5))|big_f(X4,X5))&(~(big_g(esk1_2(X4,X5),esk1_2(X4,X5)))|big_f(X4,X5))))&((~(big_g(X4,X5))|~(big_g(esk1_2(X4,X5),esk1_2(X4,X5))))&(big_g(X4,X5)|big_g(esk1_2(X4,X5),esk1_2(X4,X5)))))),inference(distribute,[status(thm)],[5])).
% cnf(7,negated_conjecture,(big_g(esk1_2(X1,X2),esk1_2(X1,X2))|big_g(X1,X2)),inference(split_conjunct,[status(thm)],[6])).
% cnf(8,negated_conjecture,(~big_g(esk1_2(X1,X2),esk1_2(X1,X2))|~big_g(X1,X2)),inference(split_conjunct,[status(thm)],[6])).
% cnf(9,negated_conjecture,(big_f(X1,X2)|~big_g(esk1_2(X1,X2),esk1_2(X1,X2))),inference(split_conjunct,[status(thm)],[6])).
% cnf(10,negated_conjecture,(big_f(X1,X2)|big_f(esk1_2(X1,X2),esk1_2(X1,X2))),inference(split_conjunct,[status(thm)],[6])).
% cnf(11,negated_conjecture,(big_g(esk1_2(X1,X2),esk1_2(X1,X2))|~big_f(esk1_2(X1,X2),esk1_2(X1,X2))|~big_f(X1,X2)),inference(split_conjunct,[status(thm)],[6])).
% cnf(12,negated_conjecture,(big_f(X1,esk1_2(X1,X2))|~big_f(X1,X2)|~big_g(X2,esk1_2(X1,X2))),inference(split_conjunct,[status(thm)],[6])).
% cnf(13,negated_conjecture,(big_g(X2,esk1_2(X1,X2))|~big_f(X1,X2)|~big_f(X1,esk1_2(X1,X2))),inference(split_conjunct,[status(thm)],[6])).
% cnf(14,negated_conjecture,(big_f(X1,X2)|big_g(X1,X2)),inference(spm,[status(thm)],[9,7,theory(equality)])).
% cnf(17,negated_conjecture,(~big_g(X1,X2)|~big_f(esk1_2(X1,X2),esk1_2(X1,X2))|~big_f(X1,X2)),inference(spm,[status(thm)],[8,11,theory(equality)])).
% cnf(19,negated_conjecture,(big_f(esk1_2(X1,X2),esk1_2(X1,X2))|~big_g(X1,X2)),inference(spm,[status(thm)],[8,14,theory(equality)])).
% cnf(20,negated_conjecture,(big_f(X1,esk1_2(X1,X2))|big_f(X2,esk1_2(X1,X2))|~big_f(X1,X2)),inference(spm,[status(thm)],[12,14,theory(equality)])).
% cnf(21,negated_conjecture,(~big_g(X1,X2)|~big_f(X1,X2)),inference(csr,[status(thm)],[17,19])).
% cnf(23,negated_conjecture,(~big_f(esk1_2(X1,X2),esk1_2(X1,X2))|~big_f(X1,X2)),inference(spm,[status(thm)],[21,11,theory(equality)])).
% cnf(29,negated_conjecture,(big_f(esk1_2(X1,X2),esk1_2(esk1_2(X1,X2),esk1_2(X1,X2)))|big_f(X1,X2)),inference(spm,[status(thm)],[20,10,theory(equality)])).
% cnf(32,negated_conjecture,(big_g(esk1_2(X1,X2),esk1_2(esk1_2(X1,X2),esk1_2(X1,X2)))|big_f(X1,X2)|~big_f(esk1_2(X1,X2),esk1_2(X1,X2))),inference(spm,[status(thm)],[13,29,theory(equality)])).
% cnf(35,negated_conjecture,(big_g(esk1_2(X1,X2),esk1_2(esk1_2(X1,X2),esk1_2(X1,X2)))|big_f(X1,X2)),inference(csr,[status(thm)],[32,10])).
% cnf(36,negated_conjecture,(big_f(X1,X2)|~big_f(esk1_2(X1,X2),esk1_2(esk1_2(X1,X2),esk1_2(X1,X2)))),inference(spm,[status(thm)],[21,35,theory(equality)])).
% cnf(39,negated_conjecture,(big_f(X1,X2)),inference(csr,[status(thm)],[36,29])).
% cnf(59,negated_conjecture,($false|~big_f(X1,X2)),inference(rw,[status(thm)],[23,39,theory(equality)])).
% cnf(60,negated_conjecture,($false|$false),inference(rw,[status(thm)],[59,39,theory(equality)])).
% cnf(61,negated_conjecture,($false),inference(cn,[status(thm)],[60,theory(equality)])).
% cnf(62,negated_conjecture,($false),61,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                : 28
% # ...of these trivial              : 0
% # ...subsumed                      : 3
% # ...remaining for further processing: 25
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                : 1
% # Backward-rewritten               : 14
% # Generated clauses                : 23
% # ...of the previous two non-trivial : 20
% # Contextual simplify-reflections  : 3
% # Paramodulations                  : 23
% # Factorizations                   : 0
% # Equation resolutions             : 0
% # Current number of processed clauses: 3
% #    Positive orientable unit clauses: 1
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses         : 0
% #    Non-unit-clauses              : 2
% # Current number of unprocessed clauses: 2
% # ...number of literals in the above : 2
% # Clause-clause subsumption calls (NU) : 35
% # Rec. Clause-clause subsumption calls : 32
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts      : 9
% # Indexed BW rewrite successes     : 9
% # Backwards rewriting index:     5 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-from index:            2 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:            3 leaves,   1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time            : 0.009 s
% # System time          : 0.003 s
% # Total time           : 0.012 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/SystemOnTPTP10376/SYN334+1.tptp
% 
%------------------------------------------------------------------------------