TSTP Solution File: SWC372+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC372+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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 : Thu Dec 30 07:58:42 EST 2010
% Result : Theorem 1.77s
% Output : Solution 1.77s
% 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/SystemOnTPTP7011/SWC372+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7011/SWC372+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7011/SWC372+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 7107
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.030 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(segmentP(X1,X2)<=>?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&app(app(X3,X2),X4)=X1))))),file('/tmp/SRASS.s.p', ax7)).
% fof(5, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(12, axiom,![X1]:(ssList(X1)=>app(nil,X1)=X1),file('/tmp/SRASS.s.p', ax28)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|![X5]:(ssList(X5)=>((~(app(X3,X5)=X4)|~(strictorderedP(X3)))|?[X6]:(ssItem(X6)&?[X7]:((ssList(X7)&app(cons(X6,nil),X7)=X5)&?[X8]:(ssItem(X8)&?[X9]:((ssList(X9)&app(X9,cons(X8,nil))=X3)<(X8,X6))))))))|segmentP(X2,X1))|(~(nil=X4)&nil=X3)))))),file('/tmp/SRASS.s.p', co1)).
% fof(97, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|![X5]:(ssList(X5)=>((~(app(X3,X5)=X4)|~(strictorderedP(X3)))|?[X6]:(ssItem(X6)&?[X7]:((ssList(X7)&app(cons(X6,nil),X7)=X5)&?[X8]:(ssItem(X8)&?[X9]:((ssList(X9)&app(X9,cons(X8,nil))=X3)<(X8,X6))))))))|segmentP(X2,X1))|(~(nil=X4)&nil=X3))))))),inference(assume_negation,[status(cth)],[96])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|![X5]:(ssList(X5)=>((~(app(X3,X5)=X4)|~(strictorderedP(X3)))|?[X6]:(ssItem(X6)&?[X7]:((ssList(X7)&app(cons(X6,nil),X7)=X5)&?[X8]:(ssItem(X8)&?[X9]:((ssList(X9)&app(X9,cons(X8,nil))=X3)<(X8,X6))))))))|segmentP(X2,X1))|(~(nil=X4)&nil=X3))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(109, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(segmentP(X1,X2))|?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&app(app(X3,X2),X4)=X1)))&(![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|~(app(app(X3,X2),X4)=X1)))|segmentP(X1,X2))))),inference(fof_nnf,[status(thm)],[2])).
% fof(110, plain,![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|((~(segmentP(X5,X6))|?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&app(app(X7,X6),X8)=X5)))&(![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|~(app(app(X9,X6),X10)=X5)))|segmentP(X5,X6))))),inference(variable_rename,[status(thm)],[109])).
% fof(111, plain,![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|((~(segmentP(X5,X6))|(ssList(esk3_2(X5,X6))&(ssList(esk4_2(X5,X6))&app(app(esk3_2(X5,X6),X6),esk4_2(X5,X6))=X5)))&(![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|~(app(app(X9,X6),X10)=X5)))|segmentP(X5,X6))))),inference(skolemize,[status(esa)],[110])).
% fof(112, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(app(X9,X6),X10)=X5))|~(ssList(X9)))|segmentP(X5,X6))&(~(segmentP(X5,X6))|(ssList(esk3_2(X5,X6))&(ssList(esk4_2(X5,X6))&app(app(esk3_2(X5,X6),X6),esk4_2(X5,X6))=X5))))|~(ssList(X6)))|~(ssList(X5))),inference(shift_quantors,[status(thm)],[111])).
% fof(113, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(app(X9,X6),X10)=X5))|~(ssList(X9)))|segmentP(X5,X6))|~(ssList(X6)))|~(ssList(X5)))&((((ssList(esk3_2(X5,X6))|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))&((((ssList(esk4_2(X5,X6))|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))&(((app(app(esk3_2(X5,X6),X6),esk4_2(X5,X6))=X5|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))))),inference(distribute,[status(thm)],[112])).
% cnf(117,plain,(segmentP(X1,X2)|~ssList(X1)|~ssList(X2)|~ssList(X3)|app(app(X3,X2),X4)!=X1|~ssList(X4)),inference(split_conjunct,[status(thm)],[113])).
% cnf(135,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[5])).
% fof(165, plain,![X1]:(~(ssList(X1))|app(nil,X1)=X1),inference(fof_nnf,[status(thm)],[12])).
% fof(166, plain,![X2]:(~(ssList(X2))|app(nil,X2)=X2),inference(variable_rename,[status(thm)],[165])).
% cnf(167,plain,(app(nil,X1)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[166])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((X2=X4&X1=X3)&?[X5]:(ssList(X5)&((app(X3,X5)=X4&strictorderedP(X3))&![X6]:(~(ssItem(X6))|![X7]:((~(ssList(X7))|~(app(cons(X6,nil),X7)=X5))|![X8]:(~(ssItem(X8))|![X9]:((~(ssList(X9))|~(app(X9,cons(X8,nil))=X3))|~(lt(X8,X6)))))))))&~(segmentP(X2,X1)))&(nil=X4|~(nil=X3))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&?[X12]:(ssList(X12)&?[X13]:(ssList(X13)&((((X11=X13&X10=X12)&?[X14]:(ssList(X14)&((app(X12,X14)=X13&strictorderedP(X12))&![X15]:(~(ssItem(X15))|![X16]:((~(ssList(X16))|~(app(cons(X15,nil),X16)=X14))|![X17]:(~(ssItem(X17))|![X18]:((~(ssList(X18))|~(app(X18,cons(X17,nil))=X12))|~(lt(X17,X15)))))))))&~(segmentP(X11,X10)))&(nil=X13|~(nil=X12))))))),inference(variable_rename,[status(thm)],[568])).
% fof(570, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&((((esk49_0=esk51_0&esk48_0=esk50_0)&(ssList(esk52_0)&((app(esk50_0,esk52_0)=esk51_0&strictorderedP(esk50_0))&![X15]:(~(ssItem(X15))|![X16]:((~(ssList(X16))|~(app(cons(X15,nil),X16)=esk52_0))|![X17]:(~(ssItem(X17))|![X18]:((~(ssList(X18))|~(app(X18,cons(X17,nil))=esk50_0))|~(lt(X17,X15)))))))))&~(segmentP(esk49_0,esk48_0)))&(nil=esk51_0|~(nil=esk50_0))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X15]:![X16]:![X17]:![X18]:((((((((((((((~(ssList(X18))|~(app(X18,cons(X17,nil))=esk50_0))|~(lt(X17,X15)))|~(ssItem(X17)))|(~(ssList(X16))|~(app(cons(X15,nil),X16)=esk52_0)))|~(ssItem(X15)))&(app(esk50_0,esk52_0)=esk51_0&strictorderedP(esk50_0)))&ssList(esk52_0))&(esk49_0=esk51_0&esk48_0=esk50_0))&~(segmentP(esk49_0,esk48_0)))&(nil=esk51_0|~(nil=esk50_0)))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% cnf(572,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(573,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(~segmentP(esk49_0,esk48_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(ssList(esk52_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(582,negated_conjecture,(app(esk50_0,esk52_0)=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(584,negated_conjecture,(~segmentP(esk51_0,esk50_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[577,579,theory(equality)]),578,theory(equality)])).
% cnf(585,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[572,578,theory(equality)])).
% cnf(586,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[573,579,theory(equality)])).
% cnf(839,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|~ssList(nil)|~ssList(X2)|~ssList(X1)),inference(spm,[status(thm)],[117,167,theory(equality)])).
% cnf(846,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|$false|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[839,135,theory(equality)])).
% cnf(847,plain,(segmentP(X1,X2)|app(X2,X3)!=X1|~ssList(X3)|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[846,theory(equality)])).
% cnf(9686,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|~ssList(esk52_0)|~ssList(esk50_0)|~ssList(X1)),inference(spm,[status(thm)],[847,582,theory(equality)])).
% cnf(9730,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|$false|~ssList(esk50_0)|~ssList(X1)),inference(rw,[status(thm)],[9686,580,theory(equality)])).
% cnf(9731,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[9730,585,theory(equality)])).
% cnf(9732,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[9731,theory(equality)])).
% cnf(10035,negated_conjecture,(segmentP(esk51_0,esk50_0)|~ssList(esk51_0)),inference(er,[status(thm)],[9732,theory(equality)])).
% cnf(10036,negated_conjecture,(segmentP(esk51_0,esk50_0)|$false),inference(rw,[status(thm)],[10035,586,theory(equality)])).
% cnf(10037,negated_conjecture,(segmentP(esk51_0,esk50_0)),inference(cn,[status(thm)],[10036,theory(equality)])).
% cnf(10038,negated_conjecture,($false),inference(sr,[status(thm)],[10037,584,theory(equality)])).
% cnf(10039,negated_conjecture,($false),10038,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1183
% # ...of these trivial : 18
% # ...subsumed : 404
% # ...remaining for further processing: 761
% # Other redundant clauses eliminated : 109
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 60
% # Backward-rewritten : 108
% # Generated clauses : 3520
% # ...of the previous two non-trivial : 2993
% # Contextual simplify-reflections : 287
% # Paramodulations : 3366
% # Factorizations : 0
% # Equation resolutions : 154
% # Current number of processed clauses: 587
% # Positive orientable unit clauses: 115
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 469
% # Current number of unprocessed clauses: 1595
% # ...number of literals in the above : 9571
% # Clause-clause subsumption calls (NU) : 15521
% # Rec. Clause-clause subsumption calls : 11939
% # Unit Clause-clause subsumption calls : 108
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 52
% # Indexed BW rewrite successes : 34
% # Backwards rewriting index: 524 leaves, 1.27+/-0.896 terms/leaf
% # Paramod-from index: 269 leaves, 1.07+/-0.284 terms/leaf
% # Paramod-into index: 477 leaves, 1.17+/-0.730 terms/leaf
% # -------------------------------------------------
% # User time : 0.250 s
% # System time : 0.013 s
% # Total time : 0.263 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.50 CPU 0.56 WC
% FINAL PrfWatch: 0.50 CPU 0.56 WC
% SZS output end Solution for /tmp/SystemOnTPTP7011/SWC372+1.tptp
%
%------------------------------------------------------------------------------