TSTP Solution File: LCL459+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LCL459+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 : art03.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:25:33 EST 2010
% Result : Theorem 0.98s
% Output : Solution 0.98s
% 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/SystemOnTPTP4583/LCL459+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP4583/LCL459+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4583/LCL459+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 4679
% 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,(kn1<=>![X1]:is_a_theorem(implies(X1,and(X1,X1)))),file('/tmp/SRASS.s.p', kn1)).
% fof(4, axiom,modus_ponens,file('/tmp/SRASS.s.p', hilbert_modus_ponens)).
% fof(7, axiom,implies_2,file('/tmp/SRASS.s.p', hilbert_implies_2)).
% fof(11, axiom,and_3,file('/tmp/SRASS.s.p', hilbert_and_3)).
% fof(22, axiom,(and_3<=>![X2]:![X3]:is_a_theorem(implies(X2,implies(X3,and(X2,X3))))),file('/tmp/SRASS.s.p', and_3)).
% fof(24, axiom,(modus_ponens<=>![X2]:![X3]:((is_a_theorem(X2)&is_a_theorem(implies(X2,X3)))=>is_a_theorem(X3))),file('/tmp/SRASS.s.p', modus_ponens)).
% fof(26, axiom,(implies_2<=>![X2]:![X3]:is_a_theorem(implies(implies(X2,implies(X2,X3)),implies(X2,X3)))),file('/tmp/SRASS.s.p', implies_2)).
% fof(53, conjecture,kn1,file('/tmp/SRASS.s.p', rosser_kn1)).
% fof(54, negated_conjecture,~(kn1),inference(assume_negation,[status(cth)],[53])).
% fof(55, negated_conjecture,~(kn1),inference(fof_simplification,[status(thm)],[54,theory(equality)])).
% fof(56, plain,((~(kn1)|![X1]:is_a_theorem(implies(X1,and(X1,X1))))&(?[X1]:~(is_a_theorem(implies(X1,and(X1,X1))))|kn1)),inference(fof_nnf,[status(thm)],[1])).
% fof(57, plain,((~(kn1)|![X2]:is_a_theorem(implies(X2,and(X2,X2))))&(?[X3]:~(is_a_theorem(implies(X3,and(X3,X3))))|kn1)),inference(variable_rename,[status(thm)],[56])).
% fof(58, plain,((~(kn1)|![X2]:is_a_theorem(implies(X2,and(X2,X2))))&(~(is_a_theorem(implies(esk1_0,and(esk1_0,esk1_0))))|kn1)),inference(skolemize,[status(esa)],[57])).
% fof(59, plain,![X2]:((is_a_theorem(implies(X2,and(X2,X2)))|~(kn1))&(~(is_a_theorem(implies(esk1_0,and(esk1_0,esk1_0))))|kn1)),inference(shift_quantors,[status(thm)],[58])).
% cnf(60,plain,(kn1|~is_a_theorem(implies(esk1_0,and(esk1_0,esk1_0)))),inference(split_conjunct,[status(thm)],[59])).
% cnf(64,plain,(modus_ponens),inference(split_conjunct,[status(thm)],[4])).
% cnf(67,plain,(implies_2),inference(split_conjunct,[status(thm)],[7])).
% cnf(71,plain,(and_3),inference(split_conjunct,[status(thm)],[11])).
% fof(92, plain,((~(and_3)|![X2]:![X3]:is_a_theorem(implies(X2,implies(X3,and(X2,X3)))))&(?[X2]:?[X3]:~(is_a_theorem(implies(X2,implies(X3,and(X2,X3)))))|and_3)),inference(fof_nnf,[status(thm)],[22])).
% fof(93, plain,((~(and_3)|![X4]:![X5]:is_a_theorem(implies(X4,implies(X5,and(X4,X5)))))&(?[X6]:?[X7]:~(is_a_theorem(implies(X6,implies(X7,and(X6,X7)))))|and_3)),inference(variable_rename,[status(thm)],[92])).
% fof(94, plain,((~(and_3)|![X4]:![X5]:is_a_theorem(implies(X4,implies(X5,and(X4,X5)))))&(~(is_a_theorem(implies(esk6_0,implies(esk7_0,and(esk6_0,esk7_0)))))|and_3)),inference(skolemize,[status(esa)],[93])).
% fof(95, plain,![X4]:![X5]:((is_a_theorem(implies(X4,implies(X5,and(X4,X5))))|~(and_3))&(~(is_a_theorem(implies(esk6_0,implies(esk7_0,and(esk6_0,esk7_0)))))|and_3)),inference(shift_quantors,[status(thm)],[94])).
% cnf(97,plain,(is_a_theorem(implies(X1,implies(X2,and(X1,X2))))|~and_3),inference(split_conjunct,[status(thm)],[95])).
% fof(104, plain,((~(modus_ponens)|![X2]:![X3]:((~(is_a_theorem(X2))|~(is_a_theorem(implies(X2,X3))))|is_a_theorem(X3)))&(?[X2]:?[X3]:((is_a_theorem(X2)&is_a_theorem(implies(X2,X3)))&~(is_a_theorem(X3)))|modus_ponens)),inference(fof_nnf,[status(thm)],[24])).
% fof(105, plain,((~(modus_ponens)|![X4]:![X5]:((~(is_a_theorem(X4))|~(is_a_theorem(implies(X4,X5))))|is_a_theorem(X5)))&(?[X6]:?[X7]:((is_a_theorem(X6)&is_a_theorem(implies(X6,X7)))&~(is_a_theorem(X7)))|modus_ponens)),inference(variable_rename,[status(thm)],[104])).
% fof(106, plain,((~(modus_ponens)|![X4]:![X5]:((~(is_a_theorem(X4))|~(is_a_theorem(implies(X4,X5))))|is_a_theorem(X5)))&(((is_a_theorem(esk10_0)&is_a_theorem(implies(esk10_0,esk11_0)))&~(is_a_theorem(esk11_0)))|modus_ponens)),inference(skolemize,[status(esa)],[105])).
% fof(107, plain,![X4]:![X5]:((((~(is_a_theorem(X4))|~(is_a_theorem(implies(X4,X5))))|is_a_theorem(X5))|~(modus_ponens))&(((is_a_theorem(esk10_0)&is_a_theorem(implies(esk10_0,esk11_0)))&~(is_a_theorem(esk11_0)))|modus_ponens)),inference(shift_quantors,[status(thm)],[106])).
% fof(108, plain,![X4]:![X5]:((((~(is_a_theorem(X4))|~(is_a_theorem(implies(X4,X5))))|is_a_theorem(X5))|~(modus_ponens))&(((is_a_theorem(esk10_0)|modus_ponens)&(is_a_theorem(implies(esk10_0,esk11_0))|modus_ponens))&(~(is_a_theorem(esk11_0))|modus_ponens))),inference(distribute,[status(thm)],[107])).
% cnf(112,plain,(is_a_theorem(X1)|~modus_ponens|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2)),inference(split_conjunct,[status(thm)],[108])).
% fof(119, plain,((~(implies_2)|![X2]:![X3]:is_a_theorem(implies(implies(X2,implies(X2,X3)),implies(X2,X3))))&(?[X2]:?[X3]:~(is_a_theorem(implies(implies(X2,implies(X2,X3)),implies(X2,X3))))|implies_2)),inference(fof_nnf,[status(thm)],[26])).
% fof(120, plain,((~(implies_2)|![X4]:![X5]:is_a_theorem(implies(implies(X4,implies(X4,X5)),implies(X4,X5))))&(?[X6]:?[X7]:~(is_a_theorem(implies(implies(X6,implies(X6,X7)),implies(X6,X7))))|implies_2)),inference(variable_rename,[status(thm)],[119])).
% fof(121, plain,((~(implies_2)|![X4]:![X5]:is_a_theorem(implies(implies(X4,implies(X4,X5)),implies(X4,X5))))&(~(is_a_theorem(implies(implies(esk14_0,implies(esk14_0,esk15_0)),implies(esk14_0,esk15_0))))|implies_2)),inference(skolemize,[status(esa)],[120])).
% fof(122, plain,![X4]:![X5]:((is_a_theorem(implies(implies(X4,implies(X4,X5)),implies(X4,X5)))|~(implies_2))&(~(is_a_theorem(implies(implies(esk14_0,implies(esk14_0,esk15_0)),implies(esk14_0,esk15_0))))|implies_2)),inference(shift_quantors,[status(thm)],[121])).
% cnf(124,plain,(is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))|~implies_2),inference(split_conjunct,[status(thm)],[122])).
% cnf(258,negated_conjecture,(~kn1),inference(split_conjunct,[status(thm)],[55])).
% cnf(265,plain,(~is_a_theorem(implies(esk1_0,and(esk1_0,esk1_0)))),inference(sr,[status(thm)],[60,258,theory(equality)])).
% cnf(294,plain,(is_a_theorem(X1)|$false|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(rw,[status(thm)],[112,64,theory(equality)])).
% cnf(295,plain,(is_a_theorem(X1)|~is_a_theorem(X2)|~is_a_theorem(implies(X2,X1))),inference(cn,[status(thm)],[294,theory(equality)])).
% cnf(312,plain,(is_a_theorem(implies(X1,implies(X2,and(X1,X2))))|$false),inference(rw,[status(thm)],[97,71,theory(equality)])).
% cnf(313,plain,(is_a_theorem(implies(X1,implies(X2,and(X1,X2))))),inference(cn,[status(thm)],[312,theory(equality)])).
% cnf(353,plain,(is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))|$false),inference(rw,[status(thm)],[124,67,theory(equality)])).
% cnf(354,plain,(is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))),inference(cn,[status(thm)],[353,theory(equality)])).
% cnf(355,plain,(is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(X1,implies(X1,X2)))),inference(spm,[status(thm)],[295,354,theory(equality)])).
% cnf(433,plain,(is_a_theorem(implies(X1,and(X1,X1)))),inference(spm,[status(thm)],[355,313,theory(equality)])).
% cnf(442,plain,($false),inference(rw,[status(thm)],[265,433,theory(equality)])).
% cnf(443,plain,($false),inference(cn,[status(thm)],[442,theory(equality)])).
% cnf(444,plain,($false),443,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 125
% # ...of these trivial : 24
% # ...subsumed : 6
% # ...remaining for further processing: 95
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 8
% # Generated clauses : 95
% # ...of the previous two non-trivial : 89
% # Contextual simplify-reflections : 0
% # Paramodulations : 95
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 87
% # Positive orientable unit clauses: 41
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 43
% # Current number of unprocessed clauses: 46
% # ...number of literals in the above : 64
% # Clause-clause subsumption calls (NU) : 238
% # Rec. Clause-clause subsumption calls : 238
% # Unit Clause-clause subsumption calls : 80
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 63
% # Indexed BW rewrite successes : 8
% # Backwards rewriting index: 141 leaves, 1.38+/-0.979 terms/leaf
% # Paramod-from index: 36 leaves, 1.25+/-0.595 terms/leaf
% # Paramod-into index: 127 leaves, 1.28+/-0.741 terms/leaf
% # -------------------------------------------------
% # User time : 0.025 s
% # System time : 0.002 s
% # Total time : 0.027 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/SystemOnTPTP4583/LCL459+1.tptp
%
%------------------------------------------------------------------------------