TSTP Solution File: SYN075+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN075+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:29 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/SystemOnTPTP1913/SYN075+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP1913/SYN075+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1913/SYN075+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 2023
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.010 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', pel52_1)).
% fof(2, conjecture,?[X2]:![X4]:(?[X1]:![X3]:(big_f(X3,X4)<=>X3=X1)<=>X4=X2),file('/tmp/SRASS.s.p', pel52)).
% fof(3, negated_conjecture,~(?[X2]:![X4]:(?[X1]:![X3]:(big_f(X3,X4)<=>X3=X1)<=>X4=X2)),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,![X2]:?[X4]:((![X1]:?[X3]:((~(big_f(X3,X4))|~(X3=X1))&(big_f(X3,X4)|X3=X1))|~(X4=X2))&(?[X1]:![X3]:((~(big_f(X3,X4))|X3=X1)&(~(X3=X1)|big_f(X3,X4)))|X4=X2)),inference(fof_nnf,[status(thm)],[3])).
% fof(12, negated_conjecture,![X5]:?[X6]:((![X7]:?[X8]:((~(big_f(X8,X6))|~(X8=X7))&(big_f(X8,X6)|X8=X7))|~(X6=X5))&(?[X9]:![X10]:((~(big_f(X10,X6))|X10=X9)&(~(X10=X9)|big_f(X10,X6)))|X6=X5)),inference(variable_rename,[status(thm)],[11])).
% fof(13, negated_conjecture,![X5]:((![X7]:((~(big_f(esk4_2(X5,X7),esk3_1(X5)))|~(esk4_2(X5,X7)=X7))&(big_f(esk4_2(X5,X7),esk3_1(X5))|esk4_2(X5,X7)=X7))|~(esk3_1(X5)=X5))&(![X10]:((~(big_f(X10,esk3_1(X5)))|X10=esk5_1(X5))&(~(X10=esk5_1(X5))|big_f(X10,esk3_1(X5))))|esk3_1(X5)=X5)),inference(skolemize,[status(esa)],[12])).
% fof(14, negated_conjecture,![X5]:![X7]:![X10]:((((~(big_f(X10,esk3_1(X5)))|X10=esk5_1(X5))&(~(X10=esk5_1(X5))|big_f(X10,esk3_1(X5))))|esk3_1(X5)=X5)&(((~(big_f(esk4_2(X5,X7),esk3_1(X5)))|~(esk4_2(X5,X7)=X7))&(big_f(esk4_2(X5,X7),esk3_1(X5))|esk4_2(X5,X7)=X7))|~(esk3_1(X5)=X5))),inference(shift_quantors,[status(thm)],[13])).
% fof(15, negated_conjecture,![X5]:![X7]:![X10]:((((~(big_f(X10,esk3_1(X5)))|X10=esk5_1(X5))|esk3_1(X5)=X5)&((~(X10=esk5_1(X5))|big_f(X10,esk3_1(X5)))|esk3_1(X5)=X5))&(((~(big_f(esk4_2(X5,X7),esk3_1(X5)))|~(esk4_2(X5,X7)=X7))|~(esk3_1(X5)=X5))&((big_f(esk4_2(X5,X7),esk3_1(X5))|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(esk4_2(X1,X2),esk3_1(X1))|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(esk4_2(X1,X2),esk3_1(X1))),inference(split_conjunct,[status(thm)],[15])).
% cnf(18,negated_conjecture,(esk3_1(X1)=X1|big_f(X2,esk3_1(X1))|X2!=esk5_1(X1)),inference(split_conjunct,[status(thm)],[15])).
% cnf(22,negated_conjecture,(esk3_1(X1)=X1|big_f(esk5_1(X1),esk3_1(X1))),inference(er,[status(thm)],[18,theory(equality)])).
% cnf(24,negated_conjecture,(esk1_0=esk4_2(X1,X2)|esk4_2(X1,X2)=X2|esk3_1(X1)!=X1),inference(spm,[status(thm)],[10,16,theory(equality)])).
% cnf(25,negated_conjecture,(esk2_0=esk3_1(X1)|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!=esk4_2(X1,X2)|esk2_0!=esk3_1(X1)),inference(spm,[status(thm)],[17,8,theory(equality)])).
% cnf(29,negated_conjecture,(esk1_0=esk5_1(X1)|esk3_1(X1)=X1),inference(spm,[status(thm)],[10,22,theory(equality)])).
% cnf(30,negated_conjecture,(esk2_0=esk3_1(X1)|esk3_1(X1)=X1),inference(spm,[status(thm)],[9,22,theory(equality)])).
% cnf(32,negated_conjecture,(esk3_1(X1)=X1|big_f(esk1_0,esk3_1(X1))),inference(spm,[status(thm)],[22,29,theory(equality)])).
% cnf(33,negated_conjecture,(esk3_1(X2)=X2|esk2_0!=X2),inference(ef,[status(thm)],[30,theory(equality)])).
% cnf(46,negated_conjecture,(esk4_2(X1,X2)!=X2|~big_f(esk4_2(X1,X2),X1)|esk2_0!=X1),inference(spm,[status(thm)],[17,33,theory(equality)])).
% cnf(54,negated_conjecture,(esk2_0=X1|big_f(esk1_0,esk2_0)|esk3_1(X1)=X1),inference(spm,[status(thm)],[32,30,theory(equality)])).
% cnf(60,negated_conjecture,(esk4_2(X1,X2)!=X2|~big_f(esk4_2(X1,X2),X1)),inference(csr,[status(thm)],[46,9])).
% cnf(70,negated_conjecture,(esk3_1(X1)=X1|big_f(esk1_0,esk2_0)),inference(csr,[status(thm)],[54,33])).
% cnf(75,negated_conjecture,(esk3_1(X1)=esk2_0|esk4_2(X1,X2)=X2),inference(csr,[status(thm)],[25,30])).
% cnf(78,negated_conjecture,(esk3_1(X1)=esk2_0|~big_f(X2,X1)),inference(spm,[status(thm)],[60,75,theory(equality)])).
% cnf(84,negated_conjecture,(esk3_1(esk2_0)=esk2_0|esk3_1(X1)=X1),inference(spm,[status(thm)],[78,70,theory(equality)])).
% cnf(99,negated_conjecture,(esk3_1(esk2_0)=esk2_0),inference(ef,[status(thm)],[84,theory(equality)])).
% cnf(111,negated_conjecture,(esk4_2(esk2_0,X1)=esk1_0|esk4_2(esk2_0,X1)=X1),inference(spm,[status(thm)],[24,99,theory(equality)])).
% cnf(112,negated_conjecture,(esk4_2(esk2_0,X2)=X2|esk1_0!=X2),inference(ef,[status(thm)],[111,theory(equality)])).
% cnf(141,negated_conjecture,(X1!=esk1_0|esk3_1(esk2_0)!=esk2_0),inference(spm,[status(thm)],[27,112,theory(equality)])).
% cnf(148,negated_conjecture,(X1!=esk1_0|$false),inference(rw,[status(thm)],[141,99,theory(equality)])).
% cnf(149,negated_conjecture,(X1!=esk1_0),inference(cn,[status(thm)],[148,theory(equality)])).
% cnf(150,negated_conjecture,($false),inference(er,[status(thm)],[149,theory(equality)])).
% cnf(153,negated_conjecture,($false),150,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 44
% # ...of these trivial : 0
% # ...subsumed : 5
% # ...remaining for further processing: 39
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 0
% # Generated clauses : 110
% # ...of the previous two non-trivial : 92
% # Contextual simplify-reflections : 4
% # Paramodulations : 99
% # Factorizations : 6
% # Equation resolutions : 3
% # Current number of processed clauses: 26
% # Positive orientable unit clauses: 1
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 24
% # Current number of unprocessed clauses: 41
% # ...number of literals in the above : 121
% # Clause-clause subsumption calls (NU) : 36
% # Rec. Clause-clause subsumption calls : 31
% # Unit Clause-clause subsumption calls : 7
% # 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.011 s
% # System time : 0.003 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/SystemOnTPTP1913/SYN075+1.tptp
%
%------------------------------------------------------------------------------