TSTP Solution File: LCL494+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL494+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 : art06.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:41:17 EST 2010
% Result : Theorem 3.57s
% Output : Solution 3.57s
% 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/SystemOnTPTP13132/LCL494+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13132/LCL494+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13132/LCL494+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 13228
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.93 CPU 2.03 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,(equivalence_2<=>![X1]:![X2]:is_a_theorem(implies(equiv(X1,X2),implies(X2,X1)))),file('/tmp/SRASS.s.p', equivalence_2)).
% fof(2, axiom,op_equiv,file('/tmp/SRASS.s.p', principia_op_equiv)).
% 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(13, axiom,op_implies_or,file('/tmp/SRASS.s.p', principia_op_implies_or)).
% fof(14, axiom,op_and,file('/tmp/SRASS.s.p', principia_op_and)).
% fof(15, axiom,op_or,file('/tmp/SRASS.s.p', hilbert_op_or)).
% fof(16, axiom,op_implies_and,file('/tmp/SRASS.s.p', hilbert_op_implies_and)).
% fof(17, 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(23, axiom,(op_implies_and=>![X1]:![X2]:implies(X1,X2)=not(and(X1,not(X2)))),file('/tmp/SRASS.s.p', op_implies_and)).
% fof(25, axiom,(r2<=>![X4]:![X5]:is_a_theorem(implies(X5,or(X4,X5)))),file('/tmp/SRASS.s.p', r2)).
% fof(26, axiom,(r3<=>![X4]:![X5]:is_a_theorem(implies(or(X4,X5),or(X5,X4)))),file('/tmp/SRASS.s.p', r3)).
% fof(29, axiom,(op_equiv=>![X1]:![X2]:equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))),file('/tmp/SRASS.s.p', op_equiv)).
% fof(41, axiom,(op_or=>![X1]:![X2]:or(X1,X2)=not(and(not(X1),not(X2)))),file('/tmp/SRASS.s.p', op_or)).
% fof(42, 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,equivalence_2,file('/tmp/SRASS.s.p', hilbert_equivalence_2)).
% fof(46, negated_conjecture,~(equivalence_2),inference(assume_negation,[status(cth)],[45])).
% fof(47, negated_conjecture,~(equivalence_2),inference(fof_simplification,[status(thm)],[46,theory(equality)])).
% fof(48, plain,((~(equivalence_2)|![X1]:![X2]:is_a_theorem(implies(equiv(X1,X2),implies(X2,X1))))&(?[X1]:?[X2]:~(is_a_theorem(implies(equiv(X1,X2),implies(X2,X1))))|equivalence_2)),inference(fof_nnf,[status(thm)],[1])).
% fof(49, plain,((~(equivalence_2)|![X3]:![X4]:is_a_theorem(implies(equiv(X3,X4),implies(X4,X3))))&(?[X5]:?[X6]:~(is_a_theorem(implies(equiv(X5,X6),implies(X6,X5))))|equivalence_2)),inference(variable_rename,[status(thm)],[48])).
% fof(50, plain,((~(equivalence_2)|![X3]:![X4]:is_a_theorem(implies(equiv(X3,X4),implies(X4,X3))))&(~(is_a_theorem(implies(equiv(esk1_0,esk2_0),implies(esk2_0,esk1_0))))|equivalence_2)),inference(skolemize,[status(esa)],[49])).
% fof(51, plain,![X3]:![X4]:((is_a_theorem(implies(equiv(X3,X4),implies(X4,X3)))|~(equivalence_2))&(~(is_a_theorem(implies(equiv(esk1_0,esk2_0),implies(esk2_0,esk1_0))))|equivalence_2)),inference(shift_quantors,[status(thm)],[50])).
% cnf(52,plain,(equivalence_2|~is_a_theorem(implies(equiv(esk1_0,esk2_0),implies(esk2_0,esk1_0)))),inference(split_conjunct,[status(thm)],[51])).
% cnf(54,plain,(op_equiv),inference(split_conjunct,[status(thm)],[2])).
% 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(75,plain,(op_implies_or),inference(split_conjunct,[status(thm)],[13])).
% cnf(76,plain,(op_and),inference(split_conjunct,[status(thm)],[14])).
% cnf(77,plain,(op_or),inference(split_conjunct,[status(thm)],[15])).
% cnf(78,plain,(op_implies_and),inference(split_conjunct,[status(thm)],[16])).
% fof(79, 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)],[17])).
% fof(80, 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)],[79])).
% fof(81, plain,((~(modus_ponens)|![X3]:![X4]:((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4)))&(((is_a_theorem(esk7_0)&is_a_theorem(implies(esk7_0,esk8_0)))&~(is_a_theorem(esk8_0)))|modus_ponens)),inference(skolemize,[status(esa)],[80])).
% fof(82, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4))|~(modus_ponens))&(((is_a_theorem(esk7_0)&is_a_theorem(implies(esk7_0,esk8_0)))&~(is_a_theorem(esk8_0)))|modus_ponens)),inference(shift_quantors,[status(thm)],[81])).
% fof(83, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4))|~(modus_ponens))&(((is_a_theorem(esk7_0)|modus_ponens)&(is_a_theorem(implies(esk7_0,esk8_0))|modus_ponens))&(~(is_a_theorem(esk8_0))|modus_ponens))),inference(distribute,[status(thm)],[82])).
% cnf(87,plain,(is_a_theorem(X1)|~modus_ponens|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2)),inference(split_conjunct,[status(thm)],[83])).
% fof(120, plain,(~(op_implies_and)|![X1]:![X2]:implies(X1,X2)=not(and(X1,not(X2)))),inference(fof_nnf,[status(thm)],[23])).
% fof(121, plain,(~(op_implies_and)|![X3]:![X4]:implies(X3,X4)=not(and(X3,not(X4)))),inference(variable_rename,[status(thm)],[120])).
% fof(122, plain,![X3]:![X4]:(implies(X3,X4)=not(and(X3,not(X4)))|~(op_implies_and)),inference(shift_quantors,[status(thm)],[121])).
% cnf(123,plain,(implies(X1,X2)=not(and(X1,not(X2)))|~op_implies_and),inference(split_conjunct,[status(thm)],[122])).
% fof(130, plain,((~(r2)|![X4]:![X5]:is_a_theorem(implies(X5,or(X4,X5))))&(?[X4]:?[X5]:~(is_a_theorem(implies(X5,or(X4,X5))))|r2)),inference(fof_nnf,[status(thm)],[25])).
% fof(131, plain,((~(r2)|![X6]:![X7]:is_a_theorem(implies(X7,or(X6,X7))))&(?[X8]:?[X9]:~(is_a_theorem(implies(X9,or(X8,X9))))|r2)),inference(variable_rename,[status(thm)],[130])).
% fof(132, plain,((~(r2)|![X6]:![X7]:is_a_theorem(implies(X7,or(X6,X7))))&(~(is_a_theorem(implies(esk23_0,or(esk22_0,esk23_0))))|r2)),inference(skolemize,[status(esa)],[131])).
% fof(133, plain,![X6]:![X7]:((is_a_theorem(implies(X7,or(X6,X7)))|~(r2))&(~(is_a_theorem(implies(esk23_0,or(esk22_0,esk23_0))))|r2)),inference(shift_quantors,[status(thm)],[132])).
% cnf(135,plain,(is_a_theorem(implies(X1,or(X2,X1)))|~r2),inference(split_conjunct,[status(thm)],[133])).
% fof(136, plain,((~(r3)|![X4]:![X5]:is_a_theorem(implies(or(X4,X5),or(X5,X4))))&(?[X4]:?[X5]:~(is_a_theorem(implies(or(X4,X5),or(X5,X4))))|r3)),inference(fof_nnf,[status(thm)],[26])).
% fof(137, plain,((~(r3)|![X6]:![X7]:is_a_theorem(implies(or(X6,X7),or(X7,X6))))&(?[X8]:?[X9]:~(is_a_theorem(implies(or(X8,X9),or(X9,X8))))|r3)),inference(variable_rename,[status(thm)],[136])).
% fof(138, plain,((~(r3)|![X6]:![X7]:is_a_theorem(implies(or(X6,X7),or(X7,X6))))&(~(is_a_theorem(implies(or(esk24_0,esk25_0),or(esk25_0,esk24_0))))|r3)),inference(skolemize,[status(esa)],[137])).
% fof(139, plain,![X6]:![X7]:((is_a_theorem(implies(or(X6,X7),or(X7,X6)))|~(r3))&(~(is_a_theorem(implies(or(esk24_0,esk25_0),or(esk25_0,esk24_0))))|r3)),inference(shift_quantors,[status(thm)],[138])).
% cnf(141,plain,(is_a_theorem(implies(or(X1,X2),or(X2,X1)))|~r3),inference(split_conjunct,[status(thm)],[139])).
% fof(154, plain,(~(op_equiv)|![X1]:![X2]:equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))),inference(fof_nnf,[status(thm)],[29])).
% fof(155, plain,(~(op_equiv)|![X3]:![X4]:equiv(X3,X4)=and(implies(X3,X4),implies(X4,X3))),inference(variable_rename,[status(thm)],[154])).
% fof(156, plain,![X3]:![X4]:(equiv(X3,X4)=and(implies(X3,X4),implies(X4,X3))|~(op_equiv)),inference(shift_quantors,[status(thm)],[155])).
% cnf(157,plain,(equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))|~op_equiv),inference(split_conjunct,[status(thm)],[156])).
% fof(224, plain,(~(op_or)|![X1]:![X2]:or(X1,X2)=not(and(not(X1),not(X2)))),inference(fof_nnf,[status(thm)],[41])).
% fof(225, plain,(~(op_or)|![X3]:![X4]:or(X3,X4)=not(and(not(X3),not(X4)))),inference(variable_rename,[status(thm)],[224])).
% fof(226, plain,![X3]:![X4]:(or(X3,X4)=not(and(not(X3),not(X4)))|~(op_or)),inference(shift_quantors,[status(thm)],[225])).
% cnf(227,plain,(or(X1,X2)=not(and(not(X1),not(X2)))|~op_or),inference(split_conjunct,[status(thm)],[226])).
% fof(228, plain,(~(op_and)|![X1]:![X2]:and(X1,X2)=not(or(not(X1),not(X2)))),inference(fof_nnf,[status(thm)],[42])).
% fof(229, plain,(~(op_and)|![X3]:![X4]:and(X3,X4)=not(or(not(X3),not(X4)))),inference(variable_rename,[status(thm)],[228])).
% fof(230, plain,![X3]:![X4]:(and(X3,X4)=not(or(not(X3),not(X4)))|~(op_and)),inference(shift_quantors,[status(thm)],[229])).
% cnf(231,plain,(and(X1,X2)=not(or(not(X1),not(X2)))|~op_and),inference(split_conjunct,[status(thm)],[230])).
% 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,(~equivalence_2),inference(split_conjunct,[status(thm)],[47])).
% cnf(253,plain,(~is_a_theorem(implies(equiv(esk1_0,esk2_0),implies(esk2_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,75,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)],[135,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)],[123,78,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)],[87,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)],[141,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)],[227,264,theory(equality)])).
% cnf(280,plain,(implies(not(X1),X2)=or(X1,X2)|$false),inference(rw,[status(thm)],[279,77,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)],[231,255,theory(equality)])).
% cnf(294,plain,(not(implies(X1,not(X2)))=and(X1,X2)|$false),inference(rw,[status(thm)],[293,76,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(303,plain,(and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2)|$false),inference(rw,[status(thm)],[157,54,theory(equality)])).
% cnf(304,plain,(and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2)),inference(cn,[status(thm)],[303,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(881,plain,(is_a_theorem(implies(equiv(X1,X2),implies(X2,X1)))),inference(spm,[status(thm)],[857,304,theory(equality)])).
% cnf(82548,plain,($false),inference(rw,[status(thm)],[253,881,theory(equality)])).
% cnf(82549,plain,($false),inference(cn,[status(thm)],[82548,theory(equality)])).
% cnf(82550,plain,($false),82549,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2310
% # ...of these trivial : 434
% # ...subsumed : 225
% # ...remaining for further processing: 1651
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 15
% # Backward-rewritten : 125
% # Generated clauses : 50585
% # ...of the previous two non-trivial : 28856
% # Contextual simplify-reflections : 1
% # Paramodulations : 50585
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 1511
% # Positive orientable unit clauses: 1307
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 201
% # Current number of unprocessed clauses: 24187
% # ...number of literals in the above : 26675
% # Clause-clause subsumption calls (NU) : 2973
% # Rec. Clause-clause subsumption calls : 2973
% # Unit Clause-clause subsumption calls : 1128
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 63945
% # Indexed BW rewrite successes : 107
% # Backwards rewriting index: 720 leaves, 5.39+/-12.931 terms/leaf
% # Paramod-from index: 111 leaves, 11.83+/-25.103 terms/leaf
% # Paramod-into index: 709 leaves, 5.35+/-12.795 terms/leaf
% # -------------------------------------------------
% # User time : 1.605 s
% # System time : 0.059 s
% # Total time : 1.664 s
% # Maximum resident set size: 0 pages
% PrfWatch: 2.71 CPU 2.82 WC
% FINAL PrfWatch: 2.71 CPU 2.82 WC
% SZS output end Solution for /tmp/SystemOnTPTP13132/LCL494+1.tptp
%
%------------------------------------------------------------------------------