TSTP Solution File: SWC369+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC369+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:58:13 EST 2010
% Result : Theorem 1.27s
% Output : Solution 1.27s
% 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/SystemOnTPTP23378/SWC369+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP23378/SWC369+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23378/SWC369+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 23474
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.032 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(7, axiom,![X1]:(ssList(X1)=>(segmentP(nil,X1)<=>nil=X1)),file('/tmp/SRASS.s.p', ax58)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|segmentP(X2,X1))|(~(nil=X3)&nil=X4))|(neq(X4,nil)&(~(neq(X3,nil))|~(segmentP(X4,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))|segmentP(X2,X1))|(~(nil=X3)&nil=X4))|(neq(X4,nil)&(~(neq(X3,nil))|~(segmentP(X4,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))|segmentP(X2,X1))|(~(nil=X3)&nil=X4))|(neq(X4,nil)&(~(neq(X3,nil))|~(segmentP(X4,X3)))))))))),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(125, plain,![X1]:(~(ssList(X1))|((~(segmentP(nil,X1))|nil=X1)&(~(nil=X1)|segmentP(nil,X1)))),inference(fof_nnf,[status(thm)],[7])).
% fof(126, plain,![X2]:(~(ssList(X2))|((~(segmentP(nil,X2))|nil=X2)&(~(nil=X2)|segmentP(nil,X2)))),inference(variable_rename,[status(thm)],[125])).
% fof(127, plain,![X2]:(((~(segmentP(nil,X2))|nil=X2)|~(ssList(X2)))&((~(nil=X2)|segmentP(nil,X2))|~(ssList(X2)))),inference(distribute,[status(thm)],[126])).
% cnf(128,plain,(segmentP(nil,X1)|~ssList(X1)|nil!=X1),inference(split_conjunct,[status(thm)],[127])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((X2=X4&X1=X3)&~(segmentP(X2,X1)))&(nil=X3|~(nil=X4)))&(~(neq(X4,nil))|(neq(X3,nil)&segmentP(X4,X3)))))))),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(X6,X5)))&(nil=X7|~(nil=X8)))&(~(neq(X8,nil))|(neq(X7,nil)&segmentP(X8,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(esk49_0,esk48_0)))&(nil=esk50_0|~(nil=esk51_0)))&(~(neq(esk51_0,nil))|(neq(esk50_0,nil)&segmentP(esk51_0,esk50_0)))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&((((esk49_0=esk51_0&esk48_0=esk50_0)&~(segmentP(esk49_0,esk48_0)))&(nil=esk50_0|~(nil=esk51_0)))&((neq(esk50_0,nil)|~(neq(esk51_0,nil)))&(segmentP(esk51_0,esk50_0)|~(neq(esk51_0,nil))))))))),inference(distribute,[status(thm)],[570])).
% cnf(572,negated_conjecture,(segmentP(esk51_0,esk50_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(574,negated_conjecture,(nil=esk50_0|nil!=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(575,negated_conjecture,(~segmentP(esk49_0,esk48_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(576,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(582,negated_conjecture,(~segmentP(esk51_0,esk50_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[575,577,theory(equality)]),576,theory(equality)])).
% cnf(584,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[580,577,theory(equality)])).
% cnf(587,negated_conjecture,(~neq(esk51_0,nil)),inference(sr,[status(thm)],[572,582,theory(equality)])).
% cnf(588,plain,(segmentP(nil,nil)|~ssList(nil)),inference(er,[status(thm)],[128,theory(equality)])).
% cnf(589,plain,(segmentP(nil,nil)|$false),inference(rw,[status(thm)],[588,110,theory(equality)])).
% cnf(590,plain,(segmentP(nil,nil)),inference(cn,[status(thm)],[589,theory(equality)])).
% cnf(614,negated_conjecture,(esk51_0=nil|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[587,108,theory(equality)])).
% cnf(618,negated_conjecture,(esk51_0=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[614,110,theory(equality)])).
% cnf(619,negated_conjecture,(esk51_0=nil|$false|$false),inference(rw,[status(thm)],[618,584,theory(equality)])).
% cnf(620,negated_conjecture,(esk51_0=nil),inference(cn,[status(thm)],[619,theory(equality)])).
% cnf(1307,negated_conjecture,(~segmentP(nil,esk50_0)),inference(rw,[status(thm)],[582,620,theory(equality)])).
% cnf(1309,negated_conjecture,(esk50_0=nil|$false),inference(rw,[status(thm)],[574,620,theory(equality)])).
% cnf(1310,negated_conjecture,(esk50_0=nil),inference(cn,[status(thm)],[1309,theory(equality)])).
% cnf(1329,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1307,1310,theory(equality)]),590,theory(equality)])).
% cnf(1330,negated_conjecture,($false),inference(cn,[status(thm)],[1329,theory(equality)])).
% cnf(1331,negated_conjecture,($false),1330,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 205
% # ...of these trivial : 2
% # ...subsumed : 1
% # ...remaining for further processing: 202
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 8
% # Generated clauses : 548
% # ...of the previous two non-trivial : 452
% # Contextual simplify-reflections : 2
% # Paramodulations : 457
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 187
% # Positive orientable unit clauses: 15
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 169
% # Current number of unprocessed clauses: 442
% # ...number of literals in the above : 3162
% # Clause-clause subsumption calls (NU) : 864
% # Rec. Clause-clause subsumption calls : 167
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 223 leaves, 1.36+/-1.159 terms/leaf
% # Paramod-from index: 98 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 188 leaves, 1.25+/-1.003 terms/leaf
% # -------------------------------------------------
% # User time : 0.066 s
% # System time : 0.005 s
% # Total time : 0.071 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.17 CPU 0.26 WC
% FINAL PrfWatch: 0.17 CPU 0.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP23378/SWC369+1.tptp
%
%------------------------------------------------------------------------------