TSTP Solution File: SYN059+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN059+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 : art06.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:17:46 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/SystemOnTPTP10003/SYN059+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP10003/SYN059+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10003/SYN059+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 10099
% 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, axiom,?[X1]:big_f(X1),file('/tmp/SRASS.s.p', pel29_1)).
% fof(2, axiom,?[X2]:big_g(X2),file('/tmp/SRASS.s.p', pel29_2)).
% fof(3, conjecture,((![X1]:(big_f(X1)=>big_h(X1))&![X3]:(big_g(X3)=>big_j(X3)))<=>![X4]:![X2]:((big_f(X4)&big_g(X2))=>(big_h(X4)&big_j(X2)))),file('/tmp/SRASS.s.p', pel29)).
% fof(4, negated_conjecture,~(((![X1]:(big_f(X1)=>big_h(X1))&![X3]:(big_g(X3)=>big_j(X3)))<=>![X4]:![X2]:((big_f(X4)&big_g(X2))=>(big_h(X4)&big_j(X2))))),inference(assume_negation,[status(cth)],[3])).
% fof(5, plain,?[X2]:big_f(X2),inference(variable_rename,[status(thm)],[1])).
% fof(6, plain,big_f(esk1_0),inference(skolemize,[status(esa)],[5])).
% cnf(7,plain,(big_f(esk1_0)),inference(split_conjunct,[status(thm)],[6])).
% fof(8, plain,?[X3]:big_g(X3),inference(variable_rename,[status(thm)],[2])).
% fof(9, plain,big_g(esk2_0),inference(skolemize,[status(esa)],[8])).
% cnf(10,plain,(big_g(esk2_0)),inference(split_conjunct,[status(thm)],[9])).
% fof(11, negated_conjecture,(((?[X1]:(big_f(X1)&~(big_h(X1)))|?[X3]:(big_g(X3)&~(big_j(X3))))|?[X4]:?[X2]:((big_f(X4)&big_g(X2))&(~(big_h(X4))|~(big_j(X2)))))&((![X1]:(~(big_f(X1))|big_h(X1))&![X3]:(~(big_g(X3))|big_j(X3)))|![X4]:![X2]:((~(big_f(X4))|~(big_g(X2)))|(big_h(X4)&big_j(X2))))),inference(fof_nnf,[status(thm)],[4])).
% fof(12, negated_conjecture,(((?[X5]:(big_f(X5)&~(big_h(X5)))|?[X6]:(big_g(X6)&~(big_j(X6))))|?[X7]:?[X8]:((big_f(X7)&big_g(X8))&(~(big_h(X7))|~(big_j(X8)))))&((![X9]:(~(big_f(X9))|big_h(X9))&![X10]:(~(big_g(X10))|big_j(X10)))|![X11]:![X12]:((~(big_f(X11))|~(big_g(X12)))|(big_h(X11)&big_j(X12))))),inference(variable_rename,[status(thm)],[11])).
% fof(13, negated_conjecture,((((big_f(esk3_0)&~(big_h(esk3_0)))|(big_g(esk4_0)&~(big_j(esk4_0))))|((big_f(esk5_0)&big_g(esk6_0))&(~(big_h(esk5_0))|~(big_j(esk6_0)))))&((![X9]:(~(big_f(X9))|big_h(X9))&![X10]:(~(big_g(X10))|big_j(X10)))|![X11]:![X12]:((~(big_f(X11))|~(big_g(X12)))|(big_h(X11)&big_j(X12))))),inference(skolemize,[status(esa)],[12])).
% fof(14, negated_conjecture,![X9]:![X10]:![X11]:![X12]:((((~(big_f(X11))|~(big_g(X12)))|(big_h(X11)&big_j(X12)))|((~(big_g(X10))|big_j(X10))&(~(big_f(X9))|big_h(X9))))&(((big_f(esk3_0)&~(big_h(esk3_0)))|(big_g(esk4_0)&~(big_j(esk4_0))))|((big_f(esk5_0)&big_g(esk6_0))&(~(big_h(esk5_0))|~(big_j(esk6_0)))))),inference(shift_quantors,[status(thm)],[13])).
% fof(15, negated_conjecture,![X9]:![X10]:![X11]:![X12]:(((((~(big_g(X10))|big_j(X10))|(big_h(X11)|(~(big_f(X11))|~(big_g(X12)))))&((~(big_f(X9))|big_h(X9))|(big_h(X11)|(~(big_f(X11))|~(big_g(X12))))))&(((~(big_g(X10))|big_j(X10))|(big_j(X12)|(~(big_f(X11))|~(big_g(X12)))))&((~(big_f(X9))|big_h(X9))|(big_j(X12)|(~(big_f(X11))|~(big_g(X12)))))))&(((((big_f(esk5_0)|(big_g(esk4_0)|big_f(esk3_0)))&(big_g(esk6_0)|(big_g(esk4_0)|big_f(esk3_0))))&((~(big_h(esk5_0))|~(big_j(esk6_0)))|(big_g(esk4_0)|big_f(esk3_0))))&(((big_f(esk5_0)|(~(big_j(esk4_0))|big_f(esk3_0)))&(big_g(esk6_0)|(~(big_j(esk4_0))|big_f(esk3_0))))&((~(big_h(esk5_0))|~(big_j(esk6_0)))|(~(big_j(esk4_0))|big_f(esk3_0)))))&((((big_f(esk5_0)|(big_g(esk4_0)|~(big_h(esk3_0))))&(big_g(esk6_0)|(big_g(esk4_0)|~(big_h(esk3_0)))))&((~(big_h(esk5_0))|~(big_j(esk6_0)))|(big_g(esk4_0)|~(big_h(esk3_0)))))&(((big_f(esk5_0)|(~(big_j(esk4_0))|~(big_h(esk3_0))))&(big_g(esk6_0)|(~(big_j(esk4_0))|~(big_h(esk3_0)))))&((~(big_h(esk5_0))|~(big_j(esk6_0)))|(~(big_j(esk4_0))|~(big_h(esk3_0)))))))),inference(distribute,[status(thm)],[14])).
% cnf(16,negated_conjecture,(~big_h(esk3_0)|~big_j(esk4_0)|~big_j(esk6_0)|~big_h(esk5_0)),inference(split_conjunct,[status(thm)],[15])).
% cnf(17,negated_conjecture,(big_g(esk6_0)|~big_h(esk3_0)|~big_j(esk4_0)),inference(split_conjunct,[status(thm)],[15])).
% cnf(18,negated_conjecture,(big_f(esk5_0)|~big_h(esk3_0)|~big_j(esk4_0)),inference(split_conjunct,[status(thm)],[15])).
% cnf(19,negated_conjecture,(big_g(esk4_0)|~big_h(esk3_0)|~big_j(esk6_0)|~big_h(esk5_0)),inference(split_conjunct,[status(thm)],[15])).
% cnf(20,negated_conjecture,(big_g(esk4_0)|big_g(esk6_0)|~big_h(esk3_0)),inference(split_conjunct,[status(thm)],[15])).
% cnf(21,negated_conjecture,(big_g(esk4_0)|big_f(esk5_0)|~big_h(esk3_0)),inference(split_conjunct,[status(thm)],[15])).
% cnf(22,negated_conjecture,(big_f(esk3_0)|~big_j(esk4_0)|~big_j(esk6_0)|~big_h(esk5_0)),inference(split_conjunct,[status(thm)],[15])).
% cnf(23,negated_conjecture,(big_f(esk3_0)|big_g(esk6_0)|~big_j(esk4_0)),inference(split_conjunct,[status(thm)],[15])).
% cnf(24,negated_conjecture,(big_f(esk3_0)|big_f(esk5_0)|~big_j(esk4_0)),inference(split_conjunct,[status(thm)],[15])).
% cnf(25,negated_conjecture,(big_f(esk3_0)|big_g(esk4_0)|~big_j(esk6_0)|~big_h(esk5_0)),inference(split_conjunct,[status(thm)],[15])).
% cnf(26,negated_conjecture,(big_f(esk3_0)|big_g(esk4_0)|big_g(esk6_0)),inference(split_conjunct,[status(thm)],[15])).
% cnf(27,negated_conjecture,(big_f(esk3_0)|big_g(esk4_0)|big_f(esk5_0)),inference(split_conjunct,[status(thm)],[15])).
% cnf(29,negated_conjecture,(big_j(X1)|big_j(X3)|~big_g(X1)|~big_f(X2)|~big_g(X3)),inference(split_conjunct,[status(thm)],[15])).
% cnf(30,negated_conjecture,(big_h(X2)|big_h(X3)|~big_g(X1)|~big_f(X2)|~big_f(X3)),inference(split_conjunct,[status(thm)],[15])).
% cnf(34,negated_conjecture,(big_h(X1)|big_h(X2)|~big_f(X1)|~big_f(X2)),inference(pm,[status(thm)],[30,10,theory(equality)])).
% cnf(39,negated_conjecture,(big_j(X1)|big_j(X2)|~big_g(X1)|~big_g(X2)),inference(pm,[status(thm)],[29,7,theory(equality)])).
% cnf(55,negated_conjecture,(big_j(esk6_0)|big_j(X1)|big_g(esk4_0)|big_f(esk3_0)|~big_g(X1)),inference(pm,[status(thm)],[39,26,theory(equality)])).
% cnf(56,negated_conjecture,(big_j(esk4_0)|big_j(X1)|big_f(esk3_0)|big_f(esk5_0)|~big_g(X1)),inference(pm,[status(thm)],[39,27,theory(equality)])).
% cnf(80,negated_conjecture,(big_j(esk6_0)|big_g(esk4_0)|big_f(esk3_0)),inference(pm,[status(thm)],[55,26,theory(equality)])).
% cnf(85,negated_conjecture,(big_j(esk4_0)|big_f(esk3_0)|big_f(esk5_0)),inference(pm,[status(thm)],[56,27,theory(equality)])).
% cnf(88,negated_conjecture,(big_f(esk3_0)|big_f(esk5_0)),inference(pm,[status(thm)],[24,85,theory(equality)])).
% cnf(90,negated_conjecture,(big_h(esk5_0)|big_h(X1)|big_f(esk3_0)|~big_f(X1)),inference(pm,[status(thm)],[34,88,theory(equality)])).
% cnf(91,negated_conjecture,(big_h(esk5_0)|big_f(esk3_0)),inference(pm,[status(thm)],[90,88,theory(equality)])).
% cnf(94,negated_conjecture,(big_g(esk4_0)|big_f(esk3_0)|~big_j(esk6_0)),inference(pm,[status(thm)],[25,91,theory(equality)])).
% cnf(95,negated_conjecture,(big_f(esk3_0)|~big_j(esk4_0)|~big_j(esk6_0)),inference(pm,[status(thm)],[22,91,theory(equality)])).
% cnf(99,negated_conjecture,(big_g(esk4_0)|big_f(esk3_0)),inference(pm,[status(thm)],[94,80,theory(equality)])).
% cnf(101,negated_conjecture,(big_j(esk4_0)|big_j(X1)|big_f(esk3_0)|~big_g(X1)),inference(pm,[status(thm)],[39,99,theory(equality)])).
% cnf(102,negated_conjecture,(big_j(esk4_0)|big_f(esk3_0)),inference(pm,[status(thm)],[101,99,theory(equality)])).
% cnf(105,negated_conjecture,(big_g(esk6_0)|big_f(esk3_0)),inference(pm,[status(thm)],[23,102,theory(equality)])).
% cnf(107,negated_conjecture,(big_j(esk6_0)|big_j(X1)|big_f(esk3_0)|~big_g(X1)),inference(pm,[status(thm)],[39,105,theory(equality)])).
% cnf(108,negated_conjecture,(big_j(esk6_0)|big_f(esk3_0)),inference(pm,[status(thm)],[107,105,theory(equality)])).
% cnf(112,negated_conjecture,(big_f(esk3_0)|~big_j(esk4_0)),inference(pm,[status(thm)],[95,108,theory(equality)])).
% cnf(113,negated_conjecture,(big_f(esk3_0)),inference(pm,[status(thm)],[112,102,theory(equality)])).
% cnf(114,negated_conjecture,(big_h(esk3_0)|big_h(X1)|~big_f(X1)),inference(pm,[status(thm)],[34,113,theory(equality)])).
% cnf(122,negated_conjecture,(big_h(esk3_0)),inference(pm,[status(thm)],[114,113,theory(equality)])).
% cnf(126,negated_conjecture,(~big_j(esk4_0)|~big_j(esk6_0)|$false|~big_h(esk5_0)),inference(rw,[status(thm)],[16,122,theory(equality)])).
% cnf(127,negated_conjecture,(~big_j(esk4_0)|~big_j(esk6_0)|~big_h(esk5_0)),inference(cn,[status(thm)],[126,theory(equality)])).
% cnf(128,negated_conjecture,(big_g(esk4_0)|~big_j(esk6_0)|$false|~big_h(esk5_0)),inference(rw,[status(thm)],[19,122,theory(equality)])).
% cnf(129,negated_conjecture,(big_g(esk4_0)|~big_j(esk6_0)|~big_h(esk5_0)),inference(cn,[status(thm)],[128,theory(equality)])).
% cnf(130,negated_conjecture,(big_g(esk6_0)|~big_j(esk4_0)|$false),inference(rw,[status(thm)],[17,122,theory(equality)])).
% cnf(131,negated_conjecture,(big_g(esk6_0)|~big_j(esk4_0)),inference(cn,[status(thm)],[130,theory(equality)])).
% cnf(132,negated_conjecture,(big_f(esk5_0)|~big_j(esk4_0)|$false),inference(rw,[status(thm)],[18,122,theory(equality)])).
% cnf(133,negated_conjecture,(big_f(esk5_0)|~big_j(esk4_0)),inference(cn,[status(thm)],[132,theory(equality)])).
% cnf(134,negated_conjecture,(big_g(esk4_0)|big_g(esk6_0)|$false),inference(rw,[status(thm)],[20,122,theory(equality)])).
% cnf(135,negated_conjecture,(big_g(esk4_0)|big_g(esk6_0)),inference(cn,[status(thm)],[134,theory(equality)])).
% cnf(136,negated_conjecture,(big_g(esk4_0)|big_f(esk5_0)|$false),inference(rw,[status(thm)],[21,122,theory(equality)])).
% cnf(137,negated_conjecture,(big_g(esk4_0)|big_f(esk5_0)),inference(cn,[status(thm)],[136,theory(equality)])).
% cnf(139,negated_conjecture,(big_j(esk6_0)|big_j(X1)|big_g(esk4_0)|~big_g(X1)),inference(pm,[status(thm)],[39,135,theory(equality)])).
% cnf(141,negated_conjecture,(big_j(esk4_0)|big_j(X1)|big_f(esk5_0)|~big_g(X1)),inference(pm,[status(thm)],[39,137,theory(equality)])).
% cnf(142,negated_conjecture,(big_j(esk6_0)|big_g(esk4_0)),inference(pm,[status(thm)],[139,135,theory(equality)])).
% cnf(149,negated_conjecture,(big_j(esk4_0)|big_f(esk5_0)),inference(pm,[status(thm)],[141,137,theory(equality)])).
% cnf(152,negated_conjecture,(big_f(esk5_0)),inference(pm,[status(thm)],[133,149,theory(equality)])).
% cnf(154,negated_conjecture,(big_h(esk5_0)|big_h(X1)|~big_f(X1)),inference(pm,[status(thm)],[34,152,theory(equality)])).
% cnf(158,negated_conjecture,(big_h(esk5_0)),inference(pm,[status(thm)],[154,152,theory(equality)])).
% cnf(164,negated_conjecture,(~big_j(esk4_0)|~big_j(esk6_0)|$false),inference(rw,[status(thm)],[127,158,theory(equality)])).
% cnf(165,negated_conjecture,(~big_j(esk4_0)|~big_j(esk6_0)),inference(cn,[status(thm)],[164,theory(equality)])).
% cnf(166,negated_conjecture,(big_g(esk4_0)|~big_j(esk6_0)|$false),inference(rw,[status(thm)],[129,158,theory(equality)])).
% cnf(167,negated_conjecture,(big_g(esk4_0)|~big_j(esk6_0)),inference(cn,[status(thm)],[166,theory(equality)])).
% cnf(168,negated_conjecture,(big_g(esk4_0)),inference(pm,[status(thm)],[167,142,theory(equality)])).
% cnf(170,negated_conjecture,(big_j(esk4_0)|big_j(X1)|~big_g(X1)),inference(pm,[status(thm)],[39,168,theory(equality)])).
% cnf(174,negated_conjecture,(big_j(esk4_0)),inference(pm,[status(thm)],[170,168,theory(equality)])).
% cnf(177,negated_conjecture,($false|~big_j(esk6_0)),inference(rw,[status(thm)],[165,174,theory(equality)])).
% cnf(178,negated_conjecture,(~big_j(esk6_0)),inference(cn,[status(thm)],[177,theory(equality)])).
% cnf(180,negated_conjecture,(big_g(esk6_0)|$false),inference(rw,[status(thm)],[131,174,theory(equality)])).
% cnf(181,negated_conjecture,(big_g(esk6_0)),inference(cn,[status(thm)],[180,theory(equality)])).
% cnf(184,negated_conjecture,(big_j(esk6_0)|big_j(X1)|~big_g(X1)),inference(pm,[status(thm)],[39,181,theory(equality)])).
% cnf(186,negated_conjecture,(big_j(X1)|~big_g(X1)),inference(sr,[status(thm)],[184,178,theory(equality)])).
% cnf(187,negated_conjecture,(~big_g(esk6_0)),inference(pm,[status(thm)],[178,186,theory(equality)])).
% cnf(188,negated_conjecture,($false),inference(rw,[status(thm)],[187,181,theory(equality)])).
% cnf(189,negated_conjecture,($false),inference(cn,[status(thm)],[188,theory(equality)])).
% cnf(190,negated_conjecture,($false),189,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 75
% # ...of these trivial : 0
% # ...subsumed : 3
% # ...remaining for further processing: 72
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 27
% # Backward-rewritten : 31
% # Generated clauses : 102
% # ...of the previous two non-trivial : 82
% # Contextual simplify-reflections : 0
% # Paramodulations : 102
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 14
% # Positive orientable unit clauses: 11
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 2
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 30
% # Rec. Clause-clause subsumption calls : 30
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 8
% # Indexed BW rewrite successes : 8
% # Backwards rewriting index: 23 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 13 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 20 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.004 s
% # Total time : 0.014 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.18 WC
% FINAL PrfWatch: 0.09 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP10003/SYN059+1.tptp
%
%------------------------------------------------------------------------------