%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL540+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 : art05.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:52:48 EST 2010
% Result : Theorem 1.16s
% Output : Solution 1.16s
% 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/SystemOnTPTP7993/LCL540+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7993/LCL540+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7993/LCL540+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 8089
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.022 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,(adjunction<=>![X1]:![X2]:((is_a_theorem(X1)&is_a_theorem(X2))=>is_a_theorem(and(X1,X2)))),file('/tmp/SRASS.s.p', adjunction)).
% fof(4, axiom,and_3,file('/tmp/SRASS.s.p', hilbert_and_3)).
% fof(8, axiom,modus_ponens,file('/tmp/SRASS.s.p', hilbert_modus_ponens)).
% fof(30, axiom,(and_3<=>![X1]:![X2]:is_a_theorem(implies(X1,implies(X2,and(X1,X2))))),file('/tmp/SRASS.s.p', and_3)).
% fof(43, 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(89, conjecture,adjunction,file('/tmp/SRASS.s.p', s1_0_adjunction)).
% fof(90, negated_conjecture,~(adjunction),inference(assume_negation,[status(cth)],[89])).
% fof(91, negated_conjecture,~(adjunction),inference(fof_simplification,[status(thm)],[90,theory(equality)])).
% fof(92, plain,((~(adjunction)|![X1]:![X2]:((~(is_a_theorem(X1))|~(is_a_theorem(X2)))|is_a_theorem(and(X1,X2))))&(?[X1]:?[X2]:((is_a_theorem(X1)&is_a_theorem(X2))&~(is_a_theorem(and(X1,X2))))|adjunction)),inference(fof_nnf,[status(thm)],[1])).
% fof(93, plain,((~(adjunction)|![X3]:![X4]:((~(is_a_theorem(X3))|~(is_a_theorem(X4)))|is_a_theorem(and(X3,X4))))&(?[X5]:?[X6]:((is_a_theorem(X5)&is_a_theorem(X6))&~(is_a_theorem(and(X5,X6))))|adjunction)),inference(variable_rename,[status(thm)],[92])).
% fof(94, plain,((~(adjunction)|![X3]:![X4]:((~(is_a_theorem(X3))|~(is_a_theorem(X4)))|is_a_theorem(and(X3,X4))))&(((is_a_theorem(esk1_0)&is_a_theorem(esk2_0))&~(is_a_theorem(and(esk1_0,esk2_0))))|adjunction)),inference(skolemize,[status(esa)],[93])).
% fof(95, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(X4)))|is_a_theorem(and(X3,X4)))|~(adjunction))&(((is_a_theorem(esk1_0)&is_a_theorem(esk2_0))&~(is_a_theorem(and(esk1_0,esk2_0))))|adjunction)),inference(shift_quantors,[status(thm)],[94])).
% fof(96, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(X4)))|is_a_theorem(and(X3,X4)))|~(adjunction))&(((is_a_theorem(esk1_0)|adjunction)&(is_a_theorem(esk2_0)|adjunction))&(~(is_a_theorem(and(esk1_0,esk2_0)))|adjunction))),inference(distribute,[status(thm)],[95])).
% cnf(97,plain,(adjunction|~is_a_theorem(and(esk1_0,esk2_0))),inference(split_conjunct,[status(thm)],[96])).
% cnf(98,plain,(adjunction|is_a_theorem(esk2_0)),inference(split_conjunct,[status(thm)],[96])).
% cnf(99,plain,(adjunction|is_a_theorem(esk1_0)),inference(split_conjunct,[status(thm)],[96])).
% cnf(103,plain,(and_3),inference(split_conjunct,[status(thm)],[4])).
% cnf(107,plain,(modus_ponens),inference(split_conjunct,[status(thm)],[8])).
% fof(139, plain,((~(and_3)|![X1]:![X2]:is_a_theorem(implies(X1,implies(X2,and(X1,X2)))))&(?[X1]:?[X2]:~(is_a_theorem(implies(X1,implies(X2,and(X1,X2)))))|and_3)),inference(fof_nnf,[status(thm)],[30])).
% fof(140, plain,((~(and_3)|![X3]:![X4]:is_a_theorem(implies(X3,implies(X4,and(X3,X4)))))&(?[X5]:?[X6]:~(is_a_theorem(implies(X5,implies(X6,and(X5,X6)))))|and_3)),inference(variable_rename,[status(thm)],[139])).
% fof(141, plain,((~(and_3)|![X3]:![X4]:is_a_theorem(implies(X3,implies(X4,and(X3,X4)))))&(~(is_a_theorem(implies(esk7_0,implies(esk8_0,and(esk7_0,esk8_0)))))|and_3)),inference(skolemize,[status(esa)],[140])).
% fof(142, plain,![X3]:![X4]:((is_a_theorem(implies(X3,implies(X4,and(X3,X4))))|~(and_3))&(~(is_a_theorem(implies(esk7_0,implies(esk8_0,and(esk7_0,esk8_0)))))|and_3)),inference(shift_quantors,[status(thm)],[141])).
% cnf(144,plain,(is_a_theorem(implies(X1,implies(X2,and(X1,X2))))|~and_3),inference(split_conjunct,[status(thm)],[142])).
% fof(207, 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)],[43])).
% fof(208, 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)],[207])).
% fof(209, plain,((~(modus_ponens)|![X3]:![X4]:((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4)))&(((is_a_theorem(esk26_0)&is_a_theorem(implies(esk26_0,esk27_0)))&~(is_a_theorem(esk27_0)))|modus_ponens)),inference(skolemize,[status(esa)],[208])).
% fof(210, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4))|~(modus_ponens))&(((is_a_theorem(esk26_0)&is_a_theorem(implies(esk26_0,esk27_0)))&~(is_a_theorem(esk27_0)))|modus_ponens)),inference(shift_quantors,[status(thm)],[209])).
% fof(211, plain,![X3]:![X4]:((((~(is_a_theorem(X3))|~(is_a_theorem(implies(X3,X4))))|is_a_theorem(X4))|~(modus_ponens))&(((is_a_theorem(esk26_0)|modus_ponens)&(is_a_theorem(implies(esk26_0,esk27_0))|modus_ponens))&(~(is_a_theorem(esk27_0))|modus_ponens))),inference(distribute,[status(thm)],[210])).
% cnf(215,plain,(is_a_theorem(X1)|~modus_ponens|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2)),inference(split_conjunct,[status(thm)],[211])).
% cnf(467,negated_conjecture,(~adjunction),inference(split_conjunct,[status(thm)],[91])).
% cnf(471,plain,(is_a_theorem(esk1_0)),inference(sr,[status(thm)],[99,467,theory(equality)])).
% cnf(473,plain,(is_a_theorem(esk2_0)),inference(sr,[status(thm)],[98,467,theory(equality)])).
% cnf(475,plain,(~is_a_theorem(and(esk1_0,esk2_0))),inference(sr,[status(thm)],[97,467,theory(equality)])).
% cnf(519,plain,(is_a_theorem(X1)|$false|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(rw,[status(thm)],[215,107,theory(equality)])).
% cnf(520,plain,(is_a_theorem(X1)|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(cn,[status(thm)],[519,theory(equality)])).
% cnf(573,plain,(is_a_theorem(implies(X1,implies(X2,and(X1,X2))))|$false),inference(rw,[status(thm)],[144,103,theory(equality)])).
% cnf(574,plain,(is_a_theorem(implies(X1,implies(X2,and(X1,X2))))),inference(cn,[status(thm)],[573,theory(equality)])).
% cnf(575,plain,(is_a_theorem(implies(X1,and(X2,X1)))|~is_a_theorem(X2)),inference(spm,[status(thm)],[520,574,theory(equality)])).
% cnf(1228,plain,(is_a_theorem(and(X1,X2))|~is_a_theorem(X2)|~is_a_theorem(X1)),inference(spm,[status(thm)],[520,575,theory(equality)])).
% cnf(1236,plain,(~is_a_theorem(esk2_0)|~is_a_theorem(esk1_0)),inference(spm,[status(thm)],[475,1228,theory(equality)])).
% cnf(1243,plain,($false|~is_a_theorem(esk1_0)),inference(rw,[status(thm)],[1236,473,theory(equality)])).
% cnf(1244,plain,($false|$false),inference(rw,[status(thm)],[1243,471,theory(equality)])).
% cnf(1245,plain,($false),inference(cn,[status(thm)],[1244,theory(equality)])).
% cnf(1246,plain,($false),1245,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 337
% # ...of these trivial : 36
% # ...subsumed : 46
% # ...remaining for further processing: 255
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 22
% # Generated clauses : 509
% # ...of the previous two non-trivial : 416
% # Contextual simplify-reflections : 2
% # Paramodulations : 509
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 233
% # Positive orientable unit clauses: 104
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 2
% # Non-unit-clauses : 126
% # Current number of unprocessed clauses: 226
% # ...number of literals in the above : 313
% # Clause-clause subsumption calls (NU) : 3451
% # Rec. Clause-clause subsumption calls : 3435
% # Unit Clause-clause subsumption calls : 776
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 183
% # Indexed BW rewrite successes : 19
% # Backwards rewriting index: 410 leaves, 1.27+/-0.774 terms/leaf
% # Paramod-from index: 100 leaves, 1.21+/-0.535 terms/leaf
% # Paramod-into index: 372 leaves, 1.21+/-0.618 terms/leaf
% # -------------------------------------------------
% # User time : 0.046 s
% # System time : 0.005 s
% # Total time : 0.051 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.24 WC
% FINAL PrfWatch: 0.16 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP7993/LCL540+1.tptp
%
%------------------------------------------------------------------------------