TSTP Solution File: SWC037+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC037+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 : 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 : Thu Dec 30 06:53:28 EST 2010
% Result : Theorem 1.29s
% Output : Solution 1.29s
% 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/SystemOnTPTP14663/SWC037+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14663/SWC037+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14663/SWC037+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 14759
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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(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)=>((((~(nil=X2)|~(X2=X4))|~(X1=X3))|nil=X1)|(![X5]:(ssList(X5)=>((~(neq(X5,nil))|~(segmentP(X4,X5)))|~(segmentP(X3,X5))))&(~(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)=>((((~(nil=X2)|~(X2=X4))|~(X1=X3))|nil=X1)|(![X5]:(ssList(X5)=>((~(neq(X5,nil))|~(segmentP(X4,X5)))|~(segmentP(X3,X5))))&(~(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)=>((((~(nil=X2)|~(X2=X4))|~(X1=X3))|nil=X1)|(![X5]:(ssList(X5)=>((~(neq(X5,nil))|~(segmentP(X4,X5)))|~(segmentP(X3,X5))))&(~(nil=X4)|~(nil=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(109,plain,(~ssList(X1)|~ssList(X2)|X1!=X2|~neq(X1,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(129,plain,(nil=X1|~ssList(X1)|~segmentP(nil,X1)),inference(split_conjunct,[status(thm)],[127])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((nil=X2&X2=X4)&X1=X3)&~(nil=X1))&(?[X5]:(ssList(X5)&((neq(X5,nil)&segmentP(X4,X5))&segmentP(X3,X5)))|(nil=X4&nil=X3))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X6]:(ssList(X6)&?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&((((nil=X7&X7=X9)&X6=X8)&~(nil=X6))&(?[X10]:(ssList(X10)&((neq(X10,nil)&segmentP(X9,X10))&segmentP(X8,X10)))|(nil=X9&nil=X8))))))),inference(variable_rename,[status(thm)],[568])).
% fof(570, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&((((nil=esk49_0&esk49_0=esk51_0)&esk48_0=esk50_0)&~(nil=esk48_0))&((ssList(esk52_0)&((neq(esk52_0,nil)&segmentP(esk51_0,esk52_0))&segmentP(esk50_0,esk52_0)))|(nil=esk51_0&nil=esk50_0))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&((((nil=esk49_0&esk49_0=esk51_0)&esk48_0=esk50_0)&~(nil=esk48_0))&(((nil=esk51_0|ssList(esk52_0))&(nil=esk50_0|ssList(esk52_0)))&((((nil=esk51_0|neq(esk52_0,nil))&(nil=esk50_0|neq(esk52_0,nil)))&((nil=esk51_0|segmentP(esk51_0,esk52_0))&(nil=esk50_0|segmentP(esk51_0,esk52_0))))&((nil=esk51_0|segmentP(esk50_0,esk52_0))&(nil=esk50_0|segmentP(esk50_0,esk52_0)))))))))),inference(distribute,[status(thm)],[570])).
% cnf(574,negated_conjecture,(segmentP(esk51_0,esk52_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(576,negated_conjecture,(neq(esk52_0,nil)|nil=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(ssList(esk52_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(nil!=esk48_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(581,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(582,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(583,negated_conjecture,(nil=esk49_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(588,negated_conjecture,(esk50_0!=nil),inference(rw,[status(thm)],[580,581,theory(equality)])).
% cnf(589,negated_conjecture,(esk51_0=nil),inference(rw,[status(thm)],[582,583,theory(equality)])).
% cnf(595,negated_conjecture,(esk50_0=nil|segmentP(nil,esk52_0)),inference(rw,[status(thm)],[574,589,theory(equality)])).
% cnf(611,plain,(~neq(X1,X1)|~ssList(X1)),inference(er,[status(thm)],[109,theory(equality)])).
% cnf(1344,negated_conjecture,(ssList(esk52_0)),inference(sr,[status(thm)],[578,588,theory(equality)])).
% cnf(1345,negated_conjecture,(neq(esk52_0,nil)),inference(sr,[status(thm)],[576,588,theory(equality)])).
% cnf(1347,negated_conjecture,(segmentP(nil,esk52_0)),inference(sr,[status(thm)],[595,588,theory(equality)])).
% cnf(1405,negated_conjecture,(nil=esk52_0|~ssList(esk52_0)),inference(spm,[status(thm)],[129,1347,theory(equality)])).
% cnf(1424,negated_conjecture,(nil=esk52_0|$false),inference(rw,[status(thm)],[1405,1344,theory(equality)])).
% cnf(1425,negated_conjecture,(nil=esk52_0),inference(cn,[status(thm)],[1424,theory(equality)])).
% cnf(1431,negated_conjecture,(neq(nil,nil)),inference(rw,[status(thm)],[1345,1425,theory(equality)])).
% cnf(1609,negated_conjecture,(~ssList(nil)),inference(spm,[status(thm)],[611,1431,theory(equality)])).
% cnf(1610,negated_conjecture,($false),inference(rw,[status(thm)],[1609,110,theory(equality)])).
% cnf(1611,negated_conjecture,($false),inference(cn,[status(thm)],[1610,theory(equality)])).
% cnf(1612,negated_conjecture,($false),1611,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 231
% # ...of these trivial : 7
% # ...subsumed : 3
% # ...remaining for further processing: 221
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 10
% # Generated clauses : 625
% # ...of the previous two non-trivial : 519
% # Contextual simplify-reflections : 2
% # Paramodulations : 530
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 201
% # Positive orientable unit clauses: 27
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 170
% # Current number of unprocessed clauses: 448
% # ...number of literals in the above : 3186
% # Clause-clause subsumption calls (NU) : 867
% # Rec. Clause-clause subsumption calls : 170
% # Unit Clause-clause subsumption calls : 23
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 240 leaves, 1.34+/-1.121 terms/leaf
% # Paramod-from index: 110 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 205 leaves, 1.23+/-0.965 terms/leaf
% # -------------------------------------------------
% # User time : 0.068 s
% # System time : 0.005 s
% # Total time : 0.073 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.20 CPU 0.26 WC
% FINAL PrfWatch: 0.20 CPU 0.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP14663/SWC037+1.tptp
%
%------------------------------------------------------------------------------