TSTP Solution File: SWC105+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC105+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 07:09:04 EST 2010
% Result : Theorem 1.49s
% Output : Solution 1.49s
% 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/SystemOnTPTP29960/SWC105+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29960/SWC105+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29960/SWC105+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 30092
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.029 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(7, axiom,![X1]:(ssList(X1)=>(rearsegP(nil,X1)<=>nil=X1)),file('/tmp/SRASS.s.p', ax52)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(X2=X4)|~(X1=X3))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|(neq(X1,nil)&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))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|(neq(X1,nil)&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))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|(neq(X1,nil)&rearsegP(X2,X1)))))|((~(nil=X4)|~(nil=X3))&(~(neq(X3,nil))|~(rearsegP(X4,X3)))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% cnf(110,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[2])).
% fof(125, plain,![X1]:(~(ssList(X1))|((~(rearsegP(nil,X1))|nil=X1)&(~(nil=X1)|rearsegP(nil,X1)))),inference(fof_nnf,[status(thm)],[7])).
% fof(126, plain,![X2]:(~(ssList(X2))|((~(rearsegP(nil,X2))|nil=X2)&(~(nil=X2)|rearsegP(nil,X2)))),inference(variable_rename,[status(thm)],[125])).
% fof(127, plain,![X2]:(((~(rearsegP(nil,X2))|nil=X2)|~(ssList(X2)))&((~(nil=X2)|rearsegP(nil,X2))|~(ssList(X2)))),inference(distribute,[status(thm)],[126])).
% cnf(128,plain,(rearsegP(nil,X1)|~ssList(X1)|nil!=X1),inference(split_conjunct,[status(thm)],[127])).
% cnf(129,plain,(nil=X1|~ssList(X1)|~rearsegP(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)&((nil=X2&~(nil=X1))|(neq(X2,nil)&(~(neq(X1,nil))|~(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)&((nil=X6&~(nil=X5))|(neq(X6,nil)&(~(neq(X5,nil))|~(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)&((nil=esk49_0&~(nil=esk48_0))|(neq(esk49_0,nil)&(~(neq(esk48_0,nil))|~(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)&(((neq(esk49_0,nil)|nil=esk49_0)&((~(neq(esk48_0,nil))|~(rearsegP(esk49_0,esk48_0)))|nil=esk49_0))&((neq(esk49_0,nil)|~(nil=esk48_0))&((~(neq(esk48_0,nil))|~(rearsegP(esk49_0,esk48_0)))|~(nil=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(574,negated_conjecture,(nil=esk51_0|rearsegP(esk51_0,esk50_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(575,negated_conjecture,(nil=esk51_0|neq(esk50_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(576,negated_conjecture,(nil!=esk48_0|~rearsegP(esk49_0,esk48_0)|~neq(esk48_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(neq(esk49_0,nil)|nil!=esk48_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(nil=esk49_0|~rearsegP(esk49_0,esk48_0)|~neq(esk48_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(581,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(585,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(590,negated_conjecture,(esk48_0=nil|rearsegP(esk51_0,esk50_0)),inference(rw,[status(thm)],[572,580,theory(equality)])).
% cnf(591,negated_conjecture,(esk48_0=nil|rearsegP(esk49_0,esk48_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[590,581,theory(equality)]),580,theory(equality)])).
% cnf(592,negated_conjecture,(esk49_0=nil|neq(esk50_0,nil)),inference(rw,[status(thm)],[575,581,theory(equality)])).
% cnf(593,negated_conjecture,(esk49_0=nil|neq(esk48_0,nil)),inference(rw,[status(thm)],[592,580,theory(equality)])).
% cnf(594,negated_conjecture,(esk49_0=nil|rearsegP(esk51_0,esk50_0)),inference(rw,[status(thm)],[574,581,theory(equality)])).
% cnf(595,negated_conjecture,(esk49_0=nil|rearsegP(esk49_0,esk48_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[594,581,theory(equality)]),580,theory(equality)])).
% cnf(596,negated_conjecture,(esk49_0=nil|~neq(esk48_0,nil)),inference(csr,[status(thm)],[578,595])).
% cnf(597,negated_conjecture,(esk49_0=nil),inference(csr,[status(thm)],[596,593])).
% cnf(598,negated_conjecture,(esk48_0!=nil|~rearsegP(nil,esk48_0)|~neq(esk48_0,nil)),inference(rw,[status(thm)],[576,597,theory(equality)])).
% cnf(599,negated_conjecture,(neq(nil,nil)|esk48_0!=nil),inference(rw,[status(thm)],[577,597,theory(equality)])).
% cnf(603,negated_conjecture,(esk48_0=nil|rearsegP(nil,esk48_0)),inference(rw,[status(thm)],[591,597,theory(equality)])).
% cnf(608,plain,(rearsegP(nil,nil)|~ssList(nil)),inference(er,[status(thm)],[128,theory(equality)])).
% cnf(609,plain,(rearsegP(nil,nil)|$false),inference(rw,[status(thm)],[608,110,theory(equality)])).
% cnf(610,plain,(rearsegP(nil,nil)),inference(cn,[status(thm)],[609,theory(equality)])).
% cnf(1332,negated_conjecture,(nil=esk48_0|~ssList(esk48_0)),inference(spm,[status(thm)],[129,603,theory(equality)])).
% cnf(1348,negated_conjecture,(nil=esk48_0|$false),inference(rw,[status(thm)],[1332,585,theory(equality)])).
% cnf(1349,negated_conjecture,(nil=esk48_0),inference(cn,[status(thm)],[1348,theory(equality)])).
% cnf(1350,negated_conjecture,(neq(nil,nil)|$false),inference(rw,[status(thm)],[599,1349,theory(equality)])).
% cnf(1351,negated_conjecture,(neq(nil,nil)),inference(cn,[status(thm)],[1350,theory(equality)])).
% cnf(1358,negated_conjecture,($false|~rearsegP(nil,esk48_0)|~neq(esk48_0,nil)),inference(rw,[status(thm)],[598,1349,theory(equality)])).
% cnf(1359,negated_conjecture,($false|$false|~neq(esk48_0,nil)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1358,1349,theory(equality)]),610,theory(equality)])).
% cnf(1360,negated_conjecture,($false|$false|~neq(nil,nil)),inference(rw,[status(thm)],[1359,1349,theory(equality)])).
% cnf(1361,negated_conjecture,(~neq(nil,nil)),inference(cn,[status(thm)],[1360,theory(equality)])).
% cnf(1362,negated_conjecture,($false),inference(sr,[status(thm)],[1351,1361,theory(equality)])).
% cnf(1363,negated_conjecture,($false),1362,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 210
% # ...of these trivial : 2
% # ...subsumed : 1
% # ...remaining for further processing: 207
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 13
% # Generated clauses : 549
% # ...of the previous two non-trivial : 453
% # Contextual simplify-reflections : 4
% # Paramodulations : 458
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 187
% # Positive orientable unit clauses: 15
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 169
% # Current number of unprocessed clauses: 440
% # ...number of literals in the above : 3158
% # Clause-clause subsumption calls (NU) : 865
% # Rec. Clause-clause subsumption calls : 171
% # 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: 223 leaves, 1.36+/-1.159 terms/leaf
% # Paramod-from index: 98 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 188 leaves, 1.25+/-1.003 terms/leaf
% # -------------------------------------------------
% # User time : 0.058 s
% # System time : 0.007 s
% # Total time : 0.065 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.18 CPU 0.25 WC
% FINAL PrfWatch: 0.18 CPU 0.25 WC
% SZS output end Solution for /tmp/SystemOnTPTP29960/SWC105+1.tptp
%
%------------------------------------------------------------------------------