TSTP Solution File: LCL499+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL499+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 13:46:53 EST 2010
% Result : Theorem 1.19s
% Output : Solution 1.19s
% 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/SystemOnTPTP7080/LCL499+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7080/LCL499+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7080/LCL499+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 7212
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,(kn1<=>![X1]:is_a_theorem(implies(X1,and(X1,X1)))),file('/tmp/SRASS.s.p', kn1)).
% fof(3, axiom,modus_ponens,file('/tmp/SRASS.s.p', principia_modus_ponens)).
% fof(4, axiom,r1,file('/tmp/SRASS.s.p', principia_r1)).
% fof(6, axiom,r3,file('/tmp/SRASS.s.p', principia_r3)).
% fof(15, axiom,op_implies_or,file('/tmp/SRASS.s.p', principia_op_implies_or)).
% fof(16, axiom,op_and,file('/tmp/SRASS.s.p', principia_op_and)).
% fof(20, axiom,(modus_ponens<=>![X2]:![X3]:((is_a_theorem(X2)&is_a_theorem(implies(X2,X3)))=>is_a_theorem(X3))),file('/tmp/SRASS.s.p', modus_ponens)).
% fof(26, axiom,(r1<=>![X1]:is_a_theorem(implies(or(X1,X1),X1))),file('/tmp/SRASS.s.p', r1)).
% fof(28, axiom,(r3<=>![X1]:![X4]:is_a_theorem(implies(or(X1,X4),or(X4,X1)))),file('/tmp/SRASS.s.p', r3)).
% fof(43, axiom,(op_and=>![X2]:![X3]:and(X2,X3)=not(or(not(X2),not(X3)))),file('/tmp/SRASS.s.p', op_and)).
% fof(44, axiom,(op_implies_or=>![X2]:![X3]:implies(X2,X3)=or(not(X2),X3)),file('/tmp/SRASS.s.p', op_implies_or)).
% fof(45, conjecture,kn1,file('/tmp/SRASS.s.p', rosser_kn1)).
% fof(46, negated_conjecture,~(kn1),inference(assume_negation,[status(cth)],[45])).
% fof(47, negated_conjecture,~(kn1),inference(fof_simplification,[status(thm)],[46,theory(equality)])).
% fof(48, plain,((~(kn1)|![X1]:is_a_theorem(implies(X1,and(X1,X1))))&(?[X1]:~(is_a_theorem(implies(X1,and(X1,X1))))|kn1)),inference(fof_nnf,[status(thm)],[1])).
% fof(49, plain,((~(kn1)|![X2]:is_a_theorem(implies(X2,and(X2,X2))))&(?[X3]:~(is_a_theorem(implies(X3,and(X3,X3))))|kn1)),inference(variable_rename,[status(thm)],[48])).
% fof(50, plain,((~(kn1)|![X2]:is_a_theorem(implies(X2,and(X2,X2))))&(~(is_a_theorem(implies(esk1_0,and(esk1_0,esk1_0))))|kn1)),inference(skolemize,[status(esa)],[49])).
% fof(51, plain,![X2]:((is_a_theorem(implies(X2,and(X2,X2)))|~(kn1))&(~(is_a_theorem(implies(esk1_0,and(esk1_0,esk1_0))))|kn1)),inference(shift_quantors,[status(thm)],[50])).
% cnf(52,plain,(kn1|~is_a_theorem(implies(esk1_0,and(esk1_0,esk1_0)))),inference(split_conjunct,[status(thm)],[51])).
% cnf(55,plain,(modus_ponens),inference(split_conjunct,[status(thm)],[3])).
% cnf(56,plain,(r1),inference(split_conjunct,[status(thm)],[4])).
% cnf(58,plain,(r3),inference(split_conjunct,[status(thm)],[6])).
% cnf(87,plain,(op_implies_or),inference(split_conjunct,[status(thm)],[15])).
% cnf(88,plain,(op_and),inference(split_conjunct,[status(thm)],[16])).
% fof(97, plain,((~(modus_ponens)|![X2]:![X3]:((~(is_a_theorem(X2))|~(is_a_theorem(implies(X2,X3))))|is_a_theorem(X3)))&(?[X2]:?[X3]:((is_a_theorem(X2)&is_a_theorem(implies(X2,X3)))&~(is_a_theorem(X3)))|modus_ponens)),inference(fof_nnf,[status(thm)],[20])).
% fof(98, plain,((~(modus_ponens)|![X4]:![X5]:((~(is_a_theorem(X4))|~(is_a_theorem(implies(X4,X5))))|is_a_theorem(X5)))&(?[X6]:?[X7]:((is_a_theorem(X6)&is_a_theorem(implies(X6,X7)))&~(is_a_theorem(X7)))|modus_ponens)),inference(variable_rename,[status(thm)],[97])).
% fof(99, plain,((~(modus_ponens)|![X4]:![X5]:((~(is_a_theorem(X4))|~(is_a_theorem(implies(X4,X5))))|is_a_theorem(X5)))&(((is_a_theorem(esk13_0)&is_a_theorem(implies(esk13_0,esk14_0)))&~(is_a_theorem(esk14_0)))|modus_ponens)),inference(skolemize,[status(esa)],[98])).
% fof(100, plain,![X4]:![X5]:((((~(is_a_theorem(X4))|~(is_a_theorem(implies(X4,X5))))|is_a_theorem(X5))|~(modus_ponens))&(((is_a_theorem(esk13_0)&is_a_theorem(implies(esk13_0,esk14_0)))&~(is_a_theorem(esk14_0)))|modus_ponens)),inference(shift_quantors,[status(thm)],[99])).
% fof(101, plain,![X4]:![X5]:((((~(is_a_theorem(X4))|~(is_a_theorem(implies(X4,X5))))|is_a_theorem(X5))|~(modus_ponens))&(((is_a_theorem(esk13_0)|modus_ponens)&(is_a_theorem(implies(esk13_0,esk14_0))|modus_ponens))&(~(is_a_theorem(esk14_0))|modus_ponens))),inference(distribute,[status(thm)],[100])).
% cnf(105,plain,(is_a_theorem(X1)|~modus_ponens|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2)),inference(split_conjunct,[status(thm)],[101])).
% fof(138, plain,((~(r1)|![X1]:is_a_theorem(implies(or(X1,X1),X1)))&(?[X1]:~(is_a_theorem(implies(or(X1,X1),X1)))|r1)),inference(fof_nnf,[status(thm)],[26])).
% fof(139, plain,((~(r1)|![X2]:is_a_theorem(implies(or(X2,X2),X2)))&(?[X3]:~(is_a_theorem(implies(or(X3,X3),X3)))|r1)),inference(variable_rename,[status(thm)],[138])).
% fof(140, plain,((~(r1)|![X2]:is_a_theorem(implies(or(X2,X2),X2)))&(~(is_a_theorem(implies(or(esk27_0,esk27_0),esk27_0)))|r1)),inference(skolemize,[status(esa)],[139])).
% fof(141, plain,![X2]:((is_a_theorem(implies(or(X2,X2),X2))|~(r1))&(~(is_a_theorem(implies(or(esk27_0,esk27_0),esk27_0)))|r1)),inference(shift_quantors,[status(thm)],[140])).
% cnf(143,plain,(is_a_theorem(implies(or(X1,X1),X1))|~r1),inference(split_conjunct,[status(thm)],[141])).
% fof(150, plain,((~(r3)|![X1]:![X4]:is_a_theorem(implies(or(X1,X4),or(X4,X1))))&(?[X1]:?[X4]:~(is_a_theorem(implies(or(X1,X4),or(X4,X1))))|r3)),inference(fof_nnf,[status(thm)],[28])).
% fof(151, plain,((~(r3)|![X5]:![X6]:is_a_theorem(implies(or(X5,X6),or(X6,X5))))&(?[X7]:?[X8]:~(is_a_theorem(implies(or(X7,X8),or(X8,X7))))|r3)),inference(variable_rename,[status(thm)],[150])).
% fof(152, plain,((~(r3)|![X5]:![X6]:is_a_theorem(implies(or(X5,X6),or(X6,X5))))&(~(is_a_theorem(implies(or(esk30_0,esk31_0),or(esk31_0,esk30_0))))|r3)),inference(skolemize,[status(esa)],[151])).
% fof(153, plain,![X5]:![X6]:((is_a_theorem(implies(or(X5,X6),or(X6,X5)))|~(r3))&(~(is_a_theorem(implies(or(esk30_0,esk31_0),or(esk31_0,esk30_0))))|r3)),inference(shift_quantors,[status(thm)],[152])).
% cnf(155,plain,(is_a_theorem(implies(or(X1,X2),or(X2,X1)))|~r3),inference(split_conjunct,[status(thm)],[153])).
% fof(234, plain,(~(op_and)|![X2]:![X3]:and(X2,X3)=not(or(not(X2),not(X3)))),inference(fof_nnf,[status(thm)],[43])).
% fof(235, plain,(~(op_and)|![X4]:![X5]:and(X4,X5)=not(or(not(X4),not(X5)))),inference(variable_rename,[status(thm)],[234])).
% fof(236, plain,![X4]:![X5]:(and(X4,X5)=not(or(not(X4),not(X5)))|~(op_and)),inference(shift_quantors,[status(thm)],[235])).
% cnf(237,plain,(and(X1,X2)=not(or(not(X1),not(X2)))|~op_and),inference(split_conjunct,[status(thm)],[236])).
% fof(238, plain,(~(op_implies_or)|![X2]:![X3]:implies(X2,X3)=or(not(X2),X3)),inference(fof_nnf,[status(thm)],[44])).
% fof(239, plain,(~(op_implies_or)|![X4]:![X5]:implies(X4,X5)=or(not(X4),X5)),inference(variable_rename,[status(thm)],[238])).
% fof(240, plain,![X4]:![X5]:(implies(X4,X5)=or(not(X4),X5)|~(op_implies_or)),inference(shift_quantors,[status(thm)],[239])).
% cnf(241,plain,(implies(X1,X2)=or(not(X1),X2)|~op_implies_or),inference(split_conjunct,[status(thm)],[240])).
% cnf(242,negated_conjecture,(~kn1),inference(split_conjunct,[status(thm)],[47])).
% cnf(247,plain,(~is_a_theorem(implies(esk1_0,and(esk1_0,esk1_0)))),inference(sr,[status(thm)],[52,242,theory(equality)])).
% cnf(254,plain,(or(not(X1),X2)=implies(X1,X2)|$false),inference(rw,[status(thm)],[241,87,theory(equality)])).
% cnf(255,plain,(or(not(X1),X2)=implies(X1,X2)),inference(cn,[status(thm)],[254,theory(equality)])).
% cnf(267,plain,(is_a_theorem(implies(or(X1,X1),X1))|$false),inference(rw,[status(thm)],[143,56,theory(equality)])).
% cnf(268,plain,(is_a_theorem(implies(or(X1,X1),X1))),inference(cn,[status(thm)],[267,theory(equality)])).
% cnf(269,plain,(is_a_theorem(implies(implies(X1,not(X1)),not(X1)))),inference(spm,[status(thm)],[268,255,theory(equality)])).
% cnf(270,plain,(is_a_theorem(X1)|$false|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(rw,[status(thm)],[105,55,theory(equality)])).
% cnf(271,plain,(is_a_theorem(X1)|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(cn,[status(thm)],[270,theory(equality)])).
% cnf(274,plain,(is_a_theorem(implies(or(X1,X2),or(X2,X1)))|$false),inference(rw,[status(thm)],[155,58,theory(equality)])).
% cnf(275,plain,(is_a_theorem(implies(or(X1,X2),or(X2,X1)))),inference(cn,[status(thm)],[274,theory(equality)])).
% cnf(276,plain,(is_a_theorem(or(X1,X2))|~is_a_theorem(or(X2,X1))),inference(spm,[status(thm)],[271,275,theory(equality)])).
% cnf(293,plain,(not(implies(X1,not(X2)))=and(X1,X2)|~op_and),inference(rw,[status(thm)],[237,255,theory(equality)])).
% cnf(294,plain,(not(implies(X1,not(X2)))=and(X1,X2)|$false),inference(rw,[status(thm)],[293,88,theory(equality)])).
% cnf(295,plain,(not(implies(X1,not(X2)))=and(X1,X2)),inference(cn,[status(thm)],[294,theory(equality)])).
% cnf(414,plain,(is_a_theorem(or(X1,not(X2)))|~is_a_theorem(implies(X2,X1))),inference(spm,[status(thm)],[276,255,theory(equality)])).
% cnf(469,plain,(is_a_theorem(or(not(X1),not(implies(X1,not(X1)))))),inference(spm,[status(thm)],[414,269,theory(equality)])).
% cnf(475,plain,(is_a_theorem(implies(X1,and(X1,X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[469,295,theory(equality)]),255,theory(equality)])).
% cnf(481,plain,($false),inference(rw,[status(thm)],[247,475,theory(equality)])).
% cnf(482,plain,($false),inference(cn,[status(thm)],[481,theory(equality)])).
% cnf(483,plain,($false),482,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 139
% # ...of these trivial : 12
% # ...subsumed : 9
% # ...remaining for further processing: 118
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 13
% # Generated clauses : 157
% # ...of the previous two non-trivial : 146
% # Contextual simplify-reflections : 0
% # Paramodulations : 157
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 105
% # Positive orientable unit clauses: 32
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 71
% # Current number of unprocessed clauses: 81
% # ...number of literals in the above : 116
% # Clause-clause subsumption calls (NU) : 780
% # Rec. Clause-clause subsumption calls : 780
% # Unit Clause-clause subsumption calls : 150
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 40
% # Indexed BW rewrite successes : 12
% # Backwards rewriting index: 212 leaves, 1.25+/-0.995 terms/leaf
% # Paramod-from index: 34 leaves, 1.03+/-0.169 terms/leaf
% # Paramod-into index: 193 leaves, 1.14+/-0.717 terms/leaf
% # -------------------------------------------------
% # User time : 0.023 s
% # System time : 0.006 s
% # Total time : 0.029 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.19 WC
% FINAL PrfWatch: 0.12 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP7080/LCL499+1.tptp
%
%------------------------------------------------------------------------------