TSTP Solution File: SWC217+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC217+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 : art01.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 07:24:45 EST 2010
% Result : Theorem 1.47s
% Output : Solution 1.47s
% 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/SystemOnTPTP15978/SWC217+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15978/SWC217+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15978/SWC217+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 16074
% 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(3, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(5, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(9, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>~(nil=cons(X2,X1)))),file('/tmp/SRASS.s.p', ax21)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((((~(X2=X4)|~(X1=X3))|~(neq(X2,nil)))|neq(X1,nil))|(~(nil=X3)&nil=X4))|(![X5]:(ssItem(X5)=>(~(cons(X5,nil)=X3)|~(memberP(X4,X5))))&neq(X4,nil))))))),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)))|neq(X1,nil))|(~(nil=X3)&nil=X4))|(![X5]:(ssItem(X5)=>(~(cons(X5,nil)=X3)|~(memberP(X4,X5))))&neq(X4,nil)))))))),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)))|neq(X1,nil))|(~(nil=X3)&nil=X4))|(![X5]:(ssItem(X5)=>(~(cons(X5,nil)=X3)|~(memberP(X4,X5))))&neq(X4,nil)))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(115, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[3])).
% fof(116, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[115])).
% fof(117, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[116])).
% fof(118, plain,![X3]:![X4]:((((~(neq(X3,X4))|~(X3=X4))|~(ssList(X4)))|~(ssList(X3)))&(((X3=X4|neq(X3,X4))|~(ssList(X4)))|~(ssList(X3)))),inference(distribute,[status(thm)],[117])).
% cnf(119,plain,(neq(X1,X2)|X1=X2|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[118])).
% cnf(125,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[5])).
% fof(143, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|~(nil=cons(X2,X1)))),inference(fof_nnf,[status(thm)],[9])).
% fof(144, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|~(nil=cons(X4,X3)))),inference(variable_rename,[status(thm)],[143])).
% fof(145, plain,![X3]:![X4]:((~(ssItem(X4))|~(nil=cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[144])).
% cnf(146,plain,(~ssList(X1)|nil!=cons(X2,X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[145])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((((X2=X4&X1=X3)&neq(X2,nil))&~(neq(X1,nil)))&(nil=X3|~(nil=X4)))&(?[X5]:(ssItem(X5)&(cons(X5,nil)=X3&memberP(X4,X5)))|~(neq(X4,nil)))))))),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)&neq(X7,nil))&~(neq(X6,nil)))&(nil=X8|~(nil=X9)))&(?[X10]:(ssItem(X10)&(cons(X10,nil)=X8&memberP(X9,X10)))|~(neq(X9,nil)))))))),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))&~(neq(esk48_0,nil)))&(nil=esk50_0|~(nil=esk51_0)))&((ssItem(esk52_0)&(cons(esk52_0,nil)=esk50_0&memberP(esk51_0,esk52_0)))|~(neq(esk51_0,nil)))))))),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))&~(neq(esk48_0,nil)))&(nil=esk50_0|~(nil=esk51_0)))&((ssItem(esk52_0)|~(neq(esk51_0,nil)))&((cons(esk52_0,nil)=esk50_0|~(neq(esk51_0,nil)))&(memberP(esk51_0,esk52_0)|~(neq(esk51_0,nil)))))))))),inference(distribute,[status(thm)],[570])).
% cnf(573,negated_conjecture,(cons(esk52_0,nil)=esk50_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(574,negated_conjecture,(ssItem(esk52_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(576,negated_conjecture,(~neq(esk48_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(583,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(584,negated_conjecture,(~neq(esk50_0,nil)),inference(rw,[status(thm)],[576,578,theory(equality)])).
% cnf(585,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[583,578,theory(equality)])).
% cnf(589,negated_conjecture,(neq(esk51_0,nil)),inference(rw,[status(thm)],[577,579,theory(equality)])).
% cnf(590,negated_conjecture,(ssItem(esk52_0)|$false),inference(rw,[status(thm)],[574,589,theory(equality)])).
% cnf(591,negated_conjecture,(ssItem(esk52_0)),inference(cn,[status(thm)],[590,theory(equality)])).
% cnf(592,negated_conjecture,(cons(esk52_0,nil)=esk50_0|$false),inference(rw,[status(thm)],[573,589,theory(equality)])).
% cnf(593,negated_conjecture,(cons(esk52_0,nil)=esk50_0),inference(cn,[status(thm)],[592,theory(equality)])).
% cnf(596,negated_conjecture,(esk50_0!=nil|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[146,593,theory(equality)])).
% cnf(597,negated_conjecture,(esk50_0!=nil|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[596,125,theory(equality)])).
% cnf(598,negated_conjecture,(esk50_0!=nil|$false|$false),inference(rw,[status(thm)],[597,591,theory(equality)])).
% cnf(599,negated_conjecture,(esk50_0!=nil),inference(cn,[status(thm)],[598,theory(equality)])).
% cnf(702,negated_conjecture,(esk50_0=nil|~ssList(nil)|~ssList(esk50_0)),inference(spm,[status(thm)],[584,119,theory(equality)])).
% cnf(703,negated_conjecture,(esk50_0=nil|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[702,125,theory(equality)])).
% cnf(704,negated_conjecture,(esk50_0=nil|$false|$false),inference(rw,[status(thm)],[703,585,theory(equality)])).
% cnf(705,negated_conjecture,(esk50_0=nil),inference(cn,[status(thm)],[704,theory(equality)])).
% cnf(1468,negated_conjecture,($false),inference(sr,[status(thm)],[705,599,theory(equality)])).
% cnf(1469,negated_conjecture,($false),1468,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 203
% # ...of these trivial : 2
% # ...subsumed : 2
% # ...remaining for further processing: 199
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 583
% # ...of the previous two non-trivial : 481
% # Contextual simplify-reflections : 2
% # Paramodulations : 492
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 192
% # Positive orientable unit clauses: 18
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 170
% # Current number of unprocessed clauses: 478
% # ...number of literals in the above : 3305
% # Clause-clause subsumption calls (NU) : 842
% # Rec. Clause-clause subsumption calls : 156
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 229 leaves, 1.35+/-1.145 terms/leaf
% # Paramod-from index: 101 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 194 leaves, 1.24+/-0.987 terms/leaf
% # -------------------------------------------------
% # User time : 0.069 s
% # System time : 0.003 s
% # Total time : 0.072 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.20 CPU 0.26 WC
% FINAL PrfWatch: 0.20 CPU 0.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP15978/SWC217+1.tptp
%
%------------------------------------------------------------------------------