%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL527+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:49:22 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/SystemOnTPTP22054/LCL527+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP22054/LCL527+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22054/LCL527+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 22150
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.023 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(29, axiom,(and_3<=>![X1]:![X2]:is_a_theorem(implies(X1,implies(X2,and(X1,X2))))),file('/tmp/SRASS.s.p', and_3)).
% fof(42, 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(88, conjecture,adjunction,file('/tmp/SRASS.s.p', s1_0_adjunction)).
% fof(89, negated_conjecture,~(adjunction),inference(assume_negation,[status(cth)],[88])).
% fof(90, negated_conjecture,~(adjunction),inference(fof_simplification,[status(thm)],[89,theory(equality)])).
% fof(91, 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(92, 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)],[91])).
% fof(93, 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)],[92])).
% fof(94, 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)],[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)|adjunction)&(is_a_theorem(esk2_0)|adjunction))&(~(is_a_theorem(and(esk1_0,esk2_0)))|adjunction))),inference(distribute,[status(thm)],[94])).
% cnf(96,plain,(adjunction|~is_a_theorem(and(esk1_0,esk2_0))),inference(split_conjunct,[status(thm)],[95])).
% cnf(97,plain,(adjunction|is_a_theorem(esk2_0)),inference(split_conjunct,[status(thm)],[95])).
% cnf(98,plain,(adjunction|is_a_theorem(esk1_0)),inference(split_conjunct,[status(thm)],[95])).
% cnf(102,plain,(and_3),inference(split_conjunct,[status(thm)],[4])).
% cnf(106,plain,(modus_ponens),inference(split_conjunct,[status(thm)],[8])).
% fof(137, 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)],[29])).
% fof(138, 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)],[137])).
% fof(139, 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)],[138])).
% fof(140, 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)],[139])).
% cnf(142,plain,(is_a_theorem(implies(X1,implies(X2,and(X1,X2))))|~and_3),inference(split_conjunct,[status(thm)],[140])).
% fof(205, 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)],[42])).
% fof(206, 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)],[205])).
% fof(207, 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)],[206])).
% fof(208, 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)],[207])).
% fof(209, 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)],[208])).
% cnf(213,plain,(is_a_theorem(X1)|~modus_ponens|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2)),inference(split_conjunct,[status(thm)],[209])).
% cnf(465,negated_conjecture,(~adjunction),inference(split_conjunct,[status(thm)],[90])).
% cnf(469,plain,(is_a_theorem(esk1_0)),inference(sr,[status(thm)],[98,465,theory(equality)])).
% cnf(470,plain,(is_a_theorem(esk2_0)),inference(sr,[status(thm)],[97,465,theory(equality)])).
% cnf(473,plain,(~is_a_theorem(and(esk1_0,esk2_0))),inference(sr,[status(thm)],[96,465,theory(equality)])).
% cnf(514,plain,(is_a_theorem(X1)|$false|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(rw,[status(thm)],[213,106,theory(equality)])).
% cnf(515,plain,(is_a_theorem(X1)|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(cn,[status(thm)],[514,theory(equality)])).
% cnf(564,plain,(is_a_theorem(implies(X1,implies(X2,and(X1,X2))))|$false),inference(rw,[status(thm)],[142,102,theory(equality)])).
% cnf(565,plain,(is_a_theorem(implies(X1,implies(X2,and(X1,X2))))),inference(cn,[status(thm)],[564,theory(equality)])).
% cnf(566,plain,(is_a_theorem(implies(X1,and(X2,X1)))|~is_a_theorem(X2)),inference(spm,[status(thm)],[515,565,theory(equality)])).
% cnf(1210,plain,(is_a_theorem(and(X1,X2))|~is_a_theorem(X2)|~is_a_theorem(X1)),inference(spm,[status(thm)],[515,566,theory(equality)])).
% cnf(1218,plain,(~is_a_theorem(esk2_0)|~is_a_theorem(esk1_0)),inference(spm,[status(thm)],[473,1210,theory(equality)])).
% cnf(1225,plain,($false|~is_a_theorem(esk1_0)),inference(rw,[status(thm)],[1218,470,theory(equality)])).
% cnf(1226,plain,($false|$false),inference(rw,[status(thm)],[1225,469,theory(equality)])).
% cnf(1227,plain,($false),inference(cn,[status(thm)],[1226,theory(equality)])).
% cnf(1228,plain,($false),1227,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 320
% # ...of these trivial : 32
% # ...subsumed : 40
% # ...remaining for further processing: 248
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 22
% # Generated clauses : 492
% # ...of the previous two non-trivial : 391
% # Contextual simplify-reflections : 2
% # Paramodulations : 492
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 226
% # Positive orientable unit clauses: 100
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 2
% # Non-unit-clauses : 123
% # Current number of unprocessed clauses: 217
% # ...number of literals in the above : 296
% # Clause-clause subsumption calls (NU) : 3012
% # Rec. Clause-clause subsumption calls : 2993
% # Unit Clause-clause subsumption calls : 779
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 178
% # Indexed BW rewrite successes : 19
% # Backwards rewriting index: 407 leaves, 1.27+/-0.765 terms/leaf
% # Paramod-from index: 92 leaves, 1.25+/-0.564 terms/leaf
% # Paramod-into index: 364 leaves, 1.21+/-0.607 terms/leaf
% # -------------------------------------------------
% # User time : 0.044 s
% # System time : 0.007 s
% # Total time : 0.051 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.24 WC
% FINAL PrfWatch: 0.15 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP22054/LCL527+1.tptp
%
%------------------------------------------------------------------------------