%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL483+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 : art09.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:38:52 EST 2010
% Result : Theorem 0.96s
% Output : Solution 0.96s
% 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/SystemOnTPTP11214/LCL483+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP11214/LCL483+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11214/LCL483+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 11310
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,(modus_tollens<=>![X1]:![X2]:is_a_theorem(implies(implies(not(X2),not(X1)),implies(X1,X2)))),file('/tmp/SRASS.s.p', modus_tollens)).
% fof(2, axiom,op_implies_or,file('/tmp/SRASS.s.p', principia_op_implies_or)).
% 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_or,file('/tmp/SRASS.s.p', hilbert_op_or)).
% fof(25, axiom,(r3<=>![X3]:![X4]:is_a_theorem(implies(or(X3,X4),or(X4,X3)))),file('/tmp/SRASS.s.p', r3)).
% fof(28, axiom,(op_implies_and=>![X1]:![X2]:implies(X1,X2)=not(and(X1,not(X2)))),file('/tmp/SRASS.s.p', op_implies_and)).
% fof(29, axiom,(op_implies_or=>![X1]:![X2]:implies(X1,X2)=or(not(X1),X2)),file('/tmp/SRASS.s.p', op_implies_or)).
% fof(42, axiom,(op_or=>![X1]:![X2]:or(X1,X2)=not(and(not(X1),not(X2)))),file('/tmp/SRASS.s.p', op_or)).
% fof(45, conjecture,modus_tollens,file('/tmp/SRASS.s.p', hilbert_modus_tollens)).
% fof(46, negated_conjecture,~(modus_tollens),inference(assume_negation,[status(cth)],[45])).
% fof(47, negated_conjecture,~(modus_tollens),inference(fof_simplification,[status(thm)],[46,theory(equality)])).
% fof(48, plain,((~(modus_tollens)|![X1]:![X2]:is_a_theorem(implies(implies(not(X2),not(X1)),implies(X1,X2))))&(?[X1]:?[X2]:~(is_a_theorem(implies(implies(not(X2),not(X1)),implies(X1,X2))))|modus_tollens)),inference(fof_nnf,[status(thm)],[1])).
% fof(49, plain,((~(modus_tollens)|![X3]:![X4]:is_a_theorem(implies(implies(not(X4),not(X3)),implies(X3,X4))))&(?[X5]:?[X6]:~(is_a_theorem(implies(implies(not(X6),not(X5)),implies(X5,X6))))|modus_tollens)),inference(variable_rename,[status(thm)],[48])).
% fof(50, plain,((~(modus_tollens)|![X3]:![X4]:is_a_theorem(implies(implies(not(X4),not(X3)),implies(X3,X4))))&(~(is_a_theorem(implies(implies(not(esk2_0),not(esk1_0)),implies(esk1_0,esk2_0))))|modus_tollens)),inference(skolemize,[status(esa)],[49])).
% fof(51, plain,![X3]:![X4]:((is_a_theorem(implies(implies(not(X4),not(X3)),implies(X3,X4)))|~(modus_tollens))&(~(is_a_theorem(implies(implies(not(esk2_0),not(esk1_0)),implies(esk1_0,esk2_0))))|modus_tollens)),inference(shift_quantors,[status(thm)],[50])).
% cnf(52,plain,(modus_tollens|~is_a_theorem(implies(implies(not(esk2_0),not(esk1_0)),implies(esk1_0,esk2_0)))),inference(split_conjunct,[status(thm)],[51])).
% cnf(54,plain,(op_implies_or),inference(split_conjunct,[status(thm)],[2])).
% cnf(58,plain,(r3),inference(split_conjunct,[status(thm)],[6])).
% cnf(61,plain,(op_implies_and),inference(split_conjunct,[status(thm)],[9])).
% cnf(77,plain,(op_or),inference(split_conjunct,[status(thm)],[15])).
% fof(130, 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)],[25])).
% fof(131, 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)],[130])).
% fof(132, plain,((~(r3)|![X5]:![X6]:is_a_theorem(implies(or(X5,X6),or(X6,X5))))&(~(is_a_theorem(implies(or(esk24_0,esk25_0),or(esk25_0,esk24_0))))|r3)),inference(skolemize,[status(esa)],[131])).
% fof(133, plain,![X5]:![X6]:((is_a_theorem(implies(or(X5,X6),or(X6,X5)))|~(r3))&(~(is_a_theorem(implies(or(esk24_0,esk25_0),or(esk25_0,esk24_0))))|r3)),inference(shift_quantors,[status(thm)],[132])).
% cnf(135,plain,(is_a_theorem(implies(or(X1,X2),or(X2,X1)))|~r3),inference(split_conjunct,[status(thm)],[133])).
% fof(148, plain,(~(op_implies_and)|![X1]:![X2]:implies(X1,X2)=not(and(X1,not(X2)))),inference(fof_nnf,[status(thm)],[28])).
% fof(149, plain,(~(op_implies_and)|![X3]:![X4]:implies(X3,X4)=not(and(X3,not(X4)))),inference(variable_rename,[status(thm)],[148])).
% fof(150, plain,![X3]:![X4]:(implies(X3,X4)=not(and(X3,not(X4)))|~(op_implies_and)),inference(shift_quantors,[status(thm)],[149])).
% cnf(151,plain,(implies(X1,X2)=not(and(X1,not(X2)))|~op_implies_and),inference(split_conjunct,[status(thm)],[150])).
% fof(152, plain,(~(op_implies_or)|![X1]:![X2]:implies(X1,X2)=or(not(X1),X2)),inference(fof_nnf,[status(thm)],[29])).
% fof(153, plain,(~(op_implies_or)|![X3]:![X4]:implies(X3,X4)=or(not(X3),X4)),inference(variable_rename,[status(thm)],[152])).
% fof(154, plain,![X3]:![X4]:(implies(X3,X4)=or(not(X3),X4)|~(op_implies_or)),inference(shift_quantors,[status(thm)],[153])).
% cnf(155,plain,(implies(X1,X2)=or(not(X1),X2)|~op_implies_or),inference(split_conjunct,[status(thm)],[154])).
% 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])).
% cnf(242,negated_conjecture,(~modus_tollens),inference(split_conjunct,[status(thm)],[47])).
% cnf(254,plain,(or(not(X1),X2)=implies(X1,X2)|$false),inference(rw,[status(thm)],[155,54,theory(equality)])).
% cnf(255,plain,(or(not(X1),X2)=implies(X1,X2)),inference(cn,[status(thm)],[254,theory(equality)])).
% cnf(262,plain,(not(and(X1,not(X2)))=implies(X1,X2)|$false),inference(rw,[status(thm)],[151,61,theory(equality)])).
% cnf(263,plain,(not(and(X1,not(X2)))=implies(X1,X2)),inference(cn,[status(thm)],[262,theory(equality)])).
% cnf(269,plain,(~is_a_theorem(implies(implies(not(esk2_0),not(esk1_0)),implies(esk1_0,esk2_0)))),inference(sr,[status(thm)],[52,242,theory(equality)])).
% cnf(274,plain,(is_a_theorem(implies(or(X1,X2),or(X2,X1)))|$false),inference(rw,[status(thm)],[135,58,theory(equality)])).
% cnf(275,plain,(is_a_theorem(implies(or(X1,X2),or(X2,X1)))),inference(cn,[status(thm)],[274,theory(equality)])).
% cnf(277,plain,(is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1)))),inference(spm,[status(thm)],[275,255,theory(equality)])).
% cnf(279,plain,(implies(not(X1),X2)=or(X1,X2)|~op_or),inference(rw,[status(thm)],[233,263,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(287,plain,(~is_a_theorem(implies(or(esk2_0,not(esk1_0)),implies(esk1_0,esk2_0)))),inference(rw,[status(thm)],[269,281,theory(equality)])).
% cnf(446,plain,($false),inference(rw,[status(thm)],[287,277,theory(equality)])).
% cnf(447,plain,($false),inference(cn,[status(thm)],[446,theory(equality)])).
% cnf(448,plain,($false),447,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 132
% # ...of these trivial : 12
% # ...subsumed : 7
% # ...remaining for further processing: 113
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 9
% # Generated clauses : 132
% # ...of the previous two non-trivial : 120
% # Contextual simplify-reflections : 0
% # Paramodulations : 132
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 104
% # Positive orientable unit clauses: 30
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 71
% # Current number of unprocessed clauses: 62
% # ...number of literals in the above : 89
% # Clause-clause subsumption calls (NU) : 734
% # Rec. Clause-clause subsumption calls : 734
% # Unit Clause-clause subsumption calls : 157
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 35
% # Indexed BW rewrite successes : 9
% # Backwards rewriting index: 216 leaves, 1.23+/-0.978 terms/leaf
% # Paramod-from index: 32 leaves, 1.03+/-0.174 terms/leaf
% # Paramod-into index: 196 leaves, 1.13+/-0.706 terms/leaf
% # -------------------------------------------------
% # User time : 0.024 s
% # System time : 0.005 s
% # Total time : 0.029 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.20 WC
% FINAL PrfWatch: 0.12 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP11214/LCL483+1.tptp
%
%------------------------------------------------------------------------------