TSTP Solution File: CSR018+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : CSR018+1 : TPTP v5.0.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art04.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 : Tue Dec 28 22:45:44 EST 2010
% Result : Theorem 1.17s
% Output : Solution 1.17s
% 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/SystemOnTPTP22682/CSR018+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP22682/CSR018+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22682/CSR018+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 22778
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.022 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(10, axiom,~(push=pull),file('/tmp/SRASS.s.p', push_not_pull)).
% fof(13, axiom,![X5]:![X1]:![X2]:(initiates(X5,X1,X2)<=>((((X5=push&X1=forwards)&~(happens(pull,X2)))|((X5=pull&X1=backwards)&~(happens(push,X2))))|((X5=pull&X1=spinning)&happens(push,X2)))),file('/tmp/SRASS.s.p', initiates_all_defn)).
% fof(22, axiom,plus(n1,n1)=n2,file('/tmp/SRASS.s.p', plus1_1)).
% fof(26, axiom,![X5]:![X2]:(happens(X5,X2)<=>((((X5=push&X2=n0)|(X5=pull&X2=n1))|(X5=pull&X2=n2))|(X5=push&X2=n2))),file('/tmp/SRASS.s.p', happens_all_defn)).
% fof(28, axiom,![X3]:(less(X3,n2)<=>less_or_equal(X3,n1)),file('/tmp/SRASS.s.p', less2)).
% fof(31, axiom,![X3]:![X4]:(less(X3,X4)<=>(~(less(X4,X3))&~(X4=X3))),file('/tmp/SRASS.s.p', less_property)).
% fof(33, axiom,![X3]:(less(X3,n1)<=>less_or_equal(X3,n0)),file('/tmp/SRASS.s.p', less1)).
% fof(37, axiom,![X5]:![X2]:![X1]:((happens(X5,X2)&initiates(X5,X1,X2))=>holdsAt(X1,plus(X2,n1))),file('/tmp/SRASS.s.p', happens_holds)).
% fof(39, axiom,![X3]:![X4]:(less_or_equal(X3,X4)<=>(less(X3,X4)|X3=X4)),file('/tmp/SRASS.s.p', less_or_equal)).
% fof(48, conjecture,holdsAt(backwards,n2),file('/tmp/SRASS.s.p', backwards_2)).
% fof(49, negated_conjecture,~(holdsAt(backwards,n2)),inference(assume_negation,[status(cth)],[48])).
% fof(54, plain,![X5]:![X1]:![X2]:(initiates(X5,X1,X2)<=>((((X5=push&X1=forwards)&~(happens(pull,X2)))|((X5=pull&X1=backwards)&~(happens(push,X2))))|((X5=pull&X1=spinning)&happens(push,X2)))),inference(fof_simplification,[status(thm)],[13,theory(equality)])).
% fof(63, plain,![X3]:![X4]:(less(X3,X4)<=>(~(less(X4,X3))&~(X4=X3))),inference(fof_simplification,[status(thm)],[31,theory(equality)])).
% fof(65, negated_conjecture,~(holdsAt(backwards,n2)),inference(fof_simplification,[status(thm)],[49,theory(equality)])).
% fof(66, plain,![X1]:![X5]:![X2]:(epred1_3(X2,X5,X1)<=>((((X5=push&X1=forwards)&~(happens(pull,X2)))|((X5=pull&X1=backwards)&~(happens(push,X2))))|((X5=pull&X1=spinning)&happens(push,X2)))),introduced(definition)).
% fof(69, plain,![X5]:![X1]:![X2]:(initiates(X5,X1,X2)<=>epred1_3(X2,X5,X1)),inference(apply_def,[status(esa)],[54,66,theory(equality)])).
% cnf(84,plain,(push!=pull),inference(split_conjunct,[status(thm)],[10])).
% fof(88, plain,![X5]:![X1]:![X2]:((~(initiates(X5,X1,X2))|epred1_3(X2,X5,X1))&(~(epred1_3(X2,X5,X1))|initiates(X5,X1,X2))),inference(fof_nnf,[status(thm)],[69])).
% fof(89, plain,![X6]:![X7]:![X8]:((~(initiates(X6,X7,X8))|epred1_3(X8,X6,X7))&(~(epred1_3(X8,X6,X7))|initiates(X6,X7,X8))),inference(variable_rename,[status(thm)],[88])).
% cnf(90,plain,(initiates(X1,X2,X3)|~epred1_3(X3,X1,X2)),inference(split_conjunct,[status(thm)],[89])).
% cnf(129,plain,(plus(n1,n1)=n2),inference(split_conjunct,[status(thm)],[22])).
% fof(134, plain,![X5]:![X2]:((~(happens(X5,X2))|((((X5=push&X2=n0)|(X5=pull&X2=n1))|(X5=pull&X2=n2))|(X5=push&X2=n2)))&(((((~(X5=push)|~(X2=n0))&(~(X5=pull)|~(X2=n1)))&(~(X5=pull)|~(X2=n2)))&(~(X5=push)|~(X2=n2)))|happens(X5,X2))),inference(fof_nnf,[status(thm)],[26])).
% fof(135, plain,![X6]:![X7]:((~(happens(X6,X7))|((((X6=push&X7=n0)|(X6=pull&X7=n1))|(X6=pull&X7=n2))|(X6=push&X7=n2)))&(((((~(X6=push)|~(X7=n0))&(~(X6=pull)|~(X7=n1)))&(~(X6=pull)|~(X7=n2)))&(~(X6=push)|~(X7=n2)))|happens(X6,X7))),inference(variable_rename,[status(thm)],[134])).
% fof(136, plain,![X6]:![X7]:(((((((X6=push|(X6=pull|(X6=pull|X6=push)))|~(happens(X6,X7)))&((X7=n2|(X6=pull|(X6=pull|X6=push)))|~(happens(X6,X7))))&(((X6=push|(X7=n2|(X6=pull|X6=push)))|~(happens(X6,X7)))&((X7=n2|(X7=n2|(X6=pull|X6=push)))|~(happens(X6,X7)))))&((((X6=push|(X6=pull|(X7=n1|X6=push)))|~(happens(X6,X7)))&((X7=n2|(X6=pull|(X7=n1|X6=push)))|~(happens(X6,X7))))&(((X6=push|(X7=n2|(X7=n1|X6=push)))|~(happens(X6,X7)))&((X7=n2|(X7=n2|(X7=n1|X6=push)))|~(happens(X6,X7))))))&(((((X6=push|(X6=pull|(X6=pull|X7=n0)))|~(happens(X6,X7)))&((X7=n2|(X6=pull|(X6=pull|X7=n0)))|~(happens(X6,X7))))&(((X6=push|(X7=n2|(X6=pull|X7=n0)))|~(happens(X6,X7)))&((X7=n2|(X7=n2|(X6=pull|X7=n0)))|~(happens(X6,X7)))))&((((X6=push|(X6=pull|(X7=n1|X7=n0)))|~(happens(X6,X7)))&((X7=n2|(X6=pull|(X7=n1|X7=n0)))|~(happens(X6,X7))))&(((X6=push|(X7=n2|(X7=n1|X7=n0)))|~(happens(X6,X7)))&((X7=n2|(X7=n2|(X7=n1|X7=n0)))|~(happens(X6,X7)))))))&(((((~(X6=push)|~(X7=n0))|happens(X6,X7))&((~(X6=pull)|~(X7=n1))|happens(X6,X7)))&((~(X6=pull)|~(X7=n2))|happens(X6,X7)))&((~(X6=push)|~(X7=n2))|happens(X6,X7)))),inference(distribute,[status(thm)],[135])).
% cnf(139,plain,(happens(X1,X2)|X2!=n1|X1!=pull),inference(split_conjunct,[status(thm)],[136])).
% cnf(145,plain,(X2=n0|X1=pull|X2=n2|X2=n2|~happens(X1,X2)),inference(split_conjunct,[status(thm)],[136])).
% fof(158, plain,![X3]:((~(less(X3,n2))|less_or_equal(X3,n1))&(~(less_or_equal(X3,n1))|less(X3,n2))),inference(fof_nnf,[status(thm)],[28])).
% fof(159, plain,![X4]:((~(less(X4,n2))|less_or_equal(X4,n1))&(~(less_or_equal(X4,n1))|less(X4,n2))),inference(variable_rename,[status(thm)],[158])).
% cnf(160,plain,(less(X1,n2)|~less_or_equal(X1,n1)),inference(split_conjunct,[status(thm)],[159])).
% fof(168, plain,![X3]:![X4]:((~(less(X3,X4))|(~(less(X4,X3))&~(X4=X3)))&((less(X4,X3)|X4=X3)|less(X3,X4))),inference(fof_nnf,[status(thm)],[63])).
% fof(169, plain,![X5]:![X6]:((~(less(X5,X6))|(~(less(X6,X5))&~(X6=X5)))&((less(X6,X5)|X6=X5)|less(X5,X6))),inference(variable_rename,[status(thm)],[168])).
% fof(170, plain,![X5]:![X6]:(((~(less(X6,X5))|~(less(X5,X6)))&(~(X6=X5)|~(less(X5,X6))))&((less(X6,X5)|X6=X5)|less(X5,X6))),inference(distribute,[status(thm)],[169])).
% cnf(172,plain,(~less(X1,X2)|X2!=X1),inference(split_conjunct,[status(thm)],[170])).
% fof(175, plain,![X3]:((~(less(X3,n1))|less_or_equal(X3,n0))&(~(less_or_equal(X3,n0))|less(X3,n1))),inference(fof_nnf,[status(thm)],[33])).
% fof(176, plain,![X4]:((~(less(X4,n1))|less_or_equal(X4,n0))&(~(less_or_equal(X4,n0))|less(X4,n1))),inference(variable_rename,[status(thm)],[175])).
% cnf(177,plain,(less(X1,n1)|~less_or_equal(X1,n0)),inference(split_conjunct,[status(thm)],[176])).
% fof(200, plain,![X5]:![X2]:![X1]:((~(happens(X5,X2))|~(initiates(X5,X1,X2)))|holdsAt(X1,plus(X2,n1))),inference(fof_nnf,[status(thm)],[37])).
% fof(201, plain,![X6]:![X7]:![X8]:((~(happens(X6,X7))|~(initiates(X6,X8,X7)))|holdsAt(X8,plus(X7,n1))),inference(variable_rename,[status(thm)],[200])).
% cnf(202,plain,(holdsAt(X1,plus(X2,n1))|~initiates(X3,X1,X2)|~happens(X3,X2)),inference(split_conjunct,[status(thm)],[201])).
% fof(206, plain,![X3]:![X4]:((~(less_or_equal(X3,X4))|(less(X3,X4)|X3=X4))&((~(less(X3,X4))&~(X3=X4))|less_or_equal(X3,X4))),inference(fof_nnf,[status(thm)],[39])).
% fof(207, plain,![X5]:![X6]:((~(less_or_equal(X5,X6))|(less(X5,X6)|X5=X6))&((~(less(X5,X6))&~(X5=X6))|less_or_equal(X5,X6))),inference(variable_rename,[status(thm)],[206])).
% fof(208, plain,![X5]:![X6]:((~(less_or_equal(X5,X6))|(less(X5,X6)|X5=X6))&((~(less(X5,X6))|less_or_equal(X5,X6))&(~(X5=X6)|less_or_equal(X5,X6)))),inference(distribute,[status(thm)],[207])).
% cnf(209,plain,(less_or_equal(X1,X2)|X1!=X2),inference(split_conjunct,[status(thm)],[208])).
% cnf(241,negated_conjecture,(~holdsAt(backwards,n2)),inference(split_conjunct,[status(thm)],[65])).
% fof(242, plain,![X1]:![X5]:![X2]:((~(epred1_3(X2,X5,X1))|((((X5=push&X1=forwards)&~(happens(pull,X2)))|((X5=pull&X1=backwards)&~(happens(push,X2))))|((X5=pull&X1=spinning)&happens(push,X2))))&(((((~(X5=push)|~(X1=forwards))|happens(pull,X2))&((~(X5=pull)|~(X1=backwards))|happens(push,X2)))&((~(X5=pull)|~(X1=spinning))|~(happens(push,X2))))|epred1_3(X2,X5,X1))),inference(fof_nnf,[status(thm)],[66])).
% fof(243, plain,![X6]:![X7]:![X8]:((~(epred1_3(X8,X7,X6))|((((X7=push&X6=forwards)&~(happens(pull,X8)))|((X7=pull&X6=backwards)&~(happens(push,X8))))|((X7=pull&X6=spinning)&happens(push,X8))))&(((((~(X7=push)|~(X6=forwards))|happens(pull,X8))&((~(X7=pull)|~(X6=backwards))|happens(push,X8)))&((~(X7=pull)|~(X6=spinning))|~(happens(push,X8))))|epred1_3(X8,X7,X6))),inference(variable_rename,[status(thm)],[242])).
% fof(244, plain,![X6]:![X7]:![X8]:(((((((((X7=pull|(X7=pull|X7=push))|~(epred1_3(X8,X7,X6)))&((X6=spinning|(X7=pull|X7=push))|~(epred1_3(X8,X7,X6))))&((happens(push,X8)|(X7=pull|X7=push))|~(epred1_3(X8,X7,X6))))&((((X7=pull|(X6=backwards|X7=push))|~(epred1_3(X8,X7,X6)))&((X6=spinning|(X6=backwards|X7=push))|~(epred1_3(X8,X7,X6))))&((happens(push,X8)|(X6=backwards|X7=push))|~(epred1_3(X8,X7,X6)))))&((((X7=pull|(~(happens(push,X8))|X7=push))|~(epred1_3(X8,X7,X6)))&((X6=spinning|(~(happens(push,X8))|X7=push))|~(epred1_3(X8,X7,X6))))&((happens(push,X8)|(~(happens(push,X8))|X7=push))|~(epred1_3(X8,X7,X6)))))&((((((X7=pull|(X7=pull|X6=forwards))|~(epred1_3(X8,X7,X6)))&((X6=spinning|(X7=pull|X6=forwards))|~(epred1_3(X8,X7,X6))))&((happens(push,X8)|(X7=pull|X6=forwards))|~(epred1_3(X8,X7,X6))))&((((X7=pull|(X6=backwards|X6=forwards))|~(epred1_3(X8,X7,X6)))&((X6=spinning|(X6=backwards|X6=forwards))|~(epred1_3(X8,X7,X6))))&((happens(push,X8)|(X6=backwards|X6=forwards))|~(epred1_3(X8,X7,X6)))))&((((X7=pull|(~(happens(push,X8))|X6=forwards))|~(epred1_3(X8,X7,X6)))&((X6=spinning|(~(happens(push,X8))|X6=forwards))|~(epred1_3(X8,X7,X6))))&((happens(push,X8)|(~(happens(push,X8))|X6=forwards))|~(epred1_3(X8,X7,X6))))))&((((((X7=pull|(X7=pull|~(happens(pull,X8))))|~(epred1_3(X8,X7,X6)))&((X6=spinning|(X7=pull|~(happens(pull,X8))))|~(epred1_3(X8,X7,X6))))&((happens(push,X8)|(X7=pull|~(happens(pull,X8))))|~(epred1_3(X8,X7,X6))))&((((X7=pull|(X6=backwards|~(happens(pull,X8))))|~(epred1_3(X8,X7,X6)))&((X6=spinning|(X6=backwards|~(happens(pull,X8))))|~(epred1_3(X8,X7,X6))))&((happens(push,X8)|(X6=backwards|~(happens(pull,X8))))|~(epred1_3(X8,X7,X6)))))&((((X7=pull|(~(happens(push,X8))|~(happens(pull,X8))))|~(epred1_3(X8,X7,X6)))&((X6=spinning|(~(happens(push,X8))|~(happens(pull,X8))))|~(epred1_3(X8,X7,X6))))&((happens(push,X8)|(~(happens(push,X8))|~(happens(pull,X8))))|~(epred1_3(X8,X7,X6))))))&(((((~(X7=push)|~(X6=forwards))|happens(pull,X8))|epred1_3(X8,X7,X6))&(((~(X7=pull)|~(X6=backwards))|happens(push,X8))|epred1_3(X8,X7,X6)))&(((~(X7=pull)|~(X6=spinning))|~(happens(push,X8)))|epred1_3(X8,X7,X6)))),inference(distribute,[status(thm)],[243])).
% cnf(246,plain,(epred1_3(X1,X2,X3)|happens(push,X1)|X3!=backwards|X2!=pull),inference(split_conjunct,[status(thm)],[244])).
% cnf(342,plain,(less_or_equal(X1,X1)),inference(er,[status(thm)],[209,theory(equality)])).
% cnf(343,plain,(~less(X1,X1)),inference(er,[status(thm)],[172,theory(equality)])).
% cnf(365,plain,(happens(pull,X1)|n1!=X1),inference(er,[status(thm)],[139,theory(equality)])).
% cnf(410,plain,(epred1_3(X1,X2,backwards)|happens(push,X1)|pull!=X2),inference(er,[status(thm)],[246,theory(equality)])).
% cnf(502,plain,(less(n1,n2)),inference(spm,[status(thm)],[160,342,theory(equality)])).
% cnf(504,plain,(less(n0,n1)),inference(spm,[status(thm)],[177,342,theory(equality)])).
% cnf(628,plain,(happens(pull,n1)),inference(er,[status(thm)],[365,theory(equality)])).
% cnf(1205,plain,(epred1_3(X1,pull,backwards)|happens(push,X1)),inference(er,[status(thm)],[410,theory(equality)])).
% cnf(1223,plain,(initiates(pull,backwards,X1)|happens(push,X1)),inference(spm,[status(thm)],[90,1205,theory(equality)])).
% cnf(1230,plain,(holdsAt(backwards,plus(X1,n1))|happens(push,X1)|~happens(pull,X1)),inference(spm,[status(thm)],[202,1223,theory(equality)])).
% cnf(6296,plain,(happens(push,n1)|holdsAt(backwards,plus(n1,n1))),inference(spm,[status(thm)],[1230,628,theory(equality)])).
% cnf(6298,plain,(happens(push,n1)|holdsAt(backwards,n2)),inference(rw,[status(thm)],[6296,129,theory(equality)])).
% cnf(6299,plain,(happens(push,n1)),inference(sr,[status(thm)],[6298,241,theory(equality)])).
% cnf(6302,plain,(pull=push|n2=n1|n0=n1),inference(spm,[status(thm)],[145,6299,theory(equality)])).
% cnf(6312,plain,(n2=n1|n0=n1),inference(sr,[status(thm)],[6302,84,theory(equality)])).
% cnf(6333,plain,(less(n1,n1)|n2=n1),inference(spm,[status(thm)],[504,6312,theory(equality)])).
% cnf(6371,plain,(n2=n1),inference(sr,[status(thm)],[6333,343,theory(equality)])).
% cnf(6552,plain,(less(n1,n1)),inference(rw,[status(thm)],[502,6371,theory(equality)])).
% cnf(6553,plain,($false),inference(sr,[status(thm)],[6552,343,theory(equality)])).
% cnf(6554,plain,($false),6553,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 840
% # ...of these trivial : 2
% # ...subsumed : 307
% # ...remaining for further processing: 531
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 40
% # Backward-rewritten : 129
% # Generated clauses : 2997
% # ...of the previous two non-trivial : 1128
% # Contextual simplify-reflections : 143
% # Paramodulations : 2968
% # Factorizations : 2
% # Equation resolutions : 27
% # Current number of processed clauses: 360
% # Positive orientable unit clauses: 90
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 39
% # Non-unit-clauses : 230
% # Current number of unprocessed clauses: 279
% # ...number of literals in the above : 988
% # Clause-clause subsumption calls (NU) : 7611
% # Rec. Clause-clause subsumption calls : 3917
% # Unit Clause-clause subsumption calls : 1220
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 51
% # Indexed BW rewrite successes : 39
% # Backwards rewriting index: 252 leaves, 1.40+/-1.541 terms/leaf
% # Paramod-from index: 133 leaves, 1.04+/-0.190 terms/leaf
% # Paramod-into index: 207 leaves, 1.21+/-0.897 terms/leaf
% # -------------------------------------------------
% # User time : 0.147 s
% # System time : 0.008 s
% # Total time : 0.155 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.32 CPU 0.40 WC
% FINAL PrfWatch: 0.32 CPU 0.40 WC
% SZS output end Solution for /tmp/SystemOnTPTP22682/CSR018+1.tptp
%
%------------------------------------------------------------------------------