TSTP Solution File: SYN332+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN332+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 : art09.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:22:09 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/SystemOnTPTP13387/SYN332+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP13387/SYN332+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13387/SYN332+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 13483
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, conjecture,?[X1]:?[X2]:![X3]:(((big_f(X1,X2)&big_f(X2,X1))<~>big_f(X1,X3))=>((big_f(X1,X3)<=>big_f(X3,X1))=>((big_f(X1,X3)<=>big_f(X2,X3))=>(((big_f(X2,X1)=>big_f(X1,X2))<=>big_f(X3,X3))=>((big_f(X1,X2)<=>big_f(X2,X1))<=>big_f(X3,X2)))))),file('/tmp/SRASS.s.p', church_46_14_4)).
% fof(2, negated_conjecture,~(?[X1]:?[X2]:![X3]:(((big_f(X1,X2)&big_f(X2,X1))<~>big_f(X1,X3))=>((big_f(X1,X3)<=>big_f(X3,X1))=>((big_f(X1,X3)<=>big_f(X2,X3))=>(((big_f(X2,X1)=>big_f(X1,X2))<=>big_f(X3,X3))=>((big_f(X1,X2)<=>big_f(X2,X1))<=>big_f(X3,X2))))))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,~(?[X1]:?[X2]:![X3]:(~(((big_f(X1,X2)&big_f(X2,X1))<=>big_f(X1,X3)))=>((big_f(X1,X3)<=>big_f(X3,X1))=>((big_f(X1,X3)<=>big_f(X2,X3))=>(((big_f(X2,X1)=>big_f(X1,X2))<=>big_f(X3,X3))=>((big_f(X1,X2)<=>big_f(X2,X1))<=>big_f(X3,X2))))))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(4, negated_conjecture,![X1]:![X2]:?[X3]:((((~(big_f(X1,X2))|~(big_f(X2,X1)))|~(big_f(X1,X3)))&((big_f(X1,X2)&big_f(X2,X1))|big_f(X1,X3)))&(((~(big_f(X1,X3))|big_f(X3,X1))&(~(big_f(X3,X1))|big_f(X1,X3)))&(((~(big_f(X1,X3))|big_f(X2,X3))&(~(big_f(X2,X3))|big_f(X1,X3)))&((((big_f(X2,X1)&~(big_f(X1,X2)))|big_f(X3,X3))&(~(big_f(X3,X3))|(~(big_f(X2,X1))|big_f(X1,X2))))&((((~(big_f(X1,X2))|~(big_f(X2,X1)))&(big_f(X1,X2)|big_f(X2,X1)))|~(big_f(X3,X2)))&(((~(big_f(X1,X2))|big_f(X2,X1))&(~(big_f(X2,X1))|big_f(X1,X2)))|big_f(X3,X2))))))),inference(fof_nnf,[status(thm)],[3])).
% fof(5, negated_conjecture,![X4]:![X5]:?[X6]:((((~(big_f(X4,X5))|~(big_f(X5,X4)))|~(big_f(X4,X6)))&((big_f(X4,X5)&big_f(X5,X4))|big_f(X4,X6)))&(((~(big_f(X4,X6))|big_f(X6,X4))&(~(big_f(X6,X4))|big_f(X4,X6)))&(((~(big_f(X4,X6))|big_f(X5,X6))&(~(big_f(X5,X6))|big_f(X4,X6)))&((((big_f(X5,X4)&~(big_f(X4,X5)))|big_f(X6,X6))&(~(big_f(X6,X6))|(~(big_f(X5,X4))|big_f(X4,X5))))&((((~(big_f(X4,X5))|~(big_f(X5,X4)))&(big_f(X4,X5)|big_f(X5,X4)))|~(big_f(X6,X5)))&(((~(big_f(X4,X5))|big_f(X5,X4))&(~(big_f(X5,X4))|big_f(X4,X5)))|big_f(X6,X5))))))),inference(variable_rename,[status(thm)],[4])).
% fof(6, negated_conjecture,![X4]:![X5]:((((~(big_f(X4,X5))|~(big_f(X5,X4)))|~(big_f(X4,esk1_2(X4,X5))))&((big_f(X4,X5)&big_f(X5,X4))|big_f(X4,esk1_2(X4,X5))))&(((~(big_f(X4,esk1_2(X4,X5)))|big_f(esk1_2(X4,X5),X4))&(~(big_f(esk1_2(X4,X5),X4))|big_f(X4,esk1_2(X4,X5))))&(((~(big_f(X4,esk1_2(X4,X5)))|big_f(X5,esk1_2(X4,X5)))&(~(big_f(X5,esk1_2(X4,X5)))|big_f(X4,esk1_2(X4,X5))))&((((big_f(X5,X4)&~(big_f(X4,X5)))|big_f(esk1_2(X4,X5),esk1_2(X4,X5)))&(~(big_f(esk1_2(X4,X5),esk1_2(X4,X5)))|(~(big_f(X5,X4))|big_f(X4,X5))))&((((~(big_f(X4,X5))|~(big_f(X5,X4)))&(big_f(X4,X5)|big_f(X5,X4)))|~(big_f(esk1_2(X4,X5),X5)))&(((~(big_f(X4,X5))|big_f(X5,X4))&(~(big_f(X5,X4))|big_f(X4,X5)))|big_f(esk1_2(X4,X5),X5))))))),inference(skolemize,[status(esa)],[5])).
% fof(7, negated_conjecture,![X4]:![X5]:((((~(big_f(X4,X5))|~(big_f(X5,X4)))|~(big_f(X4,esk1_2(X4,X5))))&((big_f(X4,X5)|big_f(X4,esk1_2(X4,X5)))&(big_f(X5,X4)|big_f(X4,esk1_2(X4,X5)))))&(((~(big_f(X4,esk1_2(X4,X5)))|big_f(esk1_2(X4,X5),X4))&(~(big_f(esk1_2(X4,X5),X4))|big_f(X4,esk1_2(X4,X5))))&(((~(big_f(X4,esk1_2(X4,X5)))|big_f(X5,esk1_2(X4,X5)))&(~(big_f(X5,esk1_2(X4,X5)))|big_f(X4,esk1_2(X4,X5))))&((((big_f(X5,X4)|big_f(esk1_2(X4,X5),esk1_2(X4,X5)))&(~(big_f(X4,X5))|big_f(esk1_2(X4,X5),esk1_2(X4,X5))))&(~(big_f(esk1_2(X4,X5),esk1_2(X4,X5)))|(~(big_f(X5,X4))|big_f(X4,X5))))&((((~(big_f(X4,X5))|~(big_f(X5,X4)))|~(big_f(esk1_2(X4,X5),X5)))&((big_f(X4,X5)|big_f(X5,X4))|~(big_f(esk1_2(X4,X5),X5))))&(((~(big_f(X4,X5))|big_f(X5,X4))|big_f(esk1_2(X4,X5),X5))&((~(big_f(X5,X4))|big_f(X4,X5))|big_f(esk1_2(X4,X5),X5)))))))),inference(distribute,[status(thm)],[6])).
% cnf(10,negated_conjecture,(big_f(X2,X1)|big_f(X1,X2)|~big_f(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[7])).
% cnf(11,negated_conjecture,(~big_f(esk1_2(X1,X2),X2)|~big_f(X2,X1)|~big_f(X1,X2)),inference(split_conjunct,[status(thm)],[7])).
% cnf(12,negated_conjecture,(big_f(X1,X2)|~big_f(X2,X1)|~big_f(esk1_2(X1,X2),esk1_2(X1,X2))),inference(split_conjunct,[status(thm)],[7])).
% cnf(16,negated_conjecture,(big_f(X1,esk1_2(X2,X1))|~big_f(X2,esk1_2(X2,X1))),inference(split_conjunct,[status(thm)],[7])).
% cnf(18,negated_conjecture,(big_f(esk1_2(X1,X2),X1)|~big_f(X1,esk1_2(X1,X2))),inference(split_conjunct,[status(thm)],[7])).
% cnf(19,negated_conjecture,(big_f(X1,esk1_2(X1,X2))|big_f(X2,X1)),inference(split_conjunct,[status(thm)],[7])).
% cnf(20,negated_conjecture,(big_f(X1,esk1_2(X1,X2))|big_f(X1,X2)),inference(split_conjunct,[status(thm)],[7])).
% cnf(27,negated_conjecture,(big_f(X1,X1)|~big_f(X1,esk1_2(X1,X1))),inference(spm,[status(thm)],[10,18,theory(equality)])).
% cnf(28,negated_conjecture,(big_f(X1,esk1_2(X2,X1))|big_f(X1,X2)),inference(spm,[status(thm)],[16,19,theory(equality)])).
% cnf(29,negated_conjecture,(big_f(X1,esk1_2(X2,X1))|big_f(X2,X1)),inference(spm,[status(thm)],[16,20,theory(equality)])).
% cnf(36,negated_conjecture,(~big_f(X1,X1)|~big_f(X1,esk1_2(X1,X1))),inference(spm,[status(thm)],[11,18,theory(equality)])).
% cnf(49,negated_conjecture,(big_f(X1,X1)),inference(csr,[status(thm)],[27,29])).
% cnf(50,negated_conjecture,(~big_f(X1,esk1_2(X1,X1))|$false),inference(rw,[status(thm)],[36,49,theory(equality)])).
% cnf(51,negated_conjecture,(~big_f(X1,esk1_2(X1,X1))),inference(cn,[status(thm)],[50,theory(equality)])).
% cnf(54,negated_conjecture,(big_f(X1,X2)|$false|~big_f(X2,X1)),inference(rw,[status(thm)],[12,49,theory(equality)])).
% cnf(55,negated_conjecture,(big_f(X1,X2)|~big_f(X2,X1)),inference(cn,[status(thm)],[54,theory(equality)])).
% cnf(67,negated_conjecture,(big_f(esk1_2(X1,X2),X2)|big_f(X2,X1)),inference(spm,[status(thm)],[55,28,theory(equality)])).
% cnf(87,negated_conjecture,(big_f(X1,X2)|big_f(X2,X1)),inference(spm,[status(thm)],[10,67,theory(equality)])).
% cnf(88,negated_conjecture,(big_f(X1,X2)),inference(csr,[status(thm)],[87,55])).
% cnf(93,negated_conjecture,($false),inference(rw,[status(thm)],[51,88,theory(equality)])).
% cnf(94,negated_conjecture,($false),inference(cn,[status(thm)],[93,theory(equality)])).
% cnf(95,negated_conjecture,($false),94,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 44
% # ...of these trivial : 1
% # ...subsumed : 5
% # ...remaining for further processing: 38
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 19
% # Generated clauses : 45
% # ...of the previous two non-trivial : 20
% # Contextual simplify-reflections : 2
% # Paramodulations : 45
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 1
% # Positive orientable unit clauses: 1
% # 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) : 181
% # Rec. Clause-clause subsumption calls : 159
% # Unit Clause-clause subsumption calls : 18
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 23
% # Indexed BW rewrite successes : 13
% # Backwards rewriting index: 2 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 1 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 1 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.011 s
% # System time : 0.002 s
% # Total time : 0.013 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/SystemOnTPTP13387/SYN332+1.tptp
%
%------------------------------------------------------------------------------