TSTP Solution File: LCL488+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL488+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 : art01.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 13:39:56 EST 2010
% Result : Theorem 1.15s
% Output : Solution 1.15s
% 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/SystemOnTPTP16731/LCL488+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16731/LCL488+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16731/LCL488+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 16827
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,(and_2<=>![X1]:![X2]:is_a_theorem(implies(and(X1,X2),X2))),file('/tmp/SRASS.s.p', and_2)).
% fof(3, axiom,modus_ponens,file('/tmp/SRASS.s.p', principia_modus_ponens)).
% fof(5, axiom,r2,file('/tmp/SRASS.s.p', principia_r2)).
% fof(6, axiom,r3,file('/tmp/SRASS.s.p', principia_r3)).
% fof(9, axiom,op_implies_and,file('/tmp/SRASS.s.p', hilbert_op_implies_and)).
% 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(18, axiom,op_or,file('/tmp/SRASS.s.p', hilbert_op_or)).
% fof(20, axiom,(modus_ponens<=>![X1]:![X2]:((is_a_theorem(X1)&is_a_theorem(implies(X1,X2)))=>is_a_theorem(X2))),file('/tmp/SRASS.s.p', modus_ponens)).
% fof(27, axiom,(r2<=>![X3]:![X4]:is_a_theorem(implies(X4,or(X3,X4)))),file('/tmp/SRASS.s.p', r2)).
% fof(28, axiom,(r3<=>![X3]:![X4]:is_a_theorem(implies(or(X3,X4),or(X4,X3)))),file('/tmp/SRASS.s.p', r3)).
% fof(40, axiom,(op_implies_and=>![X1]:![X2]:implies(X1,X2)=not(and(X1,not(X2)))),file('/tmp/SRASS.s.p', op_implies_and)).
% fof(42, axiom,(op_or=>![X1]:![X2]:or(X1,X2)=not(and(not(X1),not(X2)))),file('/tmp/SRASS.s.p', op_or)).
% fof(43, axiom,(op_and=>![X1]:![X2]:and(X1,X2)=not(or(not(X1),not(X2)))),file('/tmp/SRASS.s.p', op_and)).
% fof(44, axiom,(op_implies_or=>![X1]:![X2]:implies(X1,X2)=or(not(X1),X2)),file('/tmp/SRASS.s.p', op_implies_or)).
% fof(45, conjecture,and_2,file('/tmp/SRASS.s.p', hilbert_and_2)).
% fof(46, negated_conjecture,~(and_2),inference(assume_negation,[status(cth)],[45])).
% fof(47, negated_conjecture,~(and_2),inference(fof_simplification,[status(thm)],[46,theory(equality)])).
% fof(48, plain,((~(and_2)|![X1]:![X2]:is_a_theorem(implies(and(X1,X2),X2)))&(?[X1]:?[X2]:~(is_a_theorem(implies(and(X1,X2),X2)))|and_2)),inference(fof_nnf,[status(thm)],[1])).
% fof(49, plain,((~(and_2)|![X3]:![X4]:is_a_theorem(implies(and(X3,X4),X4)))&(?[X5]:?[X6]:~(is_a_theorem(implies(and(X5,X6),X6)))|and_2)),inference(variable_rename,[status(thm)],[48])).
% fof(50, plain,((~(and_2)|![X3]:![X4]:is_a_theorem(implies(and(X3,X4),X4)))&(~(is_a_theorem(implies(and(esk1_0,esk2_0),esk2_0)))|and_2)),inference(skolemize,[status(esa)],[49])).
% fof(51, plain,![X3]:![X4]:((is_a_theorem(implies(and(X3,X4),X4))|~(and_2))&(~(is_a_theorem(implies(and(esk1_0,esk2_0),esk2_0)))|and_2)),inference(shift_quantors,[status(thm)],[50])).
% cnf(52,plain,(and_2|~is_a_theorem(implies(and(esk1_0,esk2_0),esk2_0))),inference(split_conjunct,[status(thm)],[51])).
% cnf(55,plain,(modus_ponens),inference(split_conjunct,[status(thm)],[3])).
% cnf(57,plain,(r2),inference(split_conjunct,[status(thm)],[5])).
% cnf(58,plain,(r3),inference(split_conjunct,[status(thm)],[6])).
% cnf(61,plain,(op_implies_and),inference(split_conjunct,[status(thm)],[9])).
% cnf(87,plain,(op_implies_or),inference(split_conjunct,[status(thm)],[15])).
% cnf(88,plain,(op_and),inference(split_conjunct,[status(thm)],[16])).
% cnf(90,plain,(op_or),inference(split_conjunct,[status(thm)],[18])).
% fof(97, plain,((~(modus_ponens)|![X1]:![X2]:((~(is_a_theorem(X1))|~(is_a_theorem(implies(X1,X2))))|is_a_theorem(X2)))&(?[X1]:?[X2]:((is_a_theorem(X1)&is_a_theorem(implies(X1,X2)))&~(is_a_theorem(X2)))|modus_ponens)),inference(fof_nnf,[status(thm)],[20])).
% fof(98, plain,((~(modus_ponens)|![X3]:![X4]:((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4)))&(?[X5]:?[X6]:((is_a_theorem(X5)&is_a_theorem(implies(X5,X6)))&~(is_a_theorem(X6)))|modus_ponens)),inference(variable_rename,[status(thm)],[97])).
% fof(99, plain,((~(modus_ponens)|![X3]:![X4]:((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4)))&(((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,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4))|~(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,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4))|~(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(144, plain,((~(r2)|![X3]:![X4]:is_a_theorem(implies(X4,or(X3,X4))))&(?[X3]:?[X4]:~(is_a_theorem(implies(X4,or(X3,X4))))|r2)),inference(fof_nnf,[status(thm)],[27])).
% fof(145, plain,((~(r2)|![X5]:![X6]:is_a_theorem(implies(X6,or(X5,X6))))&(?[X7]:?[X8]:~(is_a_theorem(implies(X8,or(X7,X8))))|r2)),inference(variable_rename,[status(thm)],[144])).
% fof(146, plain,((~(r2)|![X5]:![X6]:is_a_theorem(implies(X6,or(X5,X6))))&(~(is_a_theorem(implies(esk29_0,or(esk28_0,esk29_0))))|r2)),inference(skolemize,[status(esa)],[145])).
% fof(147, plain,![X5]:![X6]:((is_a_theorem(implies(X6,or(X5,X6)))|~(r2))&(~(is_a_theorem(implies(esk29_0,or(esk28_0,esk29_0))))|r2)),inference(shift_quantors,[status(thm)],[146])).
% cnf(149,plain,(is_a_theorem(implies(X1,or(X2,X1)))|~r2),inference(split_conjunct,[status(thm)],[147])).
% fof(150, plain,((~(r3)|![X3]:![X4]:is_a_theorem(implies(or(X3,X4),or(X4,X3))))&(?[X3]:?[X4]:~(is_a_theorem(implies(or(X3,X4),or(X4,X3))))|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(222, plain,(~(op_implies_and)|![X1]:![X2]:implies(X1,X2)=not(and(X1,not(X2)))),inference(fof_nnf,[status(thm)],[40])).
% fof(223, plain,(~(op_implies_and)|![X3]:![X4]:implies(X3,X4)=not(and(X3,not(X4)))),inference(variable_rename,[status(thm)],[222])).
% fof(224, plain,![X3]:![X4]:(implies(X3,X4)=not(and(X3,not(X4)))|~(op_implies_and)),inference(shift_quantors,[status(thm)],[223])).
% cnf(225,plain,(implies(X1,X2)=not(and(X1,not(X2)))|~op_implies_and),inference(split_conjunct,[status(thm)],[224])).
% fof(230, plain,(~(op_or)|![X1]:![X2]:or(X1,X2)=not(and(not(X1),not(X2)))),inference(fof_nnf,[status(thm)],[42])).
% fof(231, plain,(~(op_or)|![X3]:![X4]:or(X3,X4)=not(and(not(X3),not(X4)))),inference(variable_rename,[status(thm)],[230])).
% fof(232, plain,![X3]:![X4]:(or(X3,X4)=not(and(not(X3),not(X4)))|~(op_or)),inference(shift_quantors,[status(thm)],[231])).
% cnf(233,plain,(or(X1,X2)=not(and(not(X1),not(X2)))|~op_or),inference(split_conjunct,[status(thm)],[232])).
% fof(234, plain,(~(op_and)|![X1]:![X2]:and(X1,X2)=not(or(not(X1),not(X2)))),inference(fof_nnf,[status(thm)],[43])).
% fof(235, plain,(~(op_and)|![X3]:![X4]:and(X3,X4)=not(or(not(X3),not(X4)))),inference(variable_rename,[status(thm)],[234])).
% fof(236, plain,![X3]:![X4]:(and(X3,X4)=not(or(not(X3),not(X4)))|~(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)|![X1]:![X2]:implies(X1,X2)=or(not(X1),X2)),inference(fof_nnf,[status(thm)],[44])).
% fof(239, plain,(~(op_implies_or)|![X3]:![X4]:implies(X3,X4)=or(not(X3),X4)),inference(variable_rename,[status(thm)],[238])).
% fof(240, plain,![X3]:![X4]:(implies(X3,X4)=or(not(X3),X4)|~(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,(~and_2),inference(split_conjunct,[status(thm)],[47])).
% cnf(247,plain,(~is_a_theorem(implies(and(esk1_0,esk2_0),esk2_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(257,plain,(is_a_theorem(implies(X1,or(X2,X1)))|$false),inference(rw,[status(thm)],[149,57,theory(equality)])).
% cnf(258,plain,(is_a_theorem(implies(X1,or(X2,X1)))),inference(cn,[status(thm)],[257,theory(equality)])).
% cnf(259,plain,(is_a_theorem(implies(X1,implies(X2,X1)))),inference(spm,[status(thm)],[258,255,theory(equality)])).
% cnf(263,plain,(not(and(X1,not(X2)))=implies(X1,X2)|$false),inference(rw,[status(thm)],[225,61,theory(equality)])).
% cnf(264,plain,(not(and(X1,not(X2)))=implies(X1,X2)),inference(cn,[status(thm)],[263,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(279,plain,(implies(not(X1),X2)=or(X1,X2)|~op_or),inference(rw,[status(thm)],[233,264,theory(equality)])).
% cnf(280,plain,(implies(not(X1),X2)=or(X1,X2)|$false),inference(rw,[status(thm)],[279,90,theory(equality)])).
% cnf(281,plain,(implies(not(X1),X2)=or(X1,X2)),inference(cn,[status(thm)],[280,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(297,plain,(implies(and(X1,X2),X3)=or(implies(X1,not(X2)),X3)),inference(spm,[status(thm)],[281,295,theory(equality)])).
% cnf(330,plain,(is_a_theorem(or(X1,implies(X2,not(X1))))),inference(spm,[status(thm)],[259,281,theory(equality)])).
% cnf(674,plain,(is_a_theorem(or(implies(X1,not(X2)),X2))),inference(spm,[status(thm)],[276,330,theory(equality)])).
% cnf(857,plain,(is_a_theorem(implies(and(X1,X2),X2))),inference(rw,[status(thm)],[674,297,theory(equality)])).
% cnf(883,plain,($false),inference(rw,[status(thm)],[247,857,theory(equality)])).
% cnf(884,plain,($false),inference(cn,[status(thm)],[883,theory(equality)])).
% cnf(885,plain,($false),884,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 189
% # ...of these trivial : 16
% # ...subsumed : 25
% # ...remaining for further processing: 148
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 22
% # Generated clauses : 430
% # ...of the previous two non-trivial : 370
% # Contextual simplify-reflections : 1
% # Paramodulations : 430
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 126
% # Positive orientable unit clauses: 51
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 73
% # Current number of unprocessed clauses: 217
% # ...number of literals in the above : 289
% # Clause-clause subsumption calls (NU) : 787
% # Rec. Clause-clause subsumption calls : 787
% # Unit Clause-clause subsumption calls : 234
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 102
% # Indexed BW rewrite successes : 20
% # Backwards rewriting index: 229 leaves, 1.32+/-1.049 terms/leaf
% # Paramod-from index: 50 leaves, 1.16+/-0.418 terms/leaf
% # Paramod-into index: 212 leaves, 1.23+/-0.794 terms/leaf
% # -------------------------------------------------
% # User time : 0.034 s
% # System time : 0.003 s
% # Total time : 0.037 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.25 WC
% FINAL PrfWatch: 0.14 CPU 0.25 WC
% SZS output end Solution for /tmp/SystemOnTPTP16731/LCL488+1.tptp
%
%------------------------------------------------------------------------------