%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL484+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:01 EST 2010
% Result : Theorem 1.13s
% Output : Solution 1.13s
% 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/SystemOnTPTP15951/LCL484+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15951/LCL484+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15951/LCL484+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 16050
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,(implies_1<=>![X1]:![X2]:is_a_theorem(implies(X1,implies(X2,X1)))),file('/tmp/SRASS.s.p', implies_1)).
% fof(4, axiom,r2,file('/tmp/SRASS.s.p', principia_r2)).
% fof(8, axiom,op_implies_or,file('/tmp/SRASS.s.p', principia_op_implies_or)).
% fof(20, axiom,(r2<=>![X4]:![X5]:is_a_theorem(implies(X5,or(X4,X5)))),file('/tmp/SRASS.s.p', r2)).
% fof(42, axiom,(op_implies_or=>![X1]:![X2]:implies(X1,X2)=or(not(X1),X2)),file('/tmp/SRASS.s.p', op_implies_or)).
% fof(45, conjecture,implies_1,file('/tmp/SRASS.s.p', hilbert_implies_1)).
% fof(46, negated_conjecture,~(implies_1),inference(assume_negation,[status(cth)],[45])).
% fof(47, negated_conjecture,~(implies_1),inference(fof_simplification,[status(thm)],[46,theory(equality)])).
% fof(48, plain,((~(implies_1)|![X1]:![X2]:is_a_theorem(implies(X1,implies(X2,X1))))&(?[X1]:?[X2]:~(is_a_theorem(implies(X1,implies(X2,X1))))|implies_1)),inference(fof_nnf,[status(thm)],[1])).
% fof(49, plain,((~(implies_1)|![X3]:![X4]:is_a_theorem(implies(X3,implies(X4,X3))))&(?[X5]:?[X6]:~(is_a_theorem(implies(X5,implies(X6,X5))))|implies_1)),inference(variable_rename,[status(thm)],[48])).
% fof(50, plain,((~(implies_1)|![X3]:![X4]:is_a_theorem(implies(X3,implies(X4,X3))))&(~(is_a_theorem(implies(esk1_0,implies(esk2_0,esk1_0))))|implies_1)),inference(skolemize,[status(esa)],[49])).
% fof(51, plain,![X3]:![X4]:((is_a_theorem(implies(X3,implies(X4,X3)))|~(implies_1))&(~(is_a_theorem(implies(esk1_0,implies(esk2_0,esk1_0))))|implies_1)),inference(shift_quantors,[status(thm)],[50])).
% cnf(52,plain,(implies_1|~is_a_theorem(implies(esk1_0,implies(esk2_0,esk1_0)))),inference(split_conjunct,[status(thm)],[51])).
% cnf(56,plain,(r2),inference(split_conjunct,[status(thm)],[4])).
% cnf(60,plain,(op_implies_or),inference(split_conjunct,[status(thm)],[8])).
% fof(100, 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)],[20])).
% fof(101, 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)],[100])).
% fof(102, plain,((~(r2)|![X6]:![X7]:is_a_theorem(implies(X7,or(X6,X7))))&(~(is_a_theorem(implies(esk15_0,or(esk14_0,esk15_0))))|r2)),inference(skolemize,[status(esa)],[101])).
% fof(103, plain,![X6]:![X7]:((is_a_theorem(implies(X7,or(X6,X7)))|~(r2))&(~(is_a_theorem(implies(esk15_0,or(esk14_0,esk15_0))))|r2)),inference(shift_quantors,[status(thm)],[102])).
% cnf(105,plain,(is_a_theorem(implies(X1,or(X2,X1)))|~r2),inference(split_conjunct,[status(thm)],[103])).
% fof(230, plain,(~(op_implies_or)|![X1]:![X2]:implies(X1,X2)=or(not(X1),X2)),inference(fof_nnf,[status(thm)],[42])).
% fof(231, plain,(~(op_implies_or)|![X3]:![X4]:implies(X3,X4)=or(not(X3),X4)),inference(variable_rename,[status(thm)],[230])).
% fof(232, plain,![X3]:![X4]:(implies(X3,X4)=or(not(X3),X4)|~(op_implies_or)),inference(shift_quantors,[status(thm)],[231])).
% cnf(233,plain,(implies(X1,X2)=or(not(X1),X2)|~op_implies_or),inference(split_conjunct,[status(thm)],[232])).
% cnf(242,negated_conjecture,(~implies_1),inference(split_conjunct,[status(thm)],[47])).
% cnf(247,plain,(~is_a_theorem(implies(esk1_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)],[233,60,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)],[105,56,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(331,plain,($false),inference(rw,[status(thm)],[247,259,theory(equality)])).
% cnf(332,plain,($false),inference(cn,[status(thm)],[331,theory(equality)])).
% cnf(333,plain,($false),332,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 77
% # ...of these trivial : 12
% # ...subsumed : 1
% # ...remaining for further processing: 64
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 7
% # Generated clauses : 32
% # ...of the previous two non-trivial : 34
% # Contextual simplify-reflections : 0
% # Paramodulations : 32
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 57
% # Positive orientable unit clauses: 25
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 31
% # Current number of unprocessed clauses: 31
% # ...number of literals in the above : 41
% # Clause-clause subsumption calls (NU) : 56
% # Rec. Clause-clause subsumption calls : 56
% # Unit Clause-clause subsumption calls : 42
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 34
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 164 leaves, 1.25+/-0.978 terms/leaf
% # Paramod-from index: 24 leaves, 1.04+/-0.200 terms/leaf
% # Paramod-into index: 143 leaves, 1.12+/-0.674 terms/leaf
% # -------------------------------------------------
% # User time : 0.020 s
% # System time : 0.004 s
% # Total time : 0.024 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.22 WC
% FINAL PrfWatch: 0.12 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP15951/LCL484+1.tptp
%
%------------------------------------------------------------------------------