TSTP Solution File: SWC023+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC023+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:51:43 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/SystemOnTPTP14145/SWC023+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14145/SWC023+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14145/SWC023+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 14241
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.033 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(6, axiom,![X1]:(ssList(X1)=>frontsegP(X1,nil)),file('/tmp/SRASS.s.p', ax45)).
% fof(7, 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)=>((((~(X2=X4)|~(X1=X3))|~(neq(X2,nil)))|?[X5]:(((ssList(X5)&neq(X5,nil))&frontsegP(X2,X5))&frontsegP(X1,X5)))|(![X6]:(ssList(X6)=>((~(neq(X6,nil))|~(frontsegP(X4,X6)))|~(frontsegP(X3,X6))))&(~(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))|~(neq(X2,nil)))|?[X5]:(((ssList(X5)&neq(X5,nil))&frontsegP(X2,X5))&frontsegP(X1,X5)))|(![X6]:(ssList(X6)=>((~(neq(X6,nil))|~(frontsegP(X4,X6)))|~(frontsegP(X3,X6))))&(~(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))|~(neq(X2,nil)))|?[X5]:(((ssList(X5)&neq(X5,nil))&frontsegP(X2,X5))&frontsegP(X1,X5)))|(![X6]:(ssList(X6)=>((~(neq(X6,nil))|~(frontsegP(X4,X6)))|~(frontsegP(X3,X6))))&(~(nil=X4)|~(nil=X3))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% cnf(110,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[2])).
% fof(122, plain,![X1]:(~(ssList(X1))|frontsegP(X1,nil)),inference(fof_nnf,[status(thm)],[6])).
% fof(123, plain,![X2]:(~(ssList(X2))|frontsegP(X2,nil)),inference(variable_rename,[status(thm)],[122])).
% cnf(124,plain,(frontsegP(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[123])).
% fof(125, plain,![X1]:(~(ssList(X1))|((~(frontsegP(nil,X1))|nil=X1)&(~(nil=X1)|frontsegP(nil,X1)))),inference(fof_nnf,[status(thm)],[7])).
% fof(126, plain,![X2]:(~(ssList(X2))|((~(frontsegP(nil,X2))|nil=X2)&(~(nil=X2)|frontsegP(nil,X2)))),inference(variable_rename,[status(thm)],[125])).
% fof(127, plain,![X2]:(((~(frontsegP(nil,X2))|nil=X2)|~(ssList(X2)))&((~(nil=X2)|frontsegP(nil,X2))|~(ssList(X2)))),inference(distribute,[status(thm)],[126])).
% cnf(129,plain,(nil=X1|~ssList(X1)|~frontsegP(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)&neq(X2,nil))&![X5]:(((~(ssList(X5))|~(neq(X5,nil)))|~(frontsegP(X2,X5)))|~(frontsegP(X1,X5))))&(?[X6]:(ssList(X6)&((neq(X6,nil)&frontsegP(X4,X6))&frontsegP(X3,X6)))|(nil=X4&nil=X3))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&((((X8=X10&X7=X9)&neq(X8,nil))&![X11]:(((~(ssList(X11))|~(neq(X11,nil)))|~(frontsegP(X8,X11)))|~(frontsegP(X7,X11))))&(?[X12]:(ssList(X12)&((neq(X12,nil)&frontsegP(X10,X12))&frontsegP(X9,X12)))|(nil=X10&nil=X9))))))),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)&neq(esk49_0,nil))&![X11]:(((~(ssList(X11))|~(neq(X11,nil)))|~(frontsegP(esk49_0,X11)))|~(frontsegP(esk48_0,X11))))&((ssList(esk52_0)&((neq(esk52_0,nil)&frontsegP(esk51_0,esk52_0))&frontsegP(esk50_0,esk52_0)))|(nil=esk51_0&nil=esk50_0))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X11]:(((((((((~(ssList(X11))|~(neq(X11,nil)))|~(frontsegP(esk49_0,X11)))|~(frontsegP(esk48_0,X11)))&((esk49_0=esk51_0&esk48_0=esk50_0)&neq(esk49_0,nil)))&((ssList(esk52_0)&((neq(esk52_0,nil)&frontsegP(esk51_0,esk52_0))&frontsegP(esk50_0,esk52_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])).
% fof(572, negated_conjecture,![X11]:(((((((((~(ssList(X11))|~(neq(X11,nil)))|~(frontsegP(esk49_0,X11)))|~(frontsegP(esk48_0,X11)))&((esk49_0=esk51_0&esk48_0=esk50_0)&neq(esk49_0,nil)))&(((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|frontsegP(esk51_0,esk52_0))&(nil=esk50_0|frontsegP(esk51_0,esk52_0))))&((nil=esk51_0|frontsegP(esk50_0,esk52_0))&(nil=esk50_0|frontsegP(esk50_0,esk52_0))))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(573,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(574,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(577,negated_conjecture,(frontsegP(esk50_0,esk52_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(frontsegP(esk50_0,esk52_0)|nil=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(frontsegP(esk51_0,esk52_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(neq(esk52_0,nil)|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(neq(esk52_0,nil)|nil=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(ssList(esk52_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(584,negated_conjecture,(ssList(esk52_0)|nil=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(586,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(587,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(588,negated_conjecture,(~frontsegP(esk48_0,X1)|~frontsegP(esk49_0,X1)|~neq(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(589,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[573,586,theory(equality)])).
% cnf(590,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[574,587,theory(equality)])).
% cnf(593,negated_conjecture,(neq(esk51_0,nil)),inference(rw,[status(thm)],[585,587,theory(equality)])).
% cnf(597,negated_conjecture,(~ssList(X1)|~neq(X1,nil)|~frontsegP(esk50_0,X1)|~frontsegP(esk49_0,X1)),inference(rw,[status(thm)],[588,586,theory(equality)])).
% cnf(598,negated_conjecture,(~ssList(X1)|~neq(X1,nil)|~frontsegP(esk50_0,X1)|~frontsegP(esk51_0,X1)),inference(rw,[status(thm)],[597,587,theory(equality)])).
% cnf(599,negated_conjecture,(~frontsegP(esk51_0,nil)|~neq(nil,nil)|~ssList(nil)|~ssList(esk50_0)),inference(spm,[status(thm)],[598,124,theory(equality)])).
% cnf(601,negated_conjecture,(esk50_0=nil|~frontsegP(esk51_0,esk52_0)|~neq(esk52_0,nil)|~ssList(esk52_0)),inference(spm,[status(thm)],[598,577,theory(equality)])).
% cnf(603,negated_conjecture,(~frontsegP(esk51_0,nil)|~neq(nil,nil)|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[599,110,theory(equality)])).
% cnf(604,negated_conjecture,(~frontsegP(esk51_0,nil)|~neq(nil,nil)|$false|$false),inference(rw,[status(thm)],[603,589,theory(equality)])).
% cnf(605,negated_conjecture,(~frontsegP(esk51_0,nil)|~neq(nil,nil)),inference(cn,[status(thm)],[604,theory(equality)])).
% cnf(1384,negated_conjecture,(~neq(nil,nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[605,124,theory(equality)])).
% cnf(1385,negated_conjecture,(~neq(nil,nil)|$false),inference(rw,[status(thm)],[1384,590,theory(equality)])).
% cnf(1386,negated_conjecture,(~neq(nil,nil)),inference(cn,[status(thm)],[1385,theory(equality)])).
% cnf(1387,negated_conjecture,(esk50_0=nil|~frontsegP(esk51_0,esk52_0)|~neq(esk52_0,nil)),inference(csr,[status(thm)],[601,583])).
% cnf(1388,negated_conjecture,(esk50_0=nil|~frontsegP(esk51_0,esk52_0)),inference(csr,[status(thm)],[1387,581])).
% cnf(1389,negated_conjecture,(esk50_0=nil),inference(csr,[status(thm)],[1388,579])).
% cnf(1393,negated_conjecture,(esk51_0=nil|frontsegP(nil,esk52_0)),inference(rw,[status(thm)],[578,1389,theory(equality)])).
% cnf(1406,negated_conjecture,(nil=esk52_0|esk51_0=nil|~ssList(esk52_0)),inference(spm,[status(thm)],[129,1393,theory(equality)])).
% cnf(1417,negated_conjecture,(esk52_0=nil|esk51_0=nil),inference(csr,[status(thm)],[1406,584])).
% cnf(1419,negated_conjecture,(esk51_0=nil|neq(nil,nil)),inference(spm,[status(thm)],[582,1417,theory(equality)])).
% cnf(1423,negated_conjecture,(esk51_0=nil),inference(sr,[status(thm)],[1419,1386,theory(equality)])).
% cnf(1432,negated_conjecture,(neq(nil,nil)),inference(rw,[status(thm)],[593,1423,theory(equality)])).
% cnf(1433,negated_conjecture,($false),inference(sr,[status(thm)],[1432,1386,theory(equality)])).
% cnf(1434,negated_conjecture,($false),1433,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 214
% # ...of these trivial : 2
% # ...subsumed : 2
% # ...remaining for further processing: 210
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 18
% # Generated clauses : 578
% # ...of the previous two non-trivial : 479
% # Contextual simplify-reflections : 6
% # Paramodulations : 487
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 186
% # Positive orientable unit clauses: 14
% # 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 : 3163
% # Clause-clause subsumption calls (NU) : 879
% # Rec. Clause-clause subsumption calls : 183
% # Unit Clause-clause subsumption calls : 7
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 222 leaves, 1.37+/-1.233 terms/leaf
% # Paramod-from index: 97 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 187 leaves, 1.26+/-1.105 terms/leaf
% # -------------------------------------------------
% # User time : 0.066 s
% # System time : 0.008 s
% # Total time : 0.074 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.19 CPU 0.27 WC
% FINAL PrfWatch: 0.19 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP14145/SWC023+1.tptp
%
%------------------------------------------------------------------------------