TSTP Solution File: CSR023+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : CSR023+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 : 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 : Tue Dec 28 22:46:15 EST 2010
% Result : Theorem 1.03s
% Output : Solution 1.03s
% 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/SystemOnTPTP30459/CSR023+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30459/CSR023+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30459/CSR023+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 30555
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.023 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(11, axiom,![X3]:![X4]:plus(X3,X4)=plus(X4,X3),file('/tmp/SRASS.s.p', symmetry_of_plus)).
% 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(25, 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(26, axiom,plus(n1,n2)=n3,file('/tmp/SRASS.s.p', plus1_2)).
% fof(38, axiom,![X5]:![X2]:![X1]:((happens(X5,X2)&initiates(X5,X1,X2))=>holdsAt(X1,plus(X2,n1))),file('/tmp/SRASS.s.p', happens_holds)).
% fof(48, conjecture,holdsAt(spinning,n3),file('/tmp/SRASS.s.p', spinning_3)).
% fof(49, negated_conjecture,~(holdsAt(spinning,n3)),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(65, negated_conjecture,~(holdsAt(spinning,n3)),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)])).
% fof(85, plain,![X5]:![X6]:plus(X5,X6)=plus(X6,X5),inference(variable_rename,[status(thm)],[11])).
% cnf(86,plain,(plus(X1,X2)=plus(X2,X1)),inference(split_conjunct,[status(thm)],[85])).
% 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])).
% fof(133, 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)],[25])).
% fof(134, 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)],[133])).
% fof(135, 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)],[134])).
% cnf(136,plain,(happens(X1,X2)|X2!=n2|X1!=push),inference(split_conjunct,[status(thm)],[135])).
% cnf(137,plain,(happens(X1,X2)|X2!=n2|X1!=pull),inference(split_conjunct,[status(thm)],[135])).
% cnf(156,plain,(plus(n1,n2)=n3),inference(split_conjunct,[status(thm)],[26])).
% fof(201, plain,![X5]:![X2]:![X1]:((~(happens(X5,X2))|~(initiates(X5,X1,X2)))|holdsAt(X1,plus(X2,n1))),inference(fof_nnf,[status(thm)],[38])).
% fof(202, plain,![X6]:![X7]:![X8]:((~(happens(X6,X7))|~(initiates(X6,X8,X7)))|holdsAt(X8,plus(X7,n1))),inference(variable_rename,[status(thm)],[201])).
% cnf(203,plain,(holdsAt(X1,plus(X2,n1))|~initiates(X3,X1,X2)|~happens(X3,X2)),inference(split_conjunct,[status(thm)],[202])).
% cnf(241,negated_conjecture,(~holdsAt(spinning,n3)),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(245,plain,(epred1_3(X1,X2,X3)|~happens(push,X1)|X3!=spinning|X2!=pull),inference(split_conjunct,[status(thm)],[244])).
% cnf(363,plain,(happens(push,X1)|n2!=X1),inference(er,[status(thm)],[136,theory(equality)])).
% cnf(365,plain,(happens(pull,X1)|n2!=X1),inference(er,[status(thm)],[137,theory(equality)])).
% cnf(411,plain,(epred1_3(X1,X2,spinning)|pull!=X2|~happens(push,X1)),inference(er,[status(thm)],[245,theory(equality)])).
% cnf(571,plain,(happens(push,n2)),inference(er,[status(thm)],[363,theory(equality)])).
% cnf(626,plain,(happens(pull,n2)),inference(er,[status(thm)],[365,theory(equality)])).
% cnf(1277,plain,(epred1_3(X1,pull,spinning)|~happens(push,X1)),inference(er,[status(thm)],[411,theory(equality)])).
% cnf(1372,plain,(epred1_3(n2,pull,spinning)),inference(spm,[status(thm)],[1277,571,theory(equality)])).
% cnf(1404,plain,(initiates(pull,spinning,n2)),inference(spm,[status(thm)],[90,1372,theory(equality)])).
% cnf(1414,plain,(holdsAt(spinning,plus(n2,n1))|~happens(pull,n2)),inference(spm,[status(thm)],[203,1404,theory(equality)])).
% cnf(1417,plain,(holdsAt(spinning,plus(n2,n1))|$false),inference(rw,[status(thm)],[1414,626,theory(equality)])).
% cnf(1418,plain,(holdsAt(spinning,plus(n2,n1))),inference(cn,[status(thm)],[1417,theory(equality)])).
% cnf(1430,plain,(holdsAt(spinning,n3)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1418,86,theory(equality)]),156,theory(equality)])).
% cnf(1431,plain,($false),inference(sr,[status(thm)],[1430,241,theory(equality)])).
% cnf(1432,plain,($false),1431,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 491
% # ...of these trivial : 3
% # ...subsumed : 130
% # ...remaining for further processing: 358
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 38
% # Backward-rewritten : 2
% # Generated clauses : 735
% # ...of the previous two non-trivial : 484
% # Contextual simplify-reflections : 74
% # Paramodulations : 706
% # Factorizations : 2
% # Equation resolutions : 27
% # Current number of processed clauses: 315
% # Positive orientable unit clauses: 112
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 48
% # Non-unit-clauses : 154
% # Current number of unprocessed clauses: 92
% # ...number of literals in the above : 360
% # Clause-clause subsumption calls (NU) : 910
% # Rec. Clause-clause subsumption calls : 840
% # Unit Clause-clause subsumption calls : 1172
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 46
% # Indexed BW rewrite successes : 35
% # Backwards rewriting index: 273 leaves, 1.22+/-0.853 terms/leaf
% # Paramod-from index: 139 leaves, 1.04+/-0.203 terms/leaf
% # Paramod-into index: 233 leaves, 1.12+/-0.428 terms/leaf
% # -------------------------------------------------
% # User time : 0.065 s
% # System time : 0.005 s
% # Total time : 0.070 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.25 WC
% FINAL PrfWatch: 0.16 CPU 0.25 WC
% SZS output end Solution for /tmp/SystemOnTPTP30459/CSR023+1.tptp
%
%------------------------------------------------------------------------------