TSTP Solution File: SWC009+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC009+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 : art05.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:49:32 EST 2010
% Result : Theorem 1.34s
% Output : Solution 1.34s
% 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/SystemOnTPTP13815/SWC009+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13815/SWC009+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13815/SWC009+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 13911
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(19, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>app(app(X1,X2),X3)=app(X1,app(X2,X3))))),file('/tmp/SRASS.s.p', ax82)).
% fof(21, axiom,![X1]:(ssList(X1)=>app(X1,nil)=X1),file('/tmp/SRASS.s.p', ax84)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X5,X6),X7)=X2)&app(X5,X7)=X1))))|![X8]:(ssList(X8)=>((~(app(X3,X8)=X4)|~(strictorderedP(X3)))|?[X9]:(ssItem(X9)&?[X10]:((ssList(X10)&app(cons(X9,nil),X10)=X8)&?[X11]:(ssItem(X11)&?[X12]:((ssList(X12)&app(X12,cons(X11,nil))=X3)<(X11,X9))))))))|(~(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)=>((((~(X2=X4)|~(X1=X3))|?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X5,X6),X7)=X2)&app(X5,X7)=X1))))|![X8]:(ssList(X8)=>((~(app(X3,X8)=X4)|~(strictorderedP(X3)))|?[X9]:(ssItem(X9)&?[X10]:((ssList(X10)&app(cons(X9,nil),X10)=X8)&?[X11]:(ssItem(X11)&?[X12]:((ssList(X12)&app(X12,cons(X11,nil))=X3)<(X11,X9))))))))|(~(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)=>((((~(X2=X4)|~(X1=X3))|?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X5,X6),X7)=X2)&app(X5,X7)=X1))))|![X8]:(ssList(X8)=>((~(app(X3,X8)=X4)|~(strictorderedP(X3)))|?[X9]:(ssItem(X9)&?[X10]:((ssList(X10)&app(cons(X9,nil),X10)=X8)&?[X11]:(ssItem(X11)&?[X12]:((ssList(X12)&app(X12,cons(X11,nil))=X3)<(X11,X9))))))))|(~(nil=X4)&nil=X3))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% cnf(126,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[4])).
% fof(183, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|app(app(X1,X2),X3)=app(X1,app(X2,X3))))),inference(fof_nnf,[status(thm)],[19])).
% fof(184, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|app(app(X4,X5),X6)=app(X4,app(X5,X6))))),inference(variable_rename,[status(thm)],[183])).
% fof(185, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|app(app(X4,X5),X6)=app(X4,app(X5,X6)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[184])).
% cnf(186,plain,(app(app(X1,X2),X3)=app(X1,app(X2,X3))|~ssList(X1)|~ssList(X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[185])).
% fof(194, plain,![X1]:(~(ssList(X1))|app(X1,nil)=X1),inference(fof_nnf,[status(thm)],[21])).
% fof(195, plain,![X2]:(~(ssList(X2))|app(X2,nil)=X2),inference(variable_rename,[status(thm)],[194])).
% cnf(196,plain,(app(X1,nil)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[195])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((X2=X4&X1=X3)&![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|![X7]:((~(ssList(X7))|~(app(app(X5,X6),X7)=X2))|~(app(X5,X7)=X1)))))&?[X8]:(ssList(X8)&((app(X3,X8)=X4&strictorderedP(X3))&![X9]:(~(ssItem(X9))|![X10]:((~(ssList(X10))|~(app(cons(X9,nil),X10)=X8))|![X11]:(~(ssItem(X11))|![X12]:((~(ssList(X12))|~(app(X12,cons(X11,nil))=X3))|~(lt(X11,X9)))))))))&(nil=X4|~(nil=X3))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X13]:(ssList(X13)&?[X14]:(ssList(X14)&?[X15]:(ssList(X15)&?[X16]:(ssList(X16)&((((X14=X16&X13=X15)&![X17]:(~(ssList(X17))|![X18]:(~(ssList(X18))|![X19]:((~(ssList(X19))|~(app(app(X17,X18),X19)=X14))|~(app(X17,X19)=X13)))))&?[X20]:(ssList(X20)&((app(X15,X20)=X16&strictorderedP(X15))&![X21]:(~(ssItem(X21))|![X22]:((~(ssList(X22))|~(app(cons(X21,nil),X22)=X20))|![X23]:(~(ssItem(X23))|![X24]:((~(ssList(X24))|~(app(X24,cons(X23,nil))=X15))|~(lt(X23,X21)))))))))&(nil=X16|~(nil=X15))))))),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)&![X17]:(~(ssList(X17))|![X18]:(~(ssList(X18))|![X19]:((~(ssList(X19))|~(app(app(X17,X18),X19)=esk49_0))|~(app(X17,X19)=esk48_0)))))&(ssList(esk52_0)&((app(esk50_0,esk52_0)=esk51_0&strictorderedP(esk50_0))&![X21]:(~(ssItem(X21))|![X22]:((~(ssList(X22))|~(app(cons(X21,nil),X22)=esk52_0))|![X23]:(~(ssItem(X23))|![X24]:((~(ssList(X24))|~(app(X24,cons(X23,nil))=esk50_0))|~(lt(X23,X21)))))))))&(nil=esk51_0|~(nil=esk50_0))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X17]:![X18]:![X19]:![X21]:![X22]:![X23]:![X24]:(((((((((((((~(ssList(X24))|~(app(X24,cons(X23,nil))=esk50_0))|~(lt(X23,X21)))|~(ssItem(X23)))|(~(ssList(X22))|~(app(cons(X21,nil),X22)=esk52_0)))|~(ssItem(X21)))&(app(esk50_0,esk52_0)=esk51_0&strictorderedP(esk50_0)))&ssList(esk52_0))&(((((~(ssList(X19))|~(app(app(X17,X18),X19)=esk49_0))|~(app(X17,X19)=esk48_0))|~(ssList(X18)))|~(ssList(X17)))&(esk49_0=esk51_0&esk48_0=esk50_0)))&(nil=esk51_0|~(nil=esk50_0)))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% cnf(572,negated_conjecture,(ssList(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(579,negated_conjecture,(~ssList(X1)|~ssList(X2)|app(X1,X3)!=esk48_0|app(app(X1,X2),X3)!=esk49_0|~ssList(X3)),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(ssList(esk52_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(582,negated_conjecture,(app(esk50_0,esk52_0)=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(584,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[572,577,theory(equality)])).
% cnf(668,negated_conjecture,(app(X1,X3)!=esk50_0|app(app(X1,X2),X3)!=esk49_0|~ssList(X3)|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[579,577,theory(equality)])).
% cnf(669,negated_conjecture,(app(X1,X3)!=esk50_0|app(app(X1,X2),X3)!=esk51_0|~ssList(X3)|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[668,578,theory(equality)])).
% cnf(673,negated_conjecture,(app(app(X1,X2),nil)!=esk51_0|X1!=esk50_0|~ssList(nil)|~ssList(X2)|~ssList(X1)),inference(spm,[status(thm)],[669,196,theory(equality)])).
% cnf(679,negated_conjecture,(app(app(X1,X2),nil)!=esk51_0|X1!=esk50_0|$false|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[673,126,theory(equality)])).
% cnf(680,negated_conjecture,(app(app(X1,X2),nil)!=esk51_0|X1!=esk50_0|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[679,theory(equality)])).
% cnf(913,negated_conjecture,(app(esk51_0,X1)=app(esk50_0,app(esk52_0,X1))|~ssList(X1)|~ssList(esk52_0)|~ssList(esk50_0)),inference(spm,[status(thm)],[186,582,theory(equality)])).
% cnf(920,negated_conjecture,(app(esk51_0,X1)=app(esk50_0,app(esk52_0,X1))|~ssList(X1)|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[913,580,theory(equality)])).
% cnf(921,negated_conjecture,(app(esk51_0,X1)=app(esk50_0,app(esk52_0,X1))|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[920,584,theory(equality)])).
% cnf(922,negated_conjecture,(app(esk51_0,X1)=app(esk50_0,app(esk52_0,X1))|~ssList(X1)),inference(cn,[status(thm)],[921,theory(equality)])).
% cnf(1907,negated_conjecture,(app(esk50_0,esk52_0)=app(esk51_0,nil)|~ssList(nil)|~ssList(esk52_0)),inference(spm,[status(thm)],[922,196,theory(equality)])).
% cnf(1938,negated_conjecture,(esk51_0=app(esk51_0,nil)|~ssList(nil)|~ssList(esk52_0)),inference(rw,[status(thm)],[1907,582,theory(equality)])).
% cnf(1939,negated_conjecture,(esk51_0=app(esk51_0,nil)|$false|~ssList(esk52_0)),inference(rw,[status(thm)],[1938,126,theory(equality)])).
% cnf(1940,negated_conjecture,(esk51_0=app(esk51_0,nil)|$false|$false),inference(rw,[status(thm)],[1939,580,theory(equality)])).
% cnf(1941,negated_conjecture,(esk51_0=app(esk51_0,nil)),inference(cn,[status(thm)],[1940,theory(equality)])).
% cnf(2955,negated_conjecture,(app(app(esk50_0,X1),nil)!=esk51_0|~ssList(X1)|~ssList(esk50_0)),inference(er,[status(thm)],[680,theory(equality)])).
% cnf(2956,negated_conjecture,(app(app(esk50_0,X1),nil)!=esk51_0|~ssList(X1)|$false),inference(rw,[status(thm)],[2955,584,theory(equality)])).
% cnf(2957,negated_conjecture,(app(app(esk50_0,X1),nil)!=esk51_0|~ssList(X1)),inference(cn,[status(thm)],[2956,theory(equality)])).
% cnf(2959,negated_conjecture,(app(esk51_0,nil)!=esk51_0|~ssList(esk52_0)),inference(spm,[status(thm)],[2957,582,theory(equality)])).
% cnf(2966,negated_conjecture,($false|~ssList(esk52_0)),inference(rw,[status(thm)],[2959,1941,theory(equality)])).
% cnf(2967,negated_conjecture,($false|$false),inference(rw,[status(thm)],[2966,580,theory(equality)])).
% cnf(2968,negated_conjecture,($false),inference(cn,[status(thm)],[2967,theory(equality)])).
% cnf(2969,negated_conjecture,($false),2968,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 366
% # ...of these trivial : 3
% # ...subsumed : 48
% # ...remaining for further processing: 315
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 7
% # Backward-rewritten : 16
% # Generated clauses : 1075
% # ...of the previous two non-trivial : 877
% # Contextual simplify-reflections : 31
% # Paramodulations : 980
% # Factorizations : 0
% # Equation resolutions : 95
% # Current number of processed clauses: 286
% # Positive orientable unit clauses: 31
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 251
% # Current number of unprocessed clauses: 609
% # ...number of literals in the above : 4111
% # Clause-clause subsumption calls (NU) : 2047
% # Rec. Clause-clause subsumption calls : 881
% # Unit Clause-clause subsumption calls : 63
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 8
% # Indexed BW rewrite successes : 8
% # Backwards rewriting index: 301 leaves, 1.28+/-1.029 terms/leaf
% # Paramod-from index: 138 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 257 leaves, 1.18+/-0.865 terms/leaf
% # -------------------------------------------------
% # User time : 0.097 s
% # System time : 0.007 s
% # Total time : 0.104 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.24 CPU 0.31 WC
% FINAL PrfWatch: 0.24 CPU 0.31 WC
% SZS output end Solution for /tmp/SystemOnTPTP13815/SWC009+1.tptp
%
%------------------------------------------------------------------------------