TSTP Solution File: SYN077+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN077+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 09:24:30 EST 2010
% Result : Theorem 1.10s
% Output : Solution 1.10s
% 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/SystemOnTPTP25947/SYN077+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP25947/SYN077+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25947/SYN077+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 26079
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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]:?[X2]:![X3]:(big_f(X3,X2)<=>X3=X1),file('/tmp/SRASS.s.p', pel54_1)).
% fof(2, conjecture,~(?[X4]:![X3]:(big_f(X3,X4)<=>![X5]:(big_f(X3,X5)=>?[X1]:(big_f(X1,X5)&~(?[X2]:(big_f(X2,X5)&big_f(X2,X1))))))),file('/tmp/SRASS.s.p', pel54)).
% fof(3, negated_conjecture,~(~(?[X4]:![X3]:(big_f(X3,X4)<=>![X5]:(big_f(X3,X5)=>?[X1]:(big_f(X1,X5)&~(?[X2]:(big_f(X2,X5)&big_f(X2,X1)))))))),inference(assume_negation,[status(cth)],[2])).
% fof(4, plain,![X1]:?[X2]:![X3]:((~(big_f(X3,X2))|X3=X1)&(~(X3=X1)|big_f(X3,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(5, plain,![X4]:?[X5]:![X6]:((~(big_f(X6,X5))|X6=X4)&(~(X6=X4)|big_f(X6,X5))),inference(variable_rename,[status(thm)],[4])).
% fof(6, plain,![X4]:![X6]:((~(big_f(X6,esk1_1(X4)))|X6=X4)&(~(X6=X4)|big_f(X6,esk1_1(X4)))),inference(skolemize,[status(esa)],[5])).
% cnf(7,plain,(big_f(X1,esk1_1(X2))|X1!=X2),inference(split_conjunct,[status(thm)],[6])).
% cnf(8,plain,(X1=X2|~big_f(X1,esk1_1(X2))),inference(split_conjunct,[status(thm)],[6])).
% fof(9, negated_conjecture,?[X4]:![X3]:((~(big_f(X3,X4))|![X5]:(~(big_f(X3,X5))|?[X1]:(big_f(X1,X5)&![X2]:(~(big_f(X2,X5))|~(big_f(X2,X1))))))&(?[X5]:(big_f(X3,X5)&![X1]:(~(big_f(X1,X5))|?[X2]:(big_f(X2,X5)&big_f(X2,X1))))|big_f(X3,X4))),inference(fof_nnf,[status(thm)],[3])).
% fof(10, negated_conjecture,?[X6]:![X7]:((~(big_f(X7,X6))|![X8]:(~(big_f(X7,X8))|?[X9]:(big_f(X9,X8)&![X10]:(~(big_f(X10,X8))|~(big_f(X10,X9))))))&(?[X11]:(big_f(X7,X11)&![X12]:(~(big_f(X12,X11))|?[X13]:(big_f(X13,X11)&big_f(X13,X12))))|big_f(X7,X6))),inference(variable_rename,[status(thm)],[9])).
% fof(11, negated_conjecture,![X7]:((~(big_f(X7,esk2_0))|![X8]:(~(big_f(X7,X8))|(big_f(esk3_2(X7,X8),X8)&![X10]:(~(big_f(X10,X8))|~(big_f(X10,esk3_2(X7,X8)))))))&((big_f(X7,esk4_1(X7))&![X12]:(~(big_f(X12,esk4_1(X7)))|(big_f(esk5_2(X7,X12),esk4_1(X7))&big_f(esk5_2(X7,X12),X12))))|big_f(X7,esk2_0))),inference(skolemize,[status(esa)],[10])).
% fof(12, negated_conjecture,![X7]:![X8]:![X10]:![X12]:((((~(big_f(X12,esk4_1(X7)))|(big_f(esk5_2(X7,X12),esk4_1(X7))&big_f(esk5_2(X7,X12),X12)))&big_f(X7,esk4_1(X7)))|big_f(X7,esk2_0))&((((~(big_f(X10,X8))|~(big_f(X10,esk3_2(X7,X8))))&big_f(esk3_2(X7,X8),X8))|~(big_f(X7,X8)))|~(big_f(X7,esk2_0)))),inference(shift_quantors,[status(thm)],[11])).
% fof(13, negated_conjecture,![X7]:![X8]:![X10]:![X12]:(((((big_f(esk5_2(X7,X12),esk4_1(X7))|~(big_f(X12,esk4_1(X7))))|big_f(X7,esk2_0))&((big_f(esk5_2(X7,X12),X12)|~(big_f(X12,esk4_1(X7))))|big_f(X7,esk2_0)))&(big_f(X7,esk4_1(X7))|big_f(X7,esk2_0)))&((((~(big_f(X10,X8))|~(big_f(X10,esk3_2(X7,X8))))|~(big_f(X7,X8)))|~(big_f(X7,esk2_0)))&((big_f(esk3_2(X7,X8),X8)|~(big_f(X7,X8)))|~(big_f(X7,esk2_0))))),inference(distribute,[status(thm)],[12])).
% cnf(14,negated_conjecture,(big_f(esk3_2(X1,X2),X2)|~big_f(X1,esk2_0)|~big_f(X1,X2)),inference(split_conjunct,[status(thm)],[13])).
% cnf(15,negated_conjecture,(~big_f(X1,esk2_0)|~big_f(X1,X2)|~big_f(X3,esk3_2(X1,X2))|~big_f(X3,X2)),inference(split_conjunct,[status(thm)],[13])).
% cnf(16,negated_conjecture,(big_f(X1,esk2_0)|big_f(X1,esk4_1(X1))),inference(split_conjunct,[status(thm)],[13])).
% cnf(17,negated_conjecture,(big_f(X1,esk2_0)|big_f(esk5_2(X1,X2),X2)|~big_f(X2,esk4_1(X1))),inference(split_conjunct,[status(thm)],[13])).
% cnf(18,negated_conjecture,(big_f(X1,esk2_0)|big_f(esk5_2(X1,X2),esk4_1(X1))|~big_f(X2,esk4_1(X1))),inference(split_conjunct,[status(thm)],[13])).
% cnf(19,plain,(big_f(X1,esk1_1(X1))),inference(er,[status(thm)],[7,theory(equality)])).
% cnf(20,negated_conjecture,(esk3_2(X1,esk1_1(X2))=X2|~big_f(X1,esk2_0)|~big_f(X1,esk1_1(X2))),inference(spm,[status(thm)],[8,14,theory(equality)])).
% cnf(22,negated_conjecture,(big_f(X1,esk2_0)|~big_f(X2,esk2_0)|~big_f(esk5_2(X1,esk3_2(X2,X3)),X3)|~big_f(X2,X3)|~big_f(esk3_2(X2,X3),esk4_1(X1))),inference(spm,[status(thm)],[15,17,theory(equality)])).
% cnf(25,negated_conjecture,(~big_f(X1,X3)|~big_f(X2,esk2_0)|~big_f(X1,esk1_1(X3))|~big_f(X2,esk1_1(X3))),inference(spm,[status(thm)],[15,20,theory(equality)])).
% cnf(31,negated_conjecture,(big_f(X1,esk2_0)|~big_f(esk3_2(X2,esk4_1(X1)),esk4_1(X1))|~big_f(X2,esk2_0)|~big_f(X2,esk4_1(X1))),inference(spm,[status(thm)],[22,18,theory(equality)])).
% cnf(32,negated_conjecture,(big_f(X1,esk2_0)|~big_f(X2,esk4_1(X1))|~big_f(X2,esk2_0)),inference(csr,[status(thm)],[31,14])).
% cnf(34,negated_conjecture,(big_f(X1,esk2_0)|~big_f(esk5_2(X1,X2),esk2_0)|~big_f(X2,esk4_1(X1))),inference(spm,[status(thm)],[32,18,theory(equality)])).
% cnf(38,negated_conjecture,(big_f(X1,esk2_0)|~big_f(esk2_0,esk4_1(X1))),inference(spm,[status(thm)],[34,17,theory(equality)])).
% cnf(39,negated_conjecture,(big_f(esk2_0,esk2_0)),inference(spm,[status(thm)],[38,16,theory(equality)])).
% cnf(55,negated_conjecture,(~big_f(X2,esk1_1(X1))|~big_f(X2,esk2_0)|~big_f(X1,X1)),inference(spm,[status(thm)],[25,19,theory(equality)])).
% cnf(58,negated_conjecture,(~big_f(X1,esk2_0)|~big_f(X1,X1)),inference(spm,[status(thm)],[55,19,theory(equality)])).
% cnf(61,negated_conjecture,(~big_f(esk2_0,esk2_0)),inference(spm,[status(thm)],[58,39,theory(equality)])).
% cnf(66,negated_conjecture,($false),inference(rw,[status(thm)],[61,39,theory(equality)])).
% cnf(67,negated_conjecture,($false),inference(cn,[status(thm)],[66,theory(equality)])).
% cnf(68,negated_conjecture,($false),67,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 38
% # ...of these trivial : 0
% # ...subsumed : 4
% # ...remaining for further processing: 34
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 42
% # ...of the previous two non-trivial : 34
% # Contextual simplify-reflections : 3
% # Paramodulations : 41
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 26
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 22
% # Current number of unprocessed clauses: 10
% # ...number of literals in the above : 37
% # Clause-clause subsumption calls (NU) : 103
% # Rec. Clause-clause subsumption calls : 68
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 34 leaves, 1.47+/-0.882 terms/leaf
% # Paramod-from index: 12 leaves, 1.17+/-0.373 terms/leaf
% # Paramod-into index: 31 leaves, 1.26+/-0.438 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.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP25947/SYN077+1.tptp
%
%------------------------------------------------------------------------------