%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC367+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:57:56 EST 2010
% Result : Theorem 1.46s
% Output : Solution 1.46s
% 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/SystemOnTPTP6749/SWC367+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6749/SWC367+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6749/SWC367+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 6845
% 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(6, axiom,![X1]:(ssList(X1)=>rearsegP(X1,nil)),file('/tmp/SRASS.s.p', ax51)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(X2=X4)|~(X1=X3))|rearsegP(X2,X1))|((~(nil=X4)|~(nil=X3))&(~(neq(X3,nil))|~(rearsegP(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))|rearsegP(X2,X1))|((~(nil=X4)|~(nil=X3))&(~(neq(X3,nil))|~(rearsegP(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))|rearsegP(X2,X1))|((~(nil=X4)|~(nil=X3))&(~(neq(X3,nil))|~(rearsegP(X4,X3)))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(122, plain,![X1]:(~(ssList(X1))|rearsegP(X1,nil)),inference(fof_nnf,[status(thm)],[6])).
% fof(123, plain,![X2]:(~(ssList(X2))|rearsegP(X2,nil)),inference(variable_rename,[status(thm)],[122])).
% cnf(124,plain,(rearsegP(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[123])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((X2=X4&X1=X3)&~(rearsegP(X2,X1)))&((nil=X4&nil=X3)|(neq(X3,nil)&rearsegP(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)&~(rearsegP(X6,X5)))&((nil=X8&nil=X7)|(neq(X7,nil)&rearsegP(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)&~(rearsegP(esk49_0,esk48_0)))&((nil=esk51_0&nil=esk50_0)|(neq(esk50_0,nil)&rearsegP(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)&~(rearsegP(esk49_0,esk48_0)))&(((neq(esk50_0,nil)|nil=esk51_0)&(rearsegP(esk51_0,esk50_0)|nil=esk51_0))&((neq(esk50_0,nil)|nil=esk50_0)&(rearsegP(esk51_0,esk50_0)|nil=esk50_0)))))))),inference(distribute,[status(thm)],[570])).
% cnf(572,negated_conjecture,(nil=esk50_0|rearsegP(esk51_0,esk50_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(576,negated_conjecture,(~rearsegP(esk49_0,esk48_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(581,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(583,negated_conjecture,(~rearsegP(esk51_0,esk50_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[576,578,theory(equality)]),577,theory(equality)])).
% cnf(585,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[581,578,theory(equality)])).
% cnf(588,negated_conjecture,(esk50_0=nil),inference(sr,[status(thm)],[572,583,theory(equality)])).
% cnf(589,negated_conjecture,(~rearsegP(esk51_0,nil)),inference(rw,[status(thm)],[583,588,theory(equality)])).
% cnf(1323,negated_conjecture,(~ssList(esk51_0)),inference(spm,[status(thm)],[589,124,theory(equality)])).
% cnf(1325,negated_conjecture,($false),inference(rw,[status(thm)],[1323,585,theory(equality)])).
% cnf(1326,negated_conjecture,($false),inference(cn,[status(thm)],[1325,theory(equality)])).
% cnf(1327,negated_conjecture,($false),1326,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 201
% # ...of these trivial : 2
% # ...subsumed : 1
% # ...remaining for further processing: 198
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 546
% # ...of the previous two non-trivial : 446
% # Contextual simplify-reflections : 2
% # Paramodulations : 454
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 187
% # Positive orientable unit clauses: 14
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 170
% # Current number of unprocessed clauses: 439
% # ...number of literals in the above : 3156
% # Clause-clause subsumption calls (NU) : 851
% # Rec. Clause-clause subsumption calls : 157
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 224 leaves, 1.36+/-1.156 terms/leaf
% # Paramod-from index: 98 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 189 leaves, 1.25+/-1.001 terms/leaf
% # -------------------------------------------------
% # User time : 0.066 s
% # System time : 0.004 s
% # Total time : 0.070 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/SystemOnTPTP6749/SWC367+1.tptp
%
%------------------------------------------------------------------------------