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