TSTP Solution File: SWC333+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC333+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 : art02.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:50:33 EST 2010
% Result : Theorem 1.24s
% Output : Solution 1.24s
% 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/SystemOnTPTP13560/SWC333+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13560/SWC333+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13560/SWC333+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 13657
% 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(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((((~(X2=X4)|~(X1=X3))|~(segmentP(X4,X3)))|~(totalorderedP(X3)))|?[X5]:((((ssList(X5)&neq(X3,X5))&segmentP(X4,X5))&segmentP(X5,X3))&totalorderedP(X5)))|((![X6]:(ssList(X6)=>(((~(neq(X1,X6))|~(segmentP(X2,X6)))|~(segmentP(X6,X1)))|~(totalorderedP(X6))))&segmentP(X2,X1))&totalorderedP(X1))))))),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(X3)))|?[X5]:((((ssList(X5)&neq(X3,X5))&segmentP(X4,X5))&segmentP(X5,X3))&totalorderedP(X5)))|((![X6]:(ssList(X6)=>(((~(neq(X1,X6))|~(segmentP(X2,X6)))|~(segmentP(X6,X1)))|~(totalorderedP(X6))))&segmentP(X2,X1))&totalorderedP(X1)))))))),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(X3)))|?[X5]:((((ssList(X5)&neq(X3,X5))&segmentP(X4,X5))&segmentP(X5,X3))&totalorderedP(X5)))|((![X6]:(ssList(X6)=>(((~(neq(X1,X6))|~(segmentP(X2,X6)))|~(segmentP(X6,X1)))|~(totalorderedP(X6))))&segmentP(X2,X1))&totalorderedP(X1)))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((((X2=X4&X1=X3)&segmentP(X4,X3))&totalorderedP(X3))&![X5]:((((~(ssList(X5))|~(neq(X3,X5)))|~(segmentP(X4,X5)))|~(segmentP(X5,X3)))|~(totalorderedP(X5))))&((?[X6]:(ssList(X6)&(((neq(X1,X6)&segmentP(X2,X6))&segmentP(X6,X1))&totalorderedP(X6)))|~(segmentP(X2,X1)))|~(totalorderedP(X1)))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&(((((X8=X10&X7=X9)&segmentP(X10,X9))&totalorderedP(X9))&![X11]:((((~(ssList(X11))|~(neq(X9,X11)))|~(segmentP(X10,X11)))|~(segmentP(X11,X9)))|~(totalorderedP(X11))))&((?[X12]:(ssList(X12)&(((neq(X7,X12)&segmentP(X8,X12))&segmentP(X12,X7))&totalorderedP(X12)))|~(segmentP(X8,X7)))|~(totalorderedP(X7)))))))),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(esk50_0))&![X11]:((((~(ssList(X11))|~(neq(esk50_0,X11)))|~(segmentP(esk51_0,X11)))|~(segmentP(X11,esk50_0)))|~(totalorderedP(X11))))&(((ssList(esk52_0)&(((neq(esk48_0,esk52_0)&segmentP(esk49_0,esk52_0))&segmentP(esk52_0,esk48_0))&totalorderedP(esk52_0)))|~(segmentP(esk49_0,esk48_0)))|~(totalorderedP(esk48_0)))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X11]:((((((((((~(ssList(X11))|~(neq(esk50_0,X11)))|~(segmentP(esk51_0,X11)))|~(segmentP(X11,esk50_0)))|~(totalorderedP(X11)))&(((esk49_0=esk51_0&esk48_0=esk50_0)&segmentP(esk51_0,esk50_0))&totalorderedP(esk50_0)))&(((ssList(esk52_0)&(((neq(esk48_0,esk52_0)&segmentP(esk49_0,esk52_0))&segmentP(esk52_0,esk48_0))&totalorderedP(esk52_0)))|~(segmentP(esk49_0,esk48_0)))|~(totalorderedP(esk48_0))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X11]:((((((((((~(ssList(X11))|~(neq(esk50_0,X11)))|~(segmentP(esk51_0,X11)))|~(segmentP(X11,esk50_0)))|~(totalorderedP(X11)))&(((esk49_0=esk51_0&esk48_0=esk50_0)&segmentP(esk51_0,esk50_0))&totalorderedP(esk50_0)))&(((ssList(esk52_0)|~(segmentP(esk49_0,esk48_0)))|~(totalorderedP(esk48_0)))&(((((neq(esk48_0,esk52_0)|~(segmentP(esk49_0,esk48_0)))|~(totalorderedP(esk48_0)))&((segmentP(esk49_0,esk52_0)|~(segmentP(esk49_0,esk48_0)))|~(totalorderedP(esk48_0))))&((segmentP(esk52_0,esk48_0)|~(segmentP(esk49_0,esk48_0)))|~(totalorderedP(esk48_0))))&((totalorderedP(esk52_0)|~(segmentP(esk49_0,esk48_0)))|~(totalorderedP(esk48_0))))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(577,negated_conjecture,(totalorderedP(esk52_0)|~totalorderedP(esk48_0)|~segmentP(esk49_0,esk48_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(segmentP(esk52_0,esk48_0)|~totalorderedP(esk48_0)|~segmentP(esk49_0,esk48_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(segmentP(esk49_0,esk52_0)|~totalorderedP(esk48_0)|~segmentP(esk49_0,esk48_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(neq(esk48_0,esk52_0)|~totalorderedP(esk48_0)|~segmentP(esk49_0,esk48_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(ssList(esk52_0)|~totalorderedP(esk48_0)|~segmentP(esk49_0,esk48_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(totalorderedP(esk50_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(segmentP(esk51_0,esk50_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(584,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(586,negated_conjecture,(~totalorderedP(X1)|~segmentP(X1,esk50_0)|~segmentP(esk51_0,X1)|~neq(esk50_0,X1)|~ssList(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(589,negated_conjecture,(totalorderedP(esk48_0)),inference(rw,[status(thm)],[582,584,theory(equality)])).
% cnf(590,negated_conjecture,(segmentP(esk49_0,esk48_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[583,585,theory(equality)]),584,theory(equality)])).
% cnf(591,negated_conjecture,(ssList(esk52_0)|$false|~segmentP(esk49_0,esk48_0)),inference(rw,[status(thm)],[581,589,theory(equality)])).
% cnf(592,negated_conjecture,(ssList(esk52_0)|$false|$false),inference(rw,[status(thm)],[591,590,theory(equality)])).
% cnf(593,negated_conjecture,(ssList(esk52_0)),inference(cn,[status(thm)],[592,theory(equality)])).
% cnf(594,negated_conjecture,(totalorderedP(esk52_0)|$false|~segmentP(esk49_0,esk48_0)),inference(rw,[status(thm)],[577,589,theory(equality)])).
% cnf(595,negated_conjecture,(totalorderedP(esk52_0)|$false|$false),inference(rw,[status(thm)],[594,590,theory(equality)])).
% cnf(596,negated_conjecture,(totalorderedP(esk52_0)),inference(cn,[status(thm)],[595,theory(equality)])).
% cnf(597,negated_conjecture,(neq(esk48_0,esk52_0)|$false|~segmentP(esk49_0,esk48_0)),inference(rw,[status(thm)],[580,589,theory(equality)])).
% cnf(598,negated_conjecture,(neq(esk48_0,esk52_0)|$false|$false),inference(rw,[status(thm)],[597,590,theory(equality)])).
% cnf(599,negated_conjecture,(neq(esk48_0,esk52_0)),inference(cn,[status(thm)],[598,theory(equality)])).
% cnf(600,negated_conjecture,(segmentP(esk49_0,esk52_0)|$false|~segmentP(esk49_0,esk48_0)),inference(rw,[status(thm)],[579,589,theory(equality)])).
% cnf(601,negated_conjecture,(segmentP(esk49_0,esk52_0)|$false|$false),inference(rw,[status(thm)],[600,590,theory(equality)])).
% cnf(602,negated_conjecture,(segmentP(esk49_0,esk52_0)),inference(cn,[status(thm)],[601,theory(equality)])).
% cnf(603,negated_conjecture,(segmentP(esk52_0,esk48_0)|$false|~segmentP(esk49_0,esk48_0)),inference(rw,[status(thm)],[578,589,theory(equality)])).
% cnf(604,negated_conjecture,(segmentP(esk52_0,esk48_0)|$false|$false),inference(rw,[status(thm)],[603,590,theory(equality)])).
% cnf(605,negated_conjecture,(segmentP(esk52_0,esk48_0)),inference(cn,[status(thm)],[604,theory(equality)])).
% cnf(606,negated_conjecture,(~ssList(X1)|~totalorderedP(X1)|~segmentP(X1,esk48_0)|~neq(esk50_0,X1)|~segmentP(esk51_0,X1)),inference(rw,[status(thm)],[586,584,theory(equality)])).
% cnf(607,negated_conjecture,(~ssList(X1)|~totalorderedP(X1)|~segmentP(X1,esk48_0)|~neq(esk48_0,X1)|~segmentP(esk51_0,X1)),inference(rw,[status(thm)],[606,584,theory(equality)])).
% cnf(608,negated_conjecture,(~ssList(X1)|~totalorderedP(X1)|~segmentP(X1,esk48_0)|~neq(esk48_0,X1)|~segmentP(esk49_0,X1)),inference(rw,[status(thm)],[607,585,theory(equality)])).
% cnf(609,negated_conjecture,(~totalorderedP(esk52_0)|~segmentP(esk49_0,esk52_0)|~neq(esk48_0,esk52_0)|~ssList(esk52_0)),inference(spm,[status(thm)],[608,605,theory(equality)])).
% cnf(612,negated_conjecture,($false|~segmentP(esk49_0,esk52_0)|~neq(esk48_0,esk52_0)|~ssList(esk52_0)),inference(rw,[status(thm)],[609,596,theory(equality)])).
% cnf(613,negated_conjecture,($false|$false|~neq(esk48_0,esk52_0)|~ssList(esk52_0)),inference(rw,[status(thm)],[612,602,theory(equality)])).
% cnf(614,negated_conjecture,($false|$false|$false|~ssList(esk52_0)),inference(rw,[status(thm)],[613,599,theory(equality)])).
% cnf(615,negated_conjecture,($false|$false|$false|$false),inference(rw,[status(thm)],[614,593,theory(equality)])).
% cnf(616,negated_conjecture,($false),inference(cn,[status(thm)],[615,theory(equality)])).
% cnf(617,negated_conjecture,($false),616,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 38
% # ...of these trivial : 2
% # ...subsumed : 0
% # ...remaining for further processing: 36
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 3
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 3
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 36
% # Positive orientable unit clauses: 21
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 13
% # Current number of unprocessed clauses: 164
% # ...number of literals in the above : 665
% # Clause-clause subsumption calls (NU) : 11
% # Rec. Clause-clause subsumption calls : 9
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 51 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 31 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 44 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.030 s
% # System time : 0.004 s
% # Total time : 0.034 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.21 WC
% FINAL PrfWatch: 0.14 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP13560/SWC333+1.tptp
%
%------------------------------------------------------------------------------