TSTP Solution File: SWC007+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC007+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 : art06.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:13 EST 2010
% Result : Theorem 1.28s
% Output : Solution 1.28s
% 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/SystemOnTPTP5196/SWC007+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP5196/SWC007+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5196/SWC007+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 5292
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.030 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(3, axiom,![X1]:(ssList(X1)=>app(nil,X1)=X1),file('/tmp/SRASS.s.p', ax28)).
% fof(7, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(nil=app(X1,X2)<=>(nil=X2&nil=X1)))),file('/tmp/SRASS.s.p', ax83)).
% fof(8, axiom,![X1]:(ssList(X1)=>app(X1,nil)=X1),file('/tmp/SRASS.s.p', ax84)).
% fof(12, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(frontsegP(X1,X2)<=>?[X3]:(ssList(X3)&app(X2,X3)=X1)))),file('/tmp/SRASS.s.p', ax5)).
% fof(16, axiom,![X1]:(ssList(X1)=>(frontsegP(nil,X1)<=>nil=X1)),file('/tmp/SRASS.s.p', ax46)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(nil=X3)|~(X2=X4))|~(X1=X3))|?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X5,X6),X7)=X2)&app(X5,X7)=X1)))))))),file('/tmp/SRASS.s.p', co1)).
% fof(97, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(nil=X3)|~(X2=X4))|~(X1=X3))|?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X5,X6),X7)=X2)&app(X5,X7)=X1))))))))),inference(assume_negation,[status(cth)],[96])).
% cnf(103,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[1])).
% fof(108, plain,![X1]:(~(ssList(X1))|app(nil,X1)=X1),inference(fof_nnf,[status(thm)],[3])).
% fof(109, plain,![X2]:(~(ssList(X2))|app(nil,X2)=X2),inference(variable_rename,[status(thm)],[108])).
% cnf(110,plain,(app(nil,X1)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[109])).
% fof(123, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(nil=app(X1,X2))|(nil=X2&nil=X1))&((~(nil=X2)|~(nil=X1))|nil=app(X1,X2))))),inference(fof_nnf,[status(thm)],[7])).
% fof(124, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(nil=app(X3,X4))|(nil=X4&nil=X3))&((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))))),inference(variable_rename,[status(thm)],[123])).
% fof(125, plain,![X3]:![X4]:((~(ssList(X4))|((~(nil=app(X3,X4))|(nil=X4&nil=X3))&((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[124])).
% fof(126, plain,![X3]:![X4]:(((((nil=X4|~(nil=app(X3,X4)))|~(ssList(X4)))|~(ssList(X3)))&(((nil=X3|~(nil=app(X3,X4)))|~(ssList(X4)))|~(ssList(X3))))&((((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))|~(ssList(X4)))|~(ssList(X3)))),inference(distribute,[status(thm)],[125])).
% cnf(129,plain,(nil=X2|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[126])).
% fof(130, plain,![X1]:(~(ssList(X1))|app(X1,nil)=X1),inference(fof_nnf,[status(thm)],[8])).
% fof(131, plain,![X2]:(~(ssList(X2))|app(X2,nil)=X2),inference(variable_rename,[status(thm)],[130])).
% cnf(132,plain,(app(X1,nil)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[131])).
% fof(145, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(frontsegP(X1,X2))|?[X3]:(ssList(X3)&app(X2,X3)=X1))&(![X3]:(~(ssList(X3))|~(app(X2,X3)=X1))|frontsegP(X1,X2))))),inference(fof_nnf,[status(thm)],[12])).
% fof(146, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(frontsegP(X4,X5))|?[X6]:(ssList(X6)&app(X5,X6)=X4))&(![X7]:(~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))))),inference(variable_rename,[status(thm)],[145])).
% fof(147, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(frontsegP(X4,X5))|(ssList(esk1_2(X4,X5))&app(X5,esk1_2(X4,X5))=X4))&(![X7]:(~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))))),inference(skolemize,[status(esa)],[146])).
% fof(148, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))&(~(frontsegP(X4,X5))|(ssList(esk1_2(X4,X5))&app(X5,esk1_2(X4,X5))=X4)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[147])).
% fof(149, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))|~(ssList(X5)))|~(ssList(X4)))&((((ssList(esk1_2(X4,X5))|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4)))&(((app(X5,esk1_2(X4,X5))=X4|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4))))),inference(distribute,[status(thm)],[148])).
% cnf(150,plain,(app(X2,esk1_2(X1,X2))=X1|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)),inference(split_conjunct,[status(thm)],[149])).
% cnf(151,plain,(ssList(esk1_2(X1,X2))|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)),inference(split_conjunct,[status(thm)],[149])).
% fof(173, plain,![X1]:(~(ssList(X1))|((~(frontsegP(nil,X1))|nil=X1)&(~(nil=X1)|frontsegP(nil,X1)))),inference(fof_nnf,[status(thm)],[16])).
% fof(174, plain,![X2]:(~(ssList(X2))|((~(frontsegP(nil,X2))|nil=X2)&(~(nil=X2)|frontsegP(nil,X2)))),inference(variable_rename,[status(thm)],[173])).
% fof(175, plain,![X2]:(((~(frontsegP(nil,X2))|nil=X2)|~(ssList(X2)))&((~(nil=X2)|frontsegP(nil,X2))|~(ssList(X2)))),inference(distribute,[status(thm)],[174])).
% cnf(176,plain,(frontsegP(nil,X1)|~ssList(X1)|nil!=X1),inference(split_conjunct,[status(thm)],[175])).
% fof(567, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((nil=X3&X2=X4)&X1=X3)&![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|![X7]:((~(ssList(X7))|~(app(app(X5,X6),X7)=X2))|~(app(X5,X7)=X1))))))))),inference(fof_nnf,[status(thm)],[97])).
% fof(568, negated_conjecture,?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&(((nil=X10&X9=X11)&X8=X10)&![X12]:(~(ssList(X12))|![X13]:(~(ssList(X13))|![X14]:((~(ssList(X14))|~(app(app(X12,X13),X14)=X9))|~(app(X12,X14)=X8))))))))),inference(variable_rename,[status(thm)],[567])).
% fof(569, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&(((nil=esk50_0&esk49_0=esk51_0)&esk48_0=esk50_0)&![X12]:(~(ssList(X12))|![X13]:(~(ssList(X13))|![X14]:((~(ssList(X14))|~(app(app(X12,X13),X14)=esk49_0))|~(app(X12,X14)=esk48_0))))))))),inference(skolemize,[status(esa)],[568])).
% fof(570, negated_conjecture,![X12]:![X13]:![X14]:(((((((((~(ssList(X14))|~(app(app(X12,X13),X14)=esk49_0))|~(app(X12,X14)=esk48_0))|~(ssList(X13)))|~(ssList(X12)))&((nil=esk50_0&esk49_0=esk51_0)&esk48_0=esk50_0))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[569])).
% cnf(572,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(575,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(577,negated_conjecture,(nil=esk50_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(578,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)],[570])).
% cnf(579,negated_conjecture,(nil=esk48_0),inference(rw,[status(thm)],[575,577,theory(equality)])).
% cnf(583,plain,(frontsegP(nil,nil)|~ssList(nil)),inference(er,[status(thm)],[176,theory(equality)])).
% cnf(584,plain,(frontsegP(nil,nil)|$false),inference(rw,[status(thm)],[583,103,theory(equality)])).
% cnf(585,plain,(frontsegP(nil,nil)),inference(cn,[status(thm)],[584,theory(equality)])).
% cnf(611,negated_conjecture,(app(X1,X3)!=nil|app(app(X1,X2),X3)!=esk49_0|~ssList(X3)|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[578,579,theory(equality)])).
% cnf(1307,plain,(ssList(esk1_2(nil,nil))|~ssList(nil)),inference(spm,[status(thm)],[151,585,theory(equality)])).
% cnf(1308,plain,(app(nil,esk1_2(nil,nil))=nil|~ssList(nil)),inference(spm,[status(thm)],[150,585,theory(equality)])).
% cnf(1311,plain,(ssList(esk1_2(nil,nil))|$false),inference(rw,[status(thm)],[1307,103,theory(equality)])).
% cnf(1312,plain,(ssList(esk1_2(nil,nil))),inference(cn,[status(thm)],[1311,theory(equality)])).
% cnf(1313,plain,(app(nil,esk1_2(nil,nil))=nil|$false),inference(rw,[status(thm)],[1308,103,theory(equality)])).
% cnf(1314,plain,(app(nil,esk1_2(nil,nil))=nil),inference(cn,[status(thm)],[1313,theory(equality)])).
% cnf(1353,plain,(nil=esk1_2(nil,nil)|~ssList(esk1_2(nil,nil))|~ssList(nil)),inference(spm,[status(thm)],[129,1314,theory(equality)])).
% cnf(1381,plain,(nil=esk1_2(nil,nil)|$false|~ssList(nil)),inference(rw,[status(thm)],[1353,1312,theory(equality)])).
% cnf(1382,plain,(nil=esk1_2(nil,nil)|$false|$false),inference(rw,[status(thm)],[1381,103,theory(equality)])).
% cnf(1383,plain,(nil=esk1_2(nil,nil)),inference(cn,[status(thm)],[1382,theory(equality)])).
% cnf(1398,plain,(app(nil,nil)=nil),inference(rw,[status(thm)],[1314,1383,theory(equality)])).
% cnf(1408,negated_conjecture,(app(app(nil,X1),nil)!=esk49_0|~ssList(nil)|~ssList(X1)),inference(spm,[status(thm)],[611,1398,theory(equality)])).
% cnf(1428,negated_conjecture,(app(app(nil,X1),nil)!=esk49_0|$false|~ssList(X1)),inference(rw,[status(thm)],[1408,103,theory(equality)])).
% cnf(1429,negated_conjecture,(app(app(nil,X1),nil)!=esk49_0|~ssList(X1)),inference(cn,[status(thm)],[1428,theory(equality)])).
% cnf(1498,negated_conjecture,(app(X1,nil)!=esk49_0|~ssList(X1)),inference(spm,[status(thm)],[1429,110,theory(equality)])).
% cnf(1514,negated_conjecture,(X1!=esk49_0|~ssList(X1)),inference(spm,[status(thm)],[1498,132,theory(equality)])).
% cnf(1525,negated_conjecture,(~ssList(esk49_0)),inference(er,[status(thm)],[1514,theory(equality)])).
% cnf(1526,negated_conjecture,($false),inference(rw,[status(thm)],[1525,572,theory(equality)])).
% cnf(1527,negated_conjecture,($false),inference(cn,[status(thm)],[1526,theory(equality)])).
% cnf(1528,negated_conjecture,($false),1527,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 216
% # ...of these trivial : 3
% # ...subsumed : 5
% # ...remaining for further processing: 208
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 615
% # ...of the previous two non-trivial : 505
% # Contextual simplify-reflections : 2
% # Paramodulations : 523
% # Factorizations : 0
% # Equation resolutions : 92
% # Current number of processed clauses: 198
% # Positive orientable unit clauses: 22
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 173
% # Current number of unprocessed clauses: 463
% # ...number of literals in the above : 3274
% # Clause-clause subsumption calls (NU) : 895
% # Rec. Clause-clause subsumption calls : 185
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 233 leaves, 1.34+/-1.136 terms/leaf
% # Paramod-from index: 105 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 198 leaves, 1.23+/-0.978 terms/leaf
% # -------------------------------------------------
% # User time : 0.065 s
% # System time : 0.006 s
% # Total time : 0.071 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.18 CPU 0.26 WC
% FINAL PrfWatch: 0.18 CPU 0.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP5196/SWC007+1.tptp
%
%------------------------------------------------------------------------------