TSTP Solution File: SYN375+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN375+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:26:49 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/SystemOnTPTP12189/SYN375+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP12189/SYN375+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12189/SYN375+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 12285
% 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]:(big_p(X1)<=>?[X2]:big_p(X2))<=>(![X1]:big_p(X1)<=>?[X2]:big_p(X2))),file('/tmp/SRASS.s.p', x2126)).
% fof(2, negated_conjecture,~((![X1]:(big_p(X1)<=>?[X2]:big_p(X2))<=>(![X1]:big_p(X1)<=>?[X2]:big_p(X2)))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,((?[X1]:((~(big_p(X1))|![X2]:~(big_p(X2)))&(big_p(X1)|?[X2]:big_p(X2)))|((?[X1]:~(big_p(X1))|![X2]:~(big_p(X2)))&(![X1]:big_p(X1)|?[X2]:big_p(X2))))&(![X1]:((~(big_p(X1))|?[X2]:big_p(X2))&(![X2]:~(big_p(X2))|big_p(X1)))|((?[X1]:~(big_p(X1))|?[X2]:big_p(X2))&(![X2]:~(big_p(X2))|![X1]:big_p(X1))))),inference(fof_nnf,[status(thm)],[2])).
% fof(4, negated_conjecture,((?[X3]:((~(big_p(X3))|![X4]:~(big_p(X4)))&(big_p(X3)|?[X5]:big_p(X5)))|((?[X6]:~(big_p(X6))|![X7]:~(big_p(X7)))&(![X8]:big_p(X8)|?[X9]:big_p(X9))))&(![X10]:((~(big_p(X10))|?[X11]:big_p(X11))&(![X12]:~(big_p(X12))|big_p(X10)))|((?[X13]:~(big_p(X13))|?[X14]:big_p(X14))&(![X15]:~(big_p(X15))|![X16]:big_p(X16))))),inference(variable_rename,[status(thm)],[3])).
% fof(5, negated_conjecture,((((~(big_p(esk1_0))|![X4]:~(big_p(X4)))&(big_p(esk1_0)|big_p(esk2_0)))|((~(big_p(esk3_0))|![X7]:~(big_p(X7)))&(![X8]:big_p(X8)|big_p(esk4_0))))&(![X10]:((~(big_p(X10))|big_p(esk5_1(X10)))&(![X12]:~(big_p(X12))|big_p(X10)))|((~(big_p(esk6_0))|big_p(esk7_0))&(![X15]:~(big_p(X15))|![X16]:big_p(X16))))),inference(skolemize,[status(esa)],[4])).
% fof(6, negated_conjecture,![X4]:![X7]:![X8]:![X10]:![X12]:![X15]:![X16]:((((big_p(X16)|~(big_p(X15)))&(~(big_p(esk6_0))|big_p(esk7_0)))|((~(big_p(X12))|big_p(X10))&(~(big_p(X10))|big_p(esk5_1(X10)))))&(((big_p(X8)|big_p(esk4_0))&(~(big_p(X7))|~(big_p(esk3_0))))|((~(big_p(X4))|~(big_p(esk1_0)))&(big_p(esk1_0)|big_p(esk2_0))))),inference(shift_quantors,[status(thm)],[5])).
% fof(7, negated_conjecture,![X4]:![X7]:![X8]:![X10]:![X12]:![X15]:![X16]:(((((~(big_p(X12))|big_p(X10))|(big_p(X16)|~(big_p(X15))))&((~(big_p(X10))|big_p(esk5_1(X10)))|(big_p(X16)|~(big_p(X15)))))&(((~(big_p(X12))|big_p(X10))|(~(big_p(esk6_0))|big_p(esk7_0)))&((~(big_p(X10))|big_p(esk5_1(X10)))|(~(big_p(esk6_0))|big_p(esk7_0)))))&((((~(big_p(X4))|~(big_p(esk1_0)))|(big_p(X8)|big_p(esk4_0)))&((big_p(esk1_0)|big_p(esk2_0))|(big_p(X8)|big_p(esk4_0))))&(((~(big_p(X4))|~(big_p(esk1_0)))|(~(big_p(X7))|~(big_p(esk3_0))))&((big_p(esk1_0)|big_p(esk2_0))|(~(big_p(X7))|~(big_p(esk3_0))))))),inference(distribute,[status(thm)],[6])).
% cnf(9,negated_conjecture,(~big_p(esk3_0)|~big_p(X1)|~big_p(esk1_0)|~big_p(X2)),inference(split_conjunct,[status(thm)],[7])).
% cnf(10,negated_conjecture,(big_p(esk4_0)|big_p(X1)|big_p(esk2_0)|big_p(esk1_0)),inference(split_conjunct,[status(thm)],[7])).
% cnf(15,negated_conjecture,(big_p(X2)|big_p(X3)|~big_p(X1)|~big_p(X4)),inference(split_conjunct,[status(thm)],[7])).
% fof(16, plain,(~(epred1_0)<=>![X2]:((~(big_p(esk3_0))|~(big_p(esk1_0)))|~(big_p(X2)))),introduced(definition),['split']).
% cnf(17,plain,(epred1_0|~big_p(X2)|~big_p(esk3_0)|~big_p(esk1_0)),inference(split_equiv,[status(thm)],[16])).
% fof(18, plain,(~(epred2_0)<=>![X1]:~(big_p(X1))),introduced(definition),['split']).
% cnf(19,plain,(epred2_0|~big_p(X1)),inference(split_equiv,[status(thm)],[18])).
% cnf(20,negated_conjecture,(~epred2_0|~epred1_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[9,16,theory(equality)]),18,theory(equality)]),['split']).
% cnf(21,negated_conjecture,(big_p(esk1_0)|big_p(esk2_0)|big_p(esk4_0)),inference(ef,[status(thm)],[10,theory(equality)])).
% cnf(28,negated_conjecture,(epred2_0|big_p(esk2_0)|big_p(esk1_0)),inference(spm,[status(thm)],[19,21,theory(equality)])).
% cnf(29,negated_conjecture,(big_p(X1)|big_p(X2)|big_p(esk2_0)|big_p(esk1_0)|~big_p(X3)),inference(spm,[status(thm)],[15,21,theory(equality)])).
% cnf(30,negated_conjecture,(epred2_0|big_p(esk2_0)),inference(csr,[status(thm)],[28,19])).
% cnf(31,negated_conjecture,(epred2_0),inference(csr,[status(thm)],[30,19])).
% cnf(32,negated_conjecture,($false|~epred1_0),inference(rw,[status(thm)],[20,31,theory(equality)])).
% cnf(33,negated_conjecture,(~epred1_0),inference(cn,[status(thm)],[32,theory(equality)])).
% cnf(35,negated_conjecture,(big_p(esk2_0)|big_p(X1)|big_p(X2)|~big_p(X3)),inference(csr,[status(thm)],[29,15])).
% cnf(36,negated_conjecture,(big_p(X1)|big_p(X2)|~big_p(X3)),inference(csr,[status(thm)],[35,15])).
% cnf(37,negated_conjecture,(big_p(X1)|big_p(X2)|big_p(esk2_0)|big_p(esk1_0)),inference(spm,[status(thm)],[36,21,theory(equality)])).
% cnf(38,negated_conjecture,(big_p(esk2_0)|big_p(X1)|big_p(X2)),inference(csr,[status(thm)],[37,36])).
% cnf(39,negated_conjecture,(big_p(X1)|big_p(X2)),inference(csr,[status(thm)],[38,36])).
% cnf(42,negated_conjecture,(epred1_0|big_p(X2)|~big_p(esk1_0)|~big_p(X1)),inference(spm,[status(thm)],[17,39,theory(equality)])).
% cnf(44,negated_conjecture,(big_p(X2)|~big_p(esk1_0)|~big_p(X1)),inference(sr,[status(thm)],[42,33,theory(equality)])).
% cnf(46,negated_conjecture,(big_p(X2)|~big_p(esk1_0)),inference(csr,[status(thm)],[44,39])).
% cnf(47,negated_conjecture,(big_p(X2)),inference(csr,[status(thm)],[46,39])).
% cnf(48,negated_conjecture,(epred1_0|$false|~big_p(esk1_0)|~big_p(X1)),inference(rw,[status(thm)],[17,47,theory(equality)])).
% cnf(49,negated_conjecture,(epred1_0|$false|$false|~big_p(X1)),inference(rw,[status(thm)],[48,47,theory(equality)])).
% cnf(50,negated_conjecture,(epred1_0|$false|$false|$false),inference(rw,[status(thm)],[49,47,theory(equality)])).
% cnf(51,negated_conjecture,(epred1_0),inference(cn,[status(thm)],[50,theory(equality)])).
% cnf(52,negated_conjecture,($false),inference(sr,[status(thm)],[51,33,theory(equality)])).
% cnf(53,negated_conjecture,($false),52,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 22
% # ...of these trivial : 0
% # ...subsumed : 2
% # ...remaining for further processing: 20
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 8
% # Backward-rewritten : 3
% # Generated clauses : 17
% # ...of the previous two non-trivial : 17
% # Contextual simplify-reflections : 8
% # Paramodulations : 10
% # Factorizations : 4
% # Equation resolutions : 0
% # Current number of processed clauses: 3
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 35
% # Rec. Clause-clause subsumption calls : 25
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 4 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.008 s
% # System time : 0.002 s
% # Total time : 0.010 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/SystemOnTPTP12189/SYN375+1.tptp
%
%------------------------------------------------------------------------------