TSTP Solution File: SYN347+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN347+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:23:50 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/SystemOnTPTP11153/SYN347+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP11153/SYN347+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11153/SYN347+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 11249
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.008 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(X3,X5)<=>big_f(X4,X5))<=>big_f(X1,X2))|(big_f(X1,X5)<=>big_f(X2,X5))),file('/tmp/SRASS.s.p', church_46_17_3)).
% fof(2, negated_conjecture,~(![X1]:![X2]:?[X3]:?[X4]:![X5]:(((big_f(X3,X5)<=>big_f(X4,X5))<=>big_f(X1,X2))|(big_f(X1,X5)<=>big_f(X2,X5)))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,?[X1]:?[X2]:![X3]:![X4]:?[X5]:(((((~(big_f(X3,X5))|~(big_f(X4,X5)))&(big_f(X3,X5)|big_f(X4,X5)))|~(big_f(X1,X2)))&(((~(big_f(X3,X5))|big_f(X4,X5))&(~(big_f(X4,X5))|big_f(X3,X5)))|big_f(X1,X2)))&((~(big_f(X1,X5))|~(big_f(X2,X5)))&(big_f(X1,X5)|big_f(X2,X5)))),inference(fof_nnf,[status(thm)],[2])).
% fof(4, negated_conjecture,?[X6]:?[X7]:![X8]:![X9]:?[X10]:(((((~(big_f(X8,X10))|~(big_f(X9,X10)))&(big_f(X8,X10)|big_f(X9,X10)))|~(big_f(X6,X7)))&(((~(big_f(X8,X10))|big_f(X9,X10))&(~(big_f(X9,X10))|big_f(X8,X10)))|big_f(X6,X7)))&((~(big_f(X6,X10))|~(big_f(X7,X10)))&(big_f(X6,X10)|big_f(X7,X10)))),inference(variable_rename,[status(thm)],[3])).
% fof(5, negated_conjecture,![X8]:![X9]:(((((~(big_f(X8,esk3_2(X8,X9)))|~(big_f(X9,esk3_2(X8,X9))))&(big_f(X8,esk3_2(X8,X9))|big_f(X9,esk3_2(X8,X9))))|~(big_f(esk1_0,esk2_0)))&(((~(big_f(X8,esk3_2(X8,X9)))|big_f(X9,esk3_2(X8,X9)))&(~(big_f(X9,esk3_2(X8,X9)))|big_f(X8,esk3_2(X8,X9))))|big_f(esk1_0,esk2_0)))&((~(big_f(esk1_0,esk3_2(X8,X9)))|~(big_f(esk2_0,esk3_2(X8,X9))))&(big_f(esk1_0,esk3_2(X8,X9))|big_f(esk2_0,esk3_2(X8,X9))))),inference(skolemize,[status(esa)],[4])).
% fof(6, negated_conjecture,![X8]:![X9]:(((((~(big_f(X8,esk3_2(X8,X9)))|~(big_f(X9,esk3_2(X8,X9))))|~(big_f(esk1_0,esk2_0)))&((big_f(X8,esk3_2(X8,X9))|big_f(X9,esk3_2(X8,X9)))|~(big_f(esk1_0,esk2_0))))&(((~(big_f(X8,esk3_2(X8,X9)))|big_f(X9,esk3_2(X8,X9)))|big_f(esk1_0,esk2_0))&((~(big_f(X9,esk3_2(X8,X9)))|big_f(X8,esk3_2(X8,X9)))|big_f(esk1_0,esk2_0))))&((~(big_f(esk1_0,esk3_2(X8,X9)))|~(big_f(esk2_0,esk3_2(X8,X9))))&(big_f(esk1_0,esk3_2(X8,X9))|big_f(esk2_0,esk3_2(X8,X9))))),inference(distribute,[status(thm)],[5])).
% cnf(7,negated_conjecture,(big_f(esk2_0,esk3_2(X1,X2))|big_f(esk1_0,esk3_2(X1,X2))),inference(split_conjunct,[status(thm)],[6])).
% cnf(8,negated_conjecture,(~big_f(esk2_0,esk3_2(X1,X2))|~big_f(esk1_0,esk3_2(X1,X2))),inference(split_conjunct,[status(thm)],[6])).
% cnf(9,negated_conjecture,(big_f(esk1_0,esk2_0)|big_f(X1,esk3_2(X1,X2))|~big_f(X2,esk3_2(X1,X2))),inference(split_conjunct,[status(thm)],[6])).
% cnf(10,negated_conjecture,(big_f(esk1_0,esk2_0)|big_f(X1,esk3_2(X2,X1))|~big_f(X2,esk3_2(X2,X1))),inference(split_conjunct,[status(thm)],[6])).
% cnf(11,negated_conjecture,(big_f(X1,esk3_2(X2,X1))|big_f(X2,esk3_2(X2,X1))|~big_f(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[6])).
% cnf(12,negated_conjecture,(~big_f(esk1_0,esk2_0)|~big_f(X1,esk3_2(X2,X1))|~big_f(X2,esk3_2(X2,X1))),inference(split_conjunct,[status(thm)],[6])).
% cnf(14,negated_conjecture,(big_f(X1,esk3_2(esk1_0,X1))|big_f(esk1_0,esk2_0)|big_f(esk2_0,esk3_2(esk1_0,X1))),inference(spm,[status(thm)],[10,7,theory(equality)])).
% cnf(16,negated_conjecture,(big_f(esk2_0,esk3_2(esk1_0,X1))|~big_f(X1,esk3_2(esk1_0,X1))|~big_f(esk1_0,esk2_0)),inference(spm,[status(thm)],[12,7,theory(equality)])).
% cnf(17,negated_conjecture,(big_f(esk2_0,esk3_2(esk1_0,esk1_0))|~big_f(esk1_0,esk2_0)),inference(spm,[status(thm)],[16,7,theory(equality)])).
% cnf(18,negated_conjecture,(big_f(esk2_0,esk3_2(esk1_0,esk2_0))|big_f(esk1_0,esk2_0)),inference(ef,[status(thm)],[14,theory(equality)])).
% cnf(25,negated_conjecture,(big_f(esk1_0,esk3_2(esk1_0,esk2_0))|big_f(esk1_0,esk2_0)),inference(spm,[status(thm)],[9,18,theory(equality)])).
% cnf(36,negated_conjecture,(big_f(esk1_0,esk2_0)|~big_f(esk2_0,esk3_2(esk1_0,esk2_0))),inference(spm,[status(thm)],[8,25,theory(equality)])).
% cnf(37,negated_conjecture,(big_f(esk1_0,esk2_0)),inference(csr,[status(thm)],[36,18])).
% cnf(40,negated_conjecture,(big_f(esk2_0,esk3_2(esk1_0,esk1_0))|$false),inference(rw,[status(thm)],[17,37,theory(equality)])).
% cnf(41,negated_conjecture,(big_f(esk2_0,esk3_2(esk1_0,esk1_0))),inference(cn,[status(thm)],[40,theory(equality)])).
% cnf(50,negated_conjecture,(big_f(X1,esk3_2(X1,X2))|big_f(X2,esk3_2(X1,X2))|$false),inference(rw,[status(thm)],[11,37,theory(equality)])).
% cnf(51,negated_conjecture,(big_f(X1,esk3_2(X1,X2))|big_f(X2,esk3_2(X1,X2))),inference(cn,[status(thm)],[50,theory(equality)])).
% cnf(52,negated_conjecture,(big_f(X3,esk3_2(X3,X3))),inference(ef,[status(thm)],[51,theory(equality)])).
% cnf(56,negated_conjecture,(~big_f(esk2_0,esk3_2(esk1_0,esk1_0))),inference(spm,[status(thm)],[8,52,theory(equality)])).
% cnf(57,negated_conjecture,($false),inference(rw,[status(thm)],[56,41,theory(equality)])).
% cnf(58,negated_conjecture,($false),inference(cn,[status(thm)],[57,theory(equality)])).
% cnf(59,negated_conjecture,($false),58,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 23
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 22
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 10
% # Generated clauses : 29
% # ...of the previous two non-trivial : 23
% # Contextual simplify-reflections : 1
% # Paramodulations : 23
% # Factorizations : 6
% # Equation resolutions : 0
% # Current number of processed clauses: 6
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 3
% # Current number of unprocessed clauses: 5
% # ...number of literals in the above : 9
% # Clause-clause subsumption calls (NU) : 44
% # Rec. Clause-clause subsumption calls : 28
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 10 leaves, 1.40+/-0.800 terms/leaf
% # Paramod-from index: 4 leaves, 1.50+/-0.866 terms/leaf
% # Paramod-into index: 8 leaves, 1.50+/-0.866 terms/leaf
% # -------------------------------------------------
% # User time : 0.006 s
% # System time : 0.005 s
% # Total time : 0.011 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/SystemOnTPTP11153/SYN347+1.tptp
%
%------------------------------------------------------------------------------