TSTP Solution File: SWC020+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC020+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:51:12 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/SystemOnTPTP15110/SWC020+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15110/SWC020+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15110/SWC020+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 15206
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.031 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(5, axiom,![X1]:(ssList(X1)=>frontsegP(X1,X1)),file('/tmp/SRASS.s.p', ax42)).
% fof(6, axiom,![X1]:(ssList(X1)=>frontsegP(X1,nil)),file('/tmp/SRASS.s.p', ax45)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|?[X5]:(((ssList(X5)&neq(X5,nil))&frontsegP(X2,X5))&frontsegP(X1,X5)))|(nil=X2&nil=X1))|((~(nil=X4)|~(nil=X3))&(~(neq(X3,nil))|~(frontsegP(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))|?[X5]:(((ssList(X5)&neq(X5,nil))&frontsegP(X2,X5))&frontsegP(X1,X5)))|(nil=X2&nil=X1))|((~(nil=X4)|~(nil=X3))&(~(neq(X3,nil))|~(frontsegP(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))|?[X5]:(((ssList(X5)&neq(X5,nil))&frontsegP(X2,X5))&frontsegP(X1,X5)))|(nil=X2&nil=X1))|((~(nil=X4)|~(nil=X3))&(~(neq(X3,nil))|~(frontsegP(X4,X3)))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% cnf(110,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[2])).
% fof(119, plain,![X1]:(~(ssList(X1))|frontsegP(X1,X1)),inference(fof_nnf,[status(thm)],[5])).
% fof(120, plain,![X2]:(~(ssList(X2))|frontsegP(X2,X2)),inference(variable_rename,[status(thm)],[119])).
% cnf(121,plain,(frontsegP(X1,X1)|~ssList(X1)),inference(split_conjunct,[status(thm)],[120])).
% 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(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((X2=X4&X1=X3)&![X5]:(((~(ssList(X5))|~(neq(X5,nil)))|~(frontsegP(X2,X5)))|~(frontsegP(X1,X5))))&(~(nil=X2)|~(nil=X1)))&((nil=X4&nil=X3)|(neq(X3,nil)&frontsegP(X4,X3)))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X6]:(ssList(X6)&?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&((((X7=X9&X6=X8)&![X10]:(((~(ssList(X10))|~(neq(X10,nil)))|~(frontsegP(X7,X10)))|~(frontsegP(X6,X10))))&(~(nil=X7)|~(nil=X6)))&((nil=X9&nil=X8)|(neq(X8,nil)&frontsegP(X9,X8)))))))),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)&![X10]:(((~(ssList(X10))|~(neq(X10,nil)))|~(frontsegP(esk49_0,X10)))|~(frontsegP(esk48_0,X10))))&(~(nil=esk49_0)|~(nil=esk48_0)))&((nil=esk51_0&nil=esk50_0)|(neq(esk50_0,nil)&frontsegP(esk51_0,esk50_0)))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X10]:((((((((((~(ssList(X10))|~(neq(X10,nil)))|~(frontsegP(esk49_0,X10)))|~(frontsegP(esk48_0,X10)))&(esk49_0=esk51_0&esk48_0=esk50_0))&(~(nil=esk49_0)|~(nil=esk48_0)))&((nil=esk51_0&nil=esk50_0)|(neq(esk50_0,nil)&frontsegP(esk51_0,esk50_0))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X10]:((((((((((~(ssList(X10))|~(neq(X10,nil)))|~(frontsegP(esk49_0,X10)))|~(frontsegP(esk48_0,X10)))&(esk49_0=esk51_0&esk48_0=esk50_0))&(~(nil=esk49_0)|~(nil=esk48_0)))&(((neq(esk50_0,nil)|nil=esk51_0)&(frontsegP(esk51_0,esk50_0)|nil=esk51_0))&((neq(esk50_0,nil)|nil=esk50_0)&(frontsegP(esk51_0,esk50_0)|nil=esk50_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,(nil=esk50_0|frontsegP(esk51_0,esk50_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(nil=esk50_0|neq(esk50_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(nil=esk51_0|neq(esk50_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(nil!=esk48_0|nil!=esk49_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(584,negated_conjecture,(~frontsegP(esk48_0,X1)|~frontsegP(esk49_0,X1)|~neq(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(esk50_0!=nil|esk49_0!=nil),inference(rw,[status(thm)],[581,582,theory(equality)])).
% cnf(586,negated_conjecture,(esk50_0!=nil|esk51_0!=nil),inference(rw,[status(thm)],[585,583,theory(equality)])).
% cnf(587,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[573,582,theory(equality)])).
% cnf(588,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[574,583,theory(equality)])).
% cnf(594,negated_conjecture,(~ssList(X1)|~neq(X1,nil)|~frontsegP(esk50_0,X1)|~frontsegP(esk49_0,X1)),inference(rw,[status(thm)],[584,582,theory(equality)])).
% cnf(595,negated_conjecture,(~ssList(X1)|~neq(X1,nil)|~frontsegP(esk50_0,X1)|~frontsegP(esk51_0,X1)),inference(rw,[status(thm)],[594,583,theory(equality)])).
% cnf(596,negated_conjecture,(~frontsegP(esk51_0,nil)|~neq(nil,nil)|~ssList(nil)|~ssList(esk50_0)),inference(spm,[status(thm)],[595,124,theory(equality)])).
% cnf(597,negated_conjecture,(~frontsegP(esk51_0,esk50_0)|~neq(esk50_0,nil)|~ssList(esk50_0)),inference(spm,[status(thm)],[595,121,theory(equality)])).
% cnf(598,negated_conjecture,(~frontsegP(esk51_0,nil)|~neq(nil,nil)|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[596,110,theory(equality)])).
% cnf(599,negated_conjecture,(~frontsegP(esk51_0,nil)|~neq(nil,nil)|$false|$false),inference(rw,[status(thm)],[598,587,theory(equality)])).
% cnf(600,negated_conjecture,(~frontsegP(esk51_0,nil)|~neq(nil,nil)),inference(cn,[status(thm)],[599,theory(equality)])).
% cnf(601,negated_conjecture,(~frontsegP(esk51_0,esk50_0)|~neq(esk50_0,nil)|$false),inference(rw,[status(thm)],[597,587,theory(equality)])).
% cnf(602,negated_conjecture,(~frontsegP(esk51_0,esk50_0)|~neq(esk50_0,nil)),inference(cn,[status(thm)],[601,theory(equality)])).
% cnf(1359,negated_conjecture,(~neq(nil,nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[600,124,theory(equality)])).
% cnf(1360,negated_conjecture,(~neq(nil,nil)|$false),inference(rw,[status(thm)],[1359,588,theory(equality)])).
% cnf(1361,negated_conjecture,(~neq(nil,nil)),inference(cn,[status(thm)],[1360,theory(equality)])).
% cnf(1362,negated_conjecture,(esk50_0=nil|~neq(esk50_0,nil)),inference(spm,[status(thm)],[602,577,theory(equality)])).
% cnf(1364,negated_conjecture,(esk50_0=nil),inference(csr,[status(thm)],[1362,578])).
% cnf(1369,negated_conjecture,(esk51_0=nil|neq(nil,nil)),inference(rw,[status(thm)],[580,1364,theory(equality)])).
% cnf(1370,negated_conjecture,(esk51_0=nil),inference(sr,[status(thm)],[1369,1361,theory(equality)])).
% cnf(1376,negated_conjecture,($false|esk51_0!=nil),inference(rw,[status(thm)],[586,1364,theory(equality)])).
% cnf(1377,negated_conjecture,(esk51_0!=nil),inference(cn,[status(thm)],[1376,theory(equality)])).
% cnf(1383,negated_conjecture,($false),inference(rw,[status(thm)],[1377,1370,theory(equality)])).
% cnf(1384,negated_conjecture,($false),inference(cn,[status(thm)],[1383,theory(equality)])).
% cnf(1385,negated_conjecture,($false),1384,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 207
% # ...of these trivial : 2
% # ...subsumed : 1
% # ...remaining for further processing: 204
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 12
% # Generated clauses : 558
% # ...of the previous two non-trivial : 464
% # Contextual simplify-reflections : 3
% # Paramodulations : 467
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 185
% # Positive orientable unit clauses: 13
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 169
% # Current number of unprocessed clauses: 446
% # ...number of literals in the above : 3169
% # Clause-clause subsumption calls (NU) : 859
% # Rec. Clause-clause subsumption calls : 163
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 221 leaves, 1.37+/-1.236 terms/leaf
% # Paramod-from index: 96 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 186 leaves, 1.26+/-1.107 terms/leaf
% # -------------------------------------------------
% # User time : 0.066 s
% # System time : 0.005 s
% # Total time : 0.071 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.18 CPU 0.27 WC
% FINAL PrfWatch: 0.18 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP15110/SWC020+1.tptp
%
%------------------------------------------------------------------------------