TSTP Solution File: SYN074+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN074+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 : art07.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:19:23 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/SystemOnTPTP1647/SYN074+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP1647/SYN074+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1647/SYN074+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 1744
% 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, axiom,?[X1]:?[X2]:![X3]:![X4]:(big_f(X3,X4)<=>(X3=X1&X4=X2)),file('/tmp/SRASS.s.p', pel51_1)).
% fof(2, conjecture,?[X1]:![X3]:(?[X2]:![X4]:(big_f(X3,X4)<=>X4=X2)<=>X3=X1),file('/tmp/SRASS.s.p', pel51)).
% fof(3, negated_conjecture,~(?[X1]:![X3]:(?[X2]:![X4]:(big_f(X3,X4)<=>X4=X2)<=>X3=X1)),inference(assume_negation,[status(cth)],[2])).
% fof(4, plain,?[X1]:?[X2]:![X3]:![X4]:((~(big_f(X3,X4))|(X3=X1&X4=X2))&((~(X3=X1)|~(X4=X2))|big_f(X3,X4))),inference(fof_nnf,[status(thm)],[1])).
% fof(5, plain,?[X5]:?[X6]:![X7]:![X8]:((~(big_f(X7,X8))|(X7=X5&X8=X6))&((~(X7=X5)|~(X8=X6))|big_f(X7,X8))),inference(variable_rename,[status(thm)],[4])).
% fof(6, plain,![X7]:![X8]:((~(big_f(X7,X8))|(X7=esk1_0&X8=esk2_0))&((~(X7=esk1_0)|~(X8=esk2_0))|big_f(X7,X8))),inference(skolemize,[status(esa)],[5])).
% fof(7, plain,![X7]:![X8]:(((X7=esk1_0|~(big_f(X7,X8)))&(X8=esk2_0|~(big_f(X7,X8))))&((~(X7=esk1_0)|~(X8=esk2_0))|big_f(X7,X8))),inference(distribute,[status(thm)],[6])).
% cnf(8,plain,(big_f(X1,X2)|X2!=esk2_0|X1!=esk1_0),inference(split_conjunct,[status(thm)],[7])).
% cnf(9,plain,(X2=esk2_0|~big_f(X1,X2)),inference(split_conjunct,[status(thm)],[7])).
% cnf(10,plain,(X1=esk1_0|~big_f(X1,X2)),inference(split_conjunct,[status(thm)],[7])).
% fof(11, negated_conjecture,![X1]:?[X3]:((![X2]:?[X4]:((~(big_f(X3,X4))|~(X4=X2))&(big_f(X3,X4)|X4=X2))|~(X3=X1))&(?[X2]:![X4]:((~(big_f(X3,X4))|X4=X2)&(~(X4=X2)|big_f(X3,X4)))|X3=X1)),inference(fof_nnf,[status(thm)],[3])).
% fof(12, negated_conjecture,![X5]:?[X6]:((![X7]:?[X8]:((~(big_f(X6,X8))|~(X8=X7))&(big_f(X6,X8)|X8=X7))|~(X6=X5))&(?[X9]:![X10]:((~(big_f(X6,X10))|X10=X9)&(~(X10=X9)|big_f(X6,X10)))|X6=X5)),inference(variable_rename,[status(thm)],[11])).
% fof(13, negated_conjecture,![X5]:((![X7]:((~(big_f(esk3_1(X5),esk4_2(X5,X7)))|~(esk4_2(X5,X7)=X7))&(big_f(esk3_1(X5),esk4_2(X5,X7))|esk4_2(X5,X7)=X7))|~(esk3_1(X5)=X5))&(![X10]:((~(big_f(esk3_1(X5),X10))|X10=esk5_1(X5))&(~(X10=esk5_1(X5))|big_f(esk3_1(X5),X10)))|esk3_1(X5)=X5)),inference(skolemize,[status(esa)],[12])).
% fof(14, negated_conjecture,![X5]:![X7]:![X10]:((((~(big_f(esk3_1(X5),X10))|X10=esk5_1(X5))&(~(X10=esk5_1(X5))|big_f(esk3_1(X5),X10)))|esk3_1(X5)=X5)&(((~(big_f(esk3_1(X5),esk4_2(X5,X7)))|~(esk4_2(X5,X7)=X7))&(big_f(esk3_1(X5),esk4_2(X5,X7))|esk4_2(X5,X7)=X7))|~(esk3_1(X5)=X5))),inference(shift_quantors,[status(thm)],[13])).
% fof(15, negated_conjecture,![X5]:![X7]:![X10]:((((~(big_f(esk3_1(X5),X10))|X10=esk5_1(X5))|esk3_1(X5)=X5)&((~(X10=esk5_1(X5))|big_f(esk3_1(X5),X10))|esk3_1(X5)=X5))&(((~(big_f(esk3_1(X5),esk4_2(X5,X7)))|~(esk4_2(X5,X7)=X7))|~(esk3_1(X5)=X5))&((big_f(esk3_1(X5),esk4_2(X5,X7))|esk4_2(X5,X7)=X7)|~(esk3_1(X5)=X5)))),inference(distribute,[status(thm)],[14])).
% cnf(16,negated_conjecture,(esk4_2(X1,X2)=X2|big_f(esk3_1(X1),esk4_2(X1,X2))|esk3_1(X1)!=X1),inference(split_conjunct,[status(thm)],[15])).
% cnf(17,negated_conjecture,(esk3_1(X1)!=X1|esk4_2(X1,X2)!=X2|~big_f(esk3_1(X1),esk4_2(X1,X2))),inference(split_conjunct,[status(thm)],[15])).
% cnf(18,negated_conjecture,(esk3_1(X1)=X1|big_f(esk3_1(X1),X2)|X2!=esk5_1(X1)),inference(split_conjunct,[status(thm)],[15])).
% cnf(22,negated_conjecture,(esk3_1(X1)=X1|big_f(esk3_1(X1),esk5_1(X1))),inference(er,[status(thm)],[18,theory(equality)])).
% cnf(24,negated_conjecture,(esk1_0=esk3_1(X1)|esk4_2(X1,X2)=X2|esk3_1(X1)!=X1),inference(spm,[status(thm)],[10,16,theory(equality)])).
% cnf(25,negated_conjecture,(esk2_0=esk4_2(X1,X2)|esk4_2(X1,X2)=X2|esk3_1(X1)!=X1),inference(spm,[status(thm)],[9,16,theory(equality)])).
% cnf(27,negated_conjecture,(esk4_2(X1,X2)!=X2|esk3_1(X1)!=X1|esk1_0!=esk3_1(X1)|esk2_0!=esk4_2(X1,X2)),inference(spm,[status(thm)],[17,8,theory(equality)])).
% cnf(29,negated_conjecture,(esk1_0=esk3_1(X1)|esk3_1(X1)=X1),inference(spm,[status(thm)],[10,22,theory(equality)])).
% cnf(30,negated_conjecture,(esk2_0=esk5_1(X1)|esk3_1(X1)=X1),inference(spm,[status(thm)],[9,22,theory(equality)])).
% cnf(31,negated_conjecture,(esk3_1(X2)=X2|esk1_0!=X2),inference(ef,[status(thm)],[29,theory(equality)])).
% cnf(40,negated_conjecture,(esk4_2(X1,X2)!=X2|~big_f(X1,esk4_2(X1,X2))|esk1_0!=X1),inference(spm,[status(thm)],[17,31,theory(equality)])).
% cnf(43,negated_conjecture,(esk4_2(X1,X2)!=X2|~big_f(X1,esk4_2(X1,X2))),inference(csr,[status(thm)],[40,10])).
% cnf(47,negated_conjecture,(esk3_1(X1)=X1|big_f(esk3_1(X1),esk2_0)),inference(spm,[status(thm)],[22,30,theory(equality)])).
% cnf(55,negated_conjecture,(esk1_0=X1|big_f(esk1_0,esk2_0)|esk3_1(X1)=X1),inference(spm,[status(thm)],[47,29,theory(equality)])).
% cnf(57,negated_conjecture,(esk3_1(X1)=esk1_0|esk4_2(X1,X2)=X2),inference(csr,[status(thm)],[24,29])).
% cnf(60,negated_conjecture,(esk3_1(X1)=esk1_0|~big_f(X1,X2)),inference(spm,[status(thm)],[43,57,theory(equality)])).
% cnf(84,negated_conjecture,(esk3_1(X1)=X1|big_f(esk1_0,esk2_0)),inference(csr,[status(thm)],[55,31])).
% cnf(86,negated_conjecture,(esk3_1(esk1_0)=esk1_0|esk3_1(X1)=X1),inference(spm,[status(thm)],[60,84,theory(equality)])).
% cnf(116,negated_conjecture,(esk3_1(esk1_0)=esk1_0),inference(ef,[status(thm)],[86,theory(equality)])).
% cnf(130,negated_conjecture,(esk4_2(esk1_0,X1)=esk2_0|esk4_2(esk1_0,X1)=X1),inference(spm,[status(thm)],[25,116,theory(equality)])).
% cnf(135,negated_conjecture,(esk4_2(esk1_0,X2)=X2|esk2_0!=X2),inference(ef,[status(thm)],[130,theory(equality)])).
% cnf(164,negated_conjecture,(X1!=esk2_0|esk3_1(esk1_0)!=esk1_0),inference(spm,[status(thm)],[27,135,theory(equality)])).
% cnf(170,negated_conjecture,(X1!=esk2_0|$false),inference(rw,[status(thm)],[164,116,theory(equality)])).
% cnf(171,negated_conjecture,(X1!=esk2_0),inference(cn,[status(thm)],[170,theory(equality)])).
% cnf(172,negated_conjecture,($false),inference(er,[status(thm)],[171,theory(equality)])).
% cnf(175,negated_conjecture,($false),172,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 48
% # ...of these trivial : 2
% # ...subsumed : 9
% # ...remaining for further processing: 37
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 0
% # Generated clauses : 125
% # ...of the previous two non-trivial : 107
% # Contextual simplify-reflections : 8
% # Paramodulations : 114
% # Factorizations : 6
% # Equation resolutions : 3
% # Current number of processed clauses: 27
% # Positive orientable unit clauses: 1
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 25
% # Current number of unprocessed clauses: 52
% # ...number of literals in the above : 159
% # Clause-clause subsumption calls (NU) : 52
% # Rec. Clause-clause subsumption calls : 51
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 17 leaves, 1.06+/-0.235 terms/leaf
% # Paramod-from index: 11 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 16 leaves, 1.06+/-0.242 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.004 s
% # Total time : 0.014 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP1647/SYN074+1.tptp
%
%------------------------------------------------------------------------------