TSTP Solution File: SWC277+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC277+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 : art07.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:37:52 EST 2010
% Result : Theorem 1.30s
% Output : Solution 1.30s
% 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/SystemOnTPTP11094/SWC277+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP11094/SWC277+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11094/SWC277+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 11190
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(2, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(5, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>((segmentP(X1,X2)&segmentP(X2,X1))=>X1=X2))),file('/tmp/SRASS.s.p', ax54)).
% fof(7, axiom,![X1]:(ssList(X1)=>segmentP(X1,nil)),file('/tmp/SRASS.s.p', ax57)).
% fof(9, axiom,totalorderedP(nil),file('/tmp/SRASS.s.p', ax66)).
% fof(12, axiom,![X1]:(ssList(X1)=>(singletonP(X1)<=>?[X2]:(ssItem(X2)&cons(X2,nil)=X1))),file('/tmp/SRASS.s.p', ax4)).
% fof(21, axiom,![X1]:(ssItem(X1)=>totalorderedP(cons(X1,nil))),file('/tmp/SRASS.s.p', ax65)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|~(segmentP(X4,X3)))|totalorderedP(X1))|(~(singletonP(X3))&neq(X4,nil))))))),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))|~(segmentP(X4,X3)))|totalorderedP(X1))|(~(singletonP(X3))&neq(X4,nil)))))))),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))|~(segmentP(X4,X3)))|totalorderedP(X1))|(~(singletonP(X3))&neq(X4,nil)))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(104, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[1])).
% fof(105, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[104])).
% fof(106, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[105])).
% fof(107, plain,![X3]:![X4]:((((~(neq(X3,X4))|~(X3=X4))|~(ssList(X4)))|~(ssList(X3)))&(((X3=X4|neq(X3,X4))|~(ssList(X4)))|~(ssList(X3)))),inference(distribute,[status(thm)],[106])).
% cnf(108,plain,(neq(X1,X2)|X1=X2|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[107])).
% cnf(110,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[2])).
% fof(116, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(segmentP(X1,X2))|~(segmentP(X2,X1)))|X1=X2))),inference(fof_nnf,[status(thm)],[5])).
% fof(117, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(segmentP(X3,X4))|~(segmentP(X4,X3)))|X3=X4))),inference(variable_rename,[status(thm)],[116])).
% fof(118, plain,![X3]:![X4]:((~(ssList(X4))|((~(segmentP(X3,X4))|~(segmentP(X4,X3)))|X3=X4))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[117])).
% cnf(119,plain,(X1=X2|~ssList(X1)|~segmentP(X2,X1)|~segmentP(X1,X2)|~ssList(X2)),inference(split_conjunct,[status(thm)],[118])).
% fof(123, plain,![X1]:(~(ssList(X1))|segmentP(X1,nil)),inference(fof_nnf,[status(thm)],[7])).
% fof(124, plain,![X2]:(~(ssList(X2))|segmentP(X2,nil)),inference(variable_rename,[status(thm)],[123])).
% cnf(125,plain,(segmentP(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[124])).
% cnf(131,plain,(totalorderedP(nil)),inference(split_conjunct,[status(thm)],[9])).
% fof(147, plain,![X1]:(~(ssList(X1))|((~(singletonP(X1))|?[X2]:(ssItem(X2)&cons(X2,nil)=X1))&(![X2]:(~(ssItem(X2))|~(cons(X2,nil)=X1))|singletonP(X1)))),inference(fof_nnf,[status(thm)],[12])).
% fof(148, plain,![X3]:(~(ssList(X3))|((~(singletonP(X3))|?[X4]:(ssItem(X4)&cons(X4,nil)=X3))&(![X5]:(~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3)))),inference(variable_rename,[status(thm)],[147])).
% fof(149, plain,![X3]:(~(ssList(X3))|((~(singletonP(X3))|(ssItem(esk3_1(X3))&cons(esk3_1(X3),nil)=X3))&(![X5]:(~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3)))),inference(skolemize,[status(esa)],[148])).
% fof(150, plain,![X3]:![X5]:((((~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3))&(~(singletonP(X3))|(ssItem(esk3_1(X3))&cons(esk3_1(X3),nil)=X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[149])).
% fof(151, plain,![X3]:![X5]:((((~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3))|~(ssList(X3)))&(((ssItem(esk3_1(X3))|~(singletonP(X3)))|~(ssList(X3)))&((cons(esk3_1(X3),nil)=X3|~(singletonP(X3)))|~(ssList(X3))))),inference(distribute,[status(thm)],[150])).
% cnf(152,plain,(cons(esk3_1(X1),nil)=X1|~ssList(X1)|~singletonP(X1)),inference(split_conjunct,[status(thm)],[151])).
% cnf(153,plain,(ssItem(esk3_1(X1))|~ssList(X1)|~singletonP(X1)),inference(split_conjunct,[status(thm)],[151])).
% fof(191, plain,![X1]:(~(ssItem(X1))|totalorderedP(cons(X1,nil))),inference(fof_nnf,[status(thm)],[21])).
% fof(192, plain,![X2]:(~(ssItem(X2))|totalorderedP(cons(X2,nil))),inference(variable_rename,[status(thm)],[191])).
% cnf(193,plain,(totalorderedP(cons(X1,nil))|~ssItem(X1)),inference(split_conjunct,[status(thm)],[192])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((X2=X4&X1=X3)&segmentP(X4,X3))&~(totalorderedP(X1)))&(singletonP(X3)|~(neq(X4,nil)))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&((((X6=X8&X5=X7)&segmentP(X8,X7))&~(totalorderedP(X5)))&(singletonP(X7)|~(neq(X8,nil)))))))),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)&segmentP(esk51_0,esk50_0))&~(totalorderedP(esk48_0)))&(singletonP(esk50_0)|~(neq(esk51_0,nil)))))))),inference(skolemize,[status(esa)],[569])).
% cnf(571,negated_conjecture,(singletonP(esk50_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[570])).
% cnf(572,negated_conjecture,(~totalorderedP(esk48_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(573,negated_conjecture,(segmentP(esk51_0,esk50_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(574,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(575,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(578,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(579,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(580,negated_conjecture,(~totalorderedP(esk50_0)),inference(rw,[status(thm)],[572,574,theory(equality)])).
% cnf(581,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[579,574,theory(equality)])).
% cnf(582,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[578,575,theory(equality)])).
% cnf(614,plain,(totalorderedP(X1)|~ssItem(esk3_1(X1))|~singletonP(X1)|~ssList(X1)),inference(spm,[status(thm)],[193,152,theory(equality)])).
% cnf(629,negated_conjecture,(singletonP(esk50_0)|esk51_0=nil|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[571,108,theory(equality)])).
% cnf(630,negated_conjecture,(singletonP(esk50_0)|esk51_0=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[629,110,theory(equality)])).
% cnf(631,negated_conjecture,(singletonP(esk50_0)|esk51_0=nil|$false|$false),inference(rw,[status(thm)],[630,582,theory(equality)])).
% cnf(632,negated_conjecture,(singletonP(esk50_0)|esk51_0=nil),inference(cn,[status(thm)],[631,theory(equality)])).
% cnf(658,negated_conjecture,(esk50_0=esk51_0|~segmentP(esk50_0,esk51_0)|~ssList(esk51_0)|~ssList(esk50_0)),inference(spm,[status(thm)],[119,573,theory(equality)])).
% cnf(660,negated_conjecture,(esk50_0=esk51_0|~segmentP(esk50_0,esk51_0)|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[658,582,theory(equality)])).
% cnf(661,negated_conjecture,(esk50_0=esk51_0|~segmentP(esk50_0,esk51_0)|$false|$false),inference(rw,[status(thm)],[660,581,theory(equality)])).
% cnf(662,negated_conjecture,(esk50_0=esk51_0|~segmentP(esk50_0,esk51_0)),inference(cn,[status(thm)],[661,theory(equality)])).
% cnf(1831,plain,(totalorderedP(X1)|~singletonP(X1)|~ssList(X1)),inference(csr,[status(thm)],[614,153])).
% cnf(1832,negated_conjecture,(totalorderedP(esk50_0)|esk51_0=nil|~ssList(esk50_0)),inference(spm,[status(thm)],[1831,632,theory(equality)])).
% cnf(1834,negated_conjecture,(totalorderedP(esk50_0)|esk51_0=nil|$false),inference(rw,[status(thm)],[1832,581,theory(equality)])).
% cnf(1835,negated_conjecture,(totalorderedP(esk50_0)|esk51_0=nil),inference(cn,[status(thm)],[1834,theory(equality)])).
% cnf(1836,negated_conjecture,(esk51_0=nil),inference(sr,[status(thm)],[1835,580,theory(equality)])).
% cnf(1848,negated_conjecture,(esk50_0=nil|~segmentP(esk50_0,esk51_0)),inference(rw,[status(thm)],[662,1836,theory(equality)])).
% cnf(1849,negated_conjecture,(esk50_0=nil|~segmentP(esk50_0,nil)),inference(rw,[status(thm)],[1848,1836,theory(equality)])).
% cnf(1858,negated_conjecture,(esk50_0=nil|~ssList(esk50_0)),inference(spm,[status(thm)],[1849,125,theory(equality)])).
% cnf(1859,negated_conjecture,(esk50_0=nil|$false),inference(rw,[status(thm)],[1858,581,theory(equality)])).
% cnf(1860,negated_conjecture,(esk50_0=nil),inference(cn,[status(thm)],[1859,theory(equality)])).
% cnf(1864,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[580,1860,theory(equality)]),131,theory(equality)])).
% cnf(1865,negated_conjecture,($false),inference(cn,[status(thm)],[1864,theory(equality)])).
% cnf(1866,negated_conjecture,($false),1865,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 268
% # ...of these trivial : 2
% # ...subsumed : 23
% # ...remaining for further processing: 243
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 27
% # Generated clauses : 695
% # ...of the previous two non-trivial : 574
% # Contextual simplify-reflections : 13
% # Paramodulations : 601
% # Factorizations : 0
% # Equation resolutions : 94
% # Current number of processed clauses: 209
% # Positive orientable unit clauses: 21
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 186
% # Current number of unprocessed clauses: 429
% # ...number of literals in the above : 3142
% # Clause-clause subsumption calls (NU) : 1067
% # Rec. Clause-clause subsumption calls : 355
% # Unit Clause-clause subsumption calls : 8
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 238 leaves, 1.37+/-1.133 terms/leaf
% # Paramod-from index: 114 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 212 leaves, 1.23+/-0.950 terms/leaf
% # -------------------------------------------------
% # User time : 0.075 s
% # System time : 0.004 s
% # Total time : 0.079 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.20 CPU 0.28 WC
% FINAL PrfWatch: 0.20 CPU 0.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP11094/SWC277+1.tptp
%
%------------------------------------------------------------------------------