TSTP Solution File: SYN345+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN345+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 : art04.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:23:32 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/SystemOnTPTP17878/SYN345+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP17878/SYN345+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17878/SYN345+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 17974
% 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]:?[X4]:![X5]:(((big_f(X1,X2,X3)=>big_f(X4,X3,X5))=>(big_f(X1,X1,X2)=>big_f(X1,X2,X2)))=>(((big_f(X2,X3,X4)=>big_f(X3,X5,X5))=>(big_f(X1,X2,X2)=>big_f(X1,X1,X2)))=>(big_f(X3,X4,X5)=>(big_f(X2,X2,X3)&(big_f(X1,X1,X2)<=>big_f(X1,X2,X2)))))),file('/tmp/SRASS.s.p', church_46_16_4)).
% fof(2, negated_conjecture,~(![X1]:![X2]:?[X3]:?[X4]:![X5]:(((big_f(X1,X2,X3)=>big_f(X4,X3,X5))=>(big_f(X1,X1,X2)=>big_f(X1,X2,X2)))=>(((big_f(X2,X3,X4)=>big_f(X3,X5,X5))=>(big_f(X1,X2,X2)=>big_f(X1,X1,X2)))=>(big_f(X3,X4,X5)=>(big_f(X2,X2,X3)&(big_f(X1,X1,X2)<=>big_f(X1,X2,X2))))))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,?[X1]:?[X2]:![X3]:![X4]:?[X5]:(((big_f(X1,X2,X3)&~(big_f(X4,X3,X5)))|(~(big_f(X1,X1,X2))|big_f(X1,X2,X2)))&(((big_f(X2,X3,X4)&~(big_f(X3,X5,X5)))|(~(big_f(X1,X2,X2))|big_f(X1,X1,X2)))&(big_f(X3,X4,X5)&(~(big_f(X2,X2,X3))|((~(big_f(X1,X1,X2))|~(big_f(X1,X2,X2)))&(big_f(X1,X1,X2)|big_f(X1,X2,X2))))))),inference(fof_nnf,[status(thm)],[2])).
% fof(4, negated_conjecture,?[X6]:?[X7]:![X8]:![X9]:?[X10]:(((big_f(X6,X7,X8)&~(big_f(X9,X8,X10)))|(~(big_f(X6,X6,X7))|big_f(X6,X7,X7)))&(((big_f(X7,X8,X9)&~(big_f(X8,X10,X10)))|(~(big_f(X6,X7,X7))|big_f(X6,X6,X7)))&(big_f(X8,X9,X10)&(~(big_f(X7,X7,X8))|((~(big_f(X6,X6,X7))|~(big_f(X6,X7,X7)))&(big_f(X6,X6,X7)|big_f(X6,X7,X7))))))),inference(variable_rename,[status(thm)],[3])).
% fof(5, negated_conjecture,![X8]:![X9]:(((big_f(esk1_0,esk2_0,X8)&~(big_f(X9,X8,esk3_2(X8,X9))))|(~(big_f(esk1_0,esk1_0,esk2_0))|big_f(esk1_0,esk2_0,esk2_0)))&(((big_f(esk2_0,X8,X9)&~(big_f(X8,esk3_2(X8,X9),esk3_2(X8,X9))))|(~(big_f(esk1_0,esk2_0,esk2_0))|big_f(esk1_0,esk1_0,esk2_0)))&(big_f(X8,X9,esk3_2(X8,X9))&(~(big_f(esk2_0,esk2_0,X8))|((~(big_f(esk1_0,esk1_0,esk2_0))|~(big_f(esk1_0,esk2_0,esk2_0)))&(big_f(esk1_0,esk1_0,esk2_0)|big_f(esk1_0,esk2_0,esk2_0))))))),inference(skolemize,[status(esa)],[4])).
% fof(6, negated_conjecture,![X8]:![X9]:(((big_f(esk1_0,esk2_0,X8)|(~(big_f(esk1_0,esk1_0,esk2_0))|big_f(esk1_0,esk2_0,esk2_0)))&(~(big_f(X9,X8,esk3_2(X8,X9)))|(~(big_f(esk1_0,esk1_0,esk2_0))|big_f(esk1_0,esk2_0,esk2_0))))&(((big_f(esk2_0,X8,X9)|(~(big_f(esk1_0,esk2_0,esk2_0))|big_f(esk1_0,esk1_0,esk2_0)))&(~(big_f(X8,esk3_2(X8,X9),esk3_2(X8,X9)))|(~(big_f(esk1_0,esk2_0,esk2_0))|big_f(esk1_0,esk1_0,esk2_0))))&(big_f(X8,X9,esk3_2(X8,X9))&(((~(big_f(esk1_0,esk1_0,esk2_0))|~(big_f(esk1_0,esk2_0,esk2_0)))|~(big_f(esk2_0,esk2_0,X8)))&((big_f(esk1_0,esk1_0,esk2_0)|big_f(esk1_0,esk2_0,esk2_0))|~(big_f(esk2_0,esk2_0,X8))))))),inference(distribute,[status(thm)],[5])).
% cnf(7,negated_conjecture,(big_f(esk1_0,esk2_0,esk2_0)|big_f(esk1_0,esk1_0,esk2_0)|~big_f(esk2_0,esk2_0,X1)),inference(split_conjunct,[status(thm)],[6])).
% cnf(8,negated_conjecture,(~big_f(esk2_0,esk2_0,X1)|~big_f(esk1_0,esk2_0,esk2_0)|~big_f(esk1_0,esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[6])).
% cnf(9,negated_conjecture,(big_f(X1,X2,esk3_2(X1,X2))),inference(split_conjunct,[status(thm)],[6])).
% cnf(10,negated_conjecture,(big_f(esk1_0,esk1_0,esk2_0)|~big_f(esk1_0,esk2_0,esk2_0)|~big_f(X1,esk3_2(X1,X2),esk3_2(X1,X2))),inference(split_conjunct,[status(thm)],[6])).
% cnf(11,negated_conjecture,(big_f(esk1_0,esk1_0,esk2_0)|big_f(esk2_0,X1,X2)|~big_f(esk1_0,esk2_0,esk2_0)),inference(split_conjunct,[status(thm)],[6])).
% cnf(13,negated_conjecture,(big_f(esk1_0,esk2_0,esk2_0)|big_f(esk1_0,esk2_0,X1)|~big_f(esk1_0,esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[6])).
% cnf(14,negated_conjecture,(big_f(esk1_0,esk1_0,esk2_0)|big_f(esk1_0,esk2_0,esk2_0)),inference(spm,[status(thm)],[7,9,theory(equality)])).
% cnf(16,negated_conjecture,(big_f(esk1_0,esk2_0,esk2_0)|big_f(esk1_0,esk2_0,X1)),inference(spm,[status(thm)],[13,14,theory(equality)])).
% cnf(18,negated_conjecture,(big_f(esk1_0,esk2_0,esk2_0)),inference(ef,[status(thm)],[16,theory(equality)])).
% cnf(23,negated_conjecture,(big_f(esk1_0,esk1_0,esk2_0)|~big_f(X1,esk3_2(X1,X2),esk3_2(X1,X2))|$false),inference(rw,[status(thm)],[10,18,theory(equality)])).
% cnf(24,negated_conjecture,(big_f(esk1_0,esk1_0,esk2_0)|~big_f(X1,esk3_2(X1,X2),esk3_2(X1,X2))),inference(cn,[status(thm)],[23,theory(equality)])).
% cnf(26,negated_conjecture,(~big_f(esk1_0,esk1_0,esk2_0)|$false|~big_f(esk2_0,esk2_0,X1)),inference(rw,[status(thm)],[8,18,theory(equality)])).
% cnf(27,negated_conjecture,(~big_f(esk1_0,esk1_0,esk2_0)|~big_f(esk2_0,esk2_0,X1)),inference(cn,[status(thm)],[26,theory(equality)])).
% cnf(28,negated_conjecture,(big_f(esk1_0,esk1_0,esk2_0)|big_f(esk2_0,X1,X2)|$false),inference(rw,[status(thm)],[11,18,theory(equality)])).
% cnf(29,negated_conjecture,(big_f(esk1_0,esk1_0,esk2_0)|big_f(esk2_0,X1,X2)),inference(cn,[status(thm)],[28,theory(equality)])).
% cnf(31,negated_conjecture,(big_f(esk2_0,X2,X3)|~big_f(esk2_0,esk2_0,X1)),inference(spm,[status(thm)],[27,29,theory(equality)])).
% cnf(32,negated_conjecture,(big_f(esk2_0,X1,X2)),inference(spm,[status(thm)],[31,9,theory(equality)])).
% cnf(34,negated_conjecture,(big_f(esk1_0,esk1_0,esk2_0)),inference(spm,[status(thm)],[24,32,theory(equality)])).
% cnf(38,negated_conjecture,(~big_f(esk1_0,esk1_0,esk2_0)|$false),inference(rw,[status(thm)],[27,32,theory(equality)])).
% cnf(39,negated_conjecture,(~big_f(esk1_0,esk1_0,esk2_0)),inference(cn,[status(thm)],[38,theory(equality)])).
% cnf(41,negated_conjecture,($false),inference(rw,[status(thm)],[39,34,theory(equality)])).
% cnf(42,negated_conjecture,($false),inference(cn,[status(thm)],[41,theory(equality)])).
% cnf(43,negated_conjecture,($false),42,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 24
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 24
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 8
% # Generated clauses : 13
% # ...of the previous two non-trivial : 16
% # Contextual simplify-reflections : 0
% # Paramodulations : 11
% # Factorizations : 2
% # Equation resolutions : 0
% # Current number of processed clauses: 4
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 3
% # Rec. Clause-clause subsumption calls : 3
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 8 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 4 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 7 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/SystemOnTPTP17878/SYN345+1.tptp
%
%------------------------------------------------------------------------------