TSTP Solution File: LCL686+1.001 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL686+1.001 : TPTP v5.0.0. Released v4.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 : Wed Dec 29 15:51:37 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/SystemOnTPTP1753/LCL686+1.001.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP1753/LCL686+1.001.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1753/LCL686+1.001.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 1851
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:r1(X1,X1),file('/tmp/SRASS.s.p', reflexivity)).
% fof(3, conjecture,~(?[X1]:~((![X2]:((~(r1(X1,X2))|~(p3(X2)))|![X1]:(~(r1(X2,X1))|~(p1(X1))))|![X2]:(~(r1(X1,X2))|~(![X1]:(~(r1(X2,X1))|~((((![X2]:(~(r1(X1,X2))|~($true))|~(![X2]:(~(r1(X1,X2))|~(((p2(X2)&~(p1(X2)))|(~(p2(X2))&p1(X2)))))))|![X2]:(~(r1(X1,X2))|p3(X2)))|![X2]:((~(r1(X1,X2))|(~(p1(X2))&~(p2(X2))))|(p2(X2)&p1(X2))))))))))),file('/tmp/SRASS.s.p', main)).
% fof(4, negated_conjecture,~(~(?[X1]:~((![X2]:((~(r1(X1,X2))|~(p3(X2)))|![X1]:(~(r1(X2,X1))|~(p1(X1))))|![X2]:(~(r1(X1,X2))|~(![X1]:(~(r1(X2,X1))|~((((![X2]:(~(r1(X1,X2))|~($true))|~(![X2]:(~(r1(X1,X2))|~(((p2(X2)&~(p1(X2)))|(~(p2(X2))&p1(X2)))))))|![X2]:(~(r1(X1,X2))|p3(X2)))|![X2]:((~(r1(X1,X2))|(~(p1(X2))&~(p2(X2))))|(p2(X2)&p1(X2)))))))))))),inference(assume_negation,[status(cth)],[3])).
% fof(5, negated_conjecture,~(~(?[X1]:~((![X2]:((~(r1(X1,X2))|~(p3(X2)))|![X1]:(~(r1(X2,X1))|~(p1(X1))))|![X2]:(~(r1(X1,X2))|~(![X1]:(~(r1(X2,X1))|~((((![X2]:~(r1(X1,X2))|~(![X2]:(~(r1(X1,X2))|~(((p2(X2)&~(p1(X2)))|(~(p2(X2))&p1(X2)))))))|![X2]:(~(r1(X1,X2))|p3(X2)))|![X2]:((~(r1(X1,X2))|(~(p1(X2))&~(p2(X2))))|(p2(X2)&p1(X2)))))))))))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(6, plain,![X2]:r1(X2,X2),inference(variable_rename,[status(thm)],[1])).
% cnf(7,plain,(r1(X1,X1)),inference(split_conjunct,[status(thm)],[6])).
% fof(11, negated_conjecture,?[X1]:(?[X2]:((r1(X1,X2)&p3(X2))&?[X1]:(r1(X2,X1)&p1(X1)))&?[X2]:(r1(X1,X2)&![X1]:(~(r1(X2,X1))|(((?[X2]:r1(X1,X2)&![X2]:(~(r1(X1,X2))|((~(p2(X2))|p1(X2))&(p2(X2)|~(p1(X2))))))&?[X2]:(r1(X1,X2)&~(p3(X2))))&?[X2]:((r1(X1,X2)&(p1(X2)|p2(X2)))&(~(p2(X2))|~(p1(X2)))))))),inference(fof_nnf,[status(thm)],[5])).
% fof(12, negated_conjecture,?[X3]:(?[X4]:((r1(X3,X4)&p3(X4))&?[X5]:(r1(X4,X5)&p1(X5)))&?[X6]:(r1(X3,X6)&![X7]:(~(r1(X6,X7))|(((?[X8]:r1(X7,X8)&![X9]:(~(r1(X7,X9))|((~(p2(X9))|p1(X9))&(p2(X9)|~(p1(X9))))))&?[X10]:(r1(X7,X10)&~(p3(X10))))&?[X11]:((r1(X7,X11)&(p1(X11)|p2(X11)))&(~(p2(X11))|~(p1(X11)))))))),inference(variable_rename,[status(thm)],[11])).
% fof(13, negated_conjecture,(((r1(esk1_0,esk2_0)&p3(esk2_0))&(r1(esk2_0,esk3_0)&p1(esk3_0)))&(r1(esk1_0,esk4_0)&![X7]:(~(r1(esk4_0,X7))|(((r1(X7,esk5_1(X7))&![X9]:(~(r1(X7,X9))|((~(p2(X9))|p1(X9))&(p2(X9)|~(p1(X9))))))&(r1(X7,esk6_1(X7))&~(p3(esk6_1(X7)))))&((r1(X7,esk7_1(X7))&(p1(esk7_1(X7))|p2(esk7_1(X7))))&(~(p2(esk7_1(X7)))|~(p1(esk7_1(X7))))))))),inference(skolemize,[status(esa)],[12])).
% fof(14, negated_conjecture,![X7]:![X9]:(((((((~(r1(X7,X9))|((~(p2(X9))|p1(X9))&(p2(X9)|~(p1(X9)))))&r1(X7,esk5_1(X7)))&(r1(X7,esk6_1(X7))&~(p3(esk6_1(X7)))))&((r1(X7,esk7_1(X7))&(p1(esk7_1(X7))|p2(esk7_1(X7))))&(~(p2(esk7_1(X7)))|~(p1(esk7_1(X7))))))|~(r1(esk4_0,X7)))&r1(esk1_0,esk4_0))&((r1(esk1_0,esk2_0)&p3(esk2_0))&(r1(esk2_0,esk3_0)&p1(esk3_0)))),inference(shift_quantors,[status(thm)],[13])).
% fof(15, negated_conjecture,![X7]:![X9]:(((((((((~(p2(X9))|p1(X9))|~(r1(X7,X9)))|~(r1(esk4_0,X7)))&(((p2(X9)|~(p1(X9)))|~(r1(X7,X9)))|~(r1(esk4_0,X7))))&(r1(X7,esk5_1(X7))|~(r1(esk4_0,X7))))&((r1(X7,esk6_1(X7))|~(r1(esk4_0,X7)))&(~(p3(esk6_1(X7)))|~(r1(esk4_0,X7)))))&(((r1(X7,esk7_1(X7))|~(r1(esk4_0,X7)))&((p1(esk7_1(X7))|p2(esk7_1(X7)))|~(r1(esk4_0,X7))))&((~(p2(esk7_1(X7)))|~(p1(esk7_1(X7))))|~(r1(esk4_0,X7)))))&r1(esk1_0,esk4_0))&((r1(esk1_0,esk2_0)&p3(esk2_0))&(r1(esk2_0,esk3_0)&p1(esk3_0)))),inference(distribute,[status(thm)],[14])).
% cnf(21,negated_conjecture,(~r1(esk4_0,X1)|~p1(esk7_1(X1))|~p2(esk7_1(X1))),inference(split_conjunct,[status(thm)],[15])).
% cnf(22,negated_conjecture,(p2(esk7_1(X1))|p1(esk7_1(X1))|~r1(esk4_0,X1)),inference(split_conjunct,[status(thm)],[15])).
% cnf(23,negated_conjecture,(r1(X1,esk7_1(X1))|~r1(esk4_0,X1)),inference(split_conjunct,[status(thm)],[15])).
% cnf(27,negated_conjecture,(p2(X2)|~r1(esk4_0,X1)|~r1(X1,X2)|~p1(X2)),inference(split_conjunct,[status(thm)],[15])).
% cnf(28,negated_conjecture,(p1(X2)|~r1(esk4_0,X1)|~r1(X1,X2)|~p2(X2)),inference(split_conjunct,[status(thm)],[15])).
% cnf(37,negated_conjecture,(p1(X1)|~p2(X1)|~r1(esk7_1(esk4_0),X1)|~r1(esk4_0,esk4_0)),inference(spm,[status(thm)],[28,23,theory(equality)])).
% cnf(41,negated_conjecture,(p1(X1)|~p2(X1)|~r1(esk7_1(esk4_0),X1)|$false),inference(rw,[status(thm)],[37,7,theory(equality)])).
% cnf(42,negated_conjecture,(p1(X1)|~p2(X1)|~r1(esk7_1(esk4_0),X1)),inference(cn,[status(thm)],[41,theory(equality)])).
% cnf(50,negated_conjecture,(p2(X1)|~p1(X1)|~r1(esk4_0,X1)),inference(spm,[status(thm)],[27,7,theory(equality)])).
% cnf(65,negated_conjecture,(~p1(esk7_1(X1))|~r1(esk4_0,X1)|~r1(esk4_0,esk7_1(X1))),inference(spm,[status(thm)],[21,50,theory(equality)])).
% cnf(75,negated_conjecture,(p1(esk7_1(esk4_0))|~p2(esk7_1(esk4_0))),inference(spm,[status(thm)],[42,7,theory(equality)])).
% cnf(78,negated_conjecture,(p1(esk7_1(esk4_0))|~r1(esk4_0,esk4_0)),inference(spm,[status(thm)],[75,22,theory(equality)])).
% cnf(79,negated_conjecture,(p1(esk7_1(esk4_0))|$false),inference(rw,[status(thm)],[78,7,theory(equality)])).
% cnf(80,negated_conjecture,(p1(esk7_1(esk4_0))),inference(cn,[status(thm)],[79,theory(equality)])).
% cnf(81,negated_conjecture,(~r1(esk4_0,esk7_1(esk4_0))|~r1(esk4_0,esk4_0)),inference(spm,[status(thm)],[65,80,theory(equality)])).
% cnf(83,negated_conjecture,(~r1(esk4_0,esk7_1(esk4_0))|$false),inference(rw,[status(thm)],[81,7,theory(equality)])).
% cnf(84,negated_conjecture,(~r1(esk4_0,esk7_1(esk4_0))),inference(cn,[status(thm)],[83,theory(equality)])).
% cnf(100,negated_conjecture,(~r1(esk4_0,esk4_0)),inference(spm,[status(thm)],[84,23,theory(equality)])).
% cnf(102,negated_conjecture,($false),inference(rw,[status(thm)],[100,7,theory(equality)])).
% cnf(103,negated_conjecture,($false),inference(cn,[status(thm)],[102,theory(equality)])).
% cnf(104,negated_conjecture,($false),103,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 44
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 44
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 51
% # ...of the previous two non-trivial : 39
% # Contextual simplify-reflections : 0
% # Paramodulations : 51
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 28
% # Positive orientable unit clauses: 7
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 20
% # Current number of unprocessed clauses: 25
% # ...number of literals in the above : 82
% # Clause-clause subsumption calls (NU) : 9
% # Rec. Clause-clause subsumption calls : 9
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 38 leaves, 1.18+/-0.683 terms/leaf
% # Paramod-from index: 13 leaves, 1.08+/-0.266 terms/leaf
% # Paramod-into index: 32 leaves, 1.09+/-0.291 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.002 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/SystemOnTPTP1753/LCL686+1.001.tptp
%
%------------------------------------------------------------------------------