TSTP Solution File: SWC256+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC256+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 07:29:45 EST 2010
% Result : Theorem 1.31s
% Output : Solution 1.31s
% 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/SystemOnTPTP4875/SWC256+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP4875/SWC256+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4875/SWC256+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 4971
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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)=>(singletonP(X1)<=>?[X2]:(ssItem(X2)&cons(X2,nil)=X1))),file('/tmp/SRASS.s.p', ax4)).
% fof(4, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(6, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(10, 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)))|singletonP(X1))|(![X5]:(ssItem(X5)=>(~(cons(X5,nil)=X3)|~(memberP(X4,X5))))&(~(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)))|singletonP(X1))|(![X5]:(ssItem(X5)=>(~(cons(X5,nil)=X3)|~(memberP(X4,X5))))&(~(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)))|singletonP(X1))|(![X5]:(ssItem(X5)=>(~(cons(X5,nil)=X3)|~(memberP(X4,X5))))&(~(nil=X4)|~(nil=X3))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(115, plain,![X1]:(~(ssList(X1))|((~(singletonP(X1))|?[X2]:(ssItem(X2)&cons(X2,nil)=X1))&(![X2]:(~(ssItem(X2))|~(cons(X2,nil)=X1))|singletonP(X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(116, plain,![X3]:(~(ssList(X3))|((~(singletonP(X3))|?[X4]:(ssItem(X4)&cons(X4,nil)=X3))&(![X5]:(~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3)))),inference(variable_rename,[status(thm)],[115])).
% fof(117, plain,![X3]:(~(ssList(X3))|((~(singletonP(X3))|(ssItem(esk3_1(X3))&cons(esk3_1(X3),nil)=X3))&(![X5]:(~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3)))),inference(skolemize,[status(esa)],[116])).
% fof(118, plain,![X3]:![X5]:((((~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3))&(~(singletonP(X3))|(ssItem(esk3_1(X3))&cons(esk3_1(X3),nil)=X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[117])).
% fof(119, plain,![X3]:![X5]:((((~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3))|~(ssList(X3)))&(((ssItem(esk3_1(X3))|~(singletonP(X3)))|~(ssList(X3)))&((cons(esk3_1(X3),nil)=X3|~(singletonP(X3)))|~(ssList(X3))))),inference(distribute,[status(thm)],[118])).
% cnf(122,plain,(singletonP(X1)|~ssList(X1)|cons(X2,nil)!=X1|~ssItem(X2)),inference(split_conjunct,[status(thm)],[119])).
% fof(123, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[4])).
% fof(124, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[123])).
% fof(125, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[124])).
% fof(126, 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)],[125])).
% cnf(128,plain,(~ssList(X1)|~ssList(X2)|X1!=X2|~neq(X1,X2)),inference(split_conjunct,[status(thm)],[126])).
% cnf(133,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[6])).
% fof(151, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|~(nil=cons(X2,X1)))),inference(fof_nnf,[status(thm)],[10])).
% fof(152, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|~(nil=cons(X4,X3)))),inference(variable_rename,[status(thm)],[151])).
% fof(153, plain,![X3]:![X4]:((~(ssItem(X4))|~(nil=cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[152])).
% cnf(154,plain,(~ssList(X1)|nil!=cons(X2,X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[153])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((X2=X4&X1=X3)&neq(X2,nil))&~(singletonP(X1)))&(?[X5]:(ssItem(X5)&(cons(X5,nil)=X3&memberP(X4,X5)))|(nil=X4&nil=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)&neq(X7,nil))&~(singletonP(X6)))&(?[X10]:(ssItem(X10)&(cons(X10,nil)=X8&memberP(X9,X10)))|(nil=X9&nil=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)&neq(esk49_0,nil))&~(singletonP(esk48_0)))&((ssItem(esk52_0)&(cons(esk52_0,nil)=esk50_0&memberP(esk51_0,esk52_0)))|(nil=esk51_0&nil=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))&~(singletonP(esk48_0)))&(((nil=esk51_0|ssItem(esk52_0))&(nil=esk50_0|ssItem(esk52_0)))&(((nil=esk51_0|cons(esk52_0,nil)=esk50_0)&(nil=esk50_0|cons(esk52_0,nil)=esk50_0))&((nil=esk51_0|memberP(esk51_0,esk52_0))&(nil=esk50_0|memberP(esk51_0,esk52_0)))))))))),inference(distribute,[status(thm)],[570])).
% cnf(574,negated_conjecture,(cons(esk52_0,nil)=esk50_0|nil=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(575,negated_conjecture,(cons(esk52_0,nil)=esk50_0|nil=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(576,negated_conjecture,(ssItem(esk52_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(ssItem(esk52_0)|nil=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(~singletonP(esk48_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(neq(esk49_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(586,negated_conjecture,(~singletonP(esk50_0)),inference(rw,[status(thm)],[578,580,theory(equality)])).
% cnf(587,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[585,580,theory(equality)])).
% cnf(591,negated_conjecture,(neq(esk51_0,nil)),inference(rw,[status(thm)],[579,581,theory(equality)])).
% cnf(593,negated_conjecture,(esk51_0=nil|esk50_0!=nil|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[154,575,theory(equality)])).
% cnf(596,negated_conjecture,(esk51_0=nil|esk50_0!=nil|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[593,133,theory(equality)])).
% cnf(597,negated_conjecture,(esk51_0=nil|esk50_0!=nil|~ssItem(esk52_0)),inference(cn,[status(thm)],[596,theory(equality)])).
% cnf(637,plain,(singletonP(cons(X1,nil))|~ssList(cons(X1,nil))|~ssItem(X1)),inference(er,[status(thm)],[122,theory(equality)])).
% cnf(641,plain,(~ssList(X1)|~neq(X1,X1)),inference(er,[status(thm)],[128,theory(equality)])).
% cnf(1517,negated_conjecture,(esk51_0=nil|esk50_0!=nil),inference(csr,[status(thm)],[597,577])).
% cnf(1905,negated_conjecture,(singletonP(esk50_0)|esk50_0=nil|~ssList(esk50_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[637,574,theory(equality)])).
% cnf(1910,negated_conjecture,(singletonP(esk50_0)|esk50_0=nil|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1905,587,theory(equality)])).
% cnf(1911,negated_conjecture,(singletonP(esk50_0)|esk50_0=nil|~ssItem(esk52_0)),inference(cn,[status(thm)],[1910,theory(equality)])).
% cnf(1912,negated_conjecture,(esk50_0=nil|~ssItem(esk52_0)),inference(sr,[status(thm)],[1911,586,theory(equality)])).
% cnf(1921,negated_conjecture,(esk50_0=nil),inference(csr,[status(thm)],[1912,576])).
% cnf(1959,negated_conjecture,(esk51_0=nil|$false),inference(rw,[status(thm)],[1517,1921,theory(equality)])).
% cnf(1960,negated_conjecture,(esk51_0=nil),inference(cn,[status(thm)],[1959,theory(equality)])).
% cnf(1977,negated_conjecture,(neq(nil,nil)),inference(rw,[status(thm)],[591,1960,theory(equality)])).
% cnf(1986,negated_conjecture,(~ssList(nil)),inference(spm,[status(thm)],[641,1977,theory(equality)])).
% cnf(1987,negated_conjecture,($false),inference(rw,[status(thm)],[1986,133,theory(equality)])).
% cnf(1988,negated_conjecture,($false),inference(cn,[status(thm)],[1987,theory(equality)])).
% cnf(1989,negated_conjecture,($false),1988,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 266
% # ...of these trivial : 5
% # ...subsumed : 14
% # ...remaining for further processing: 247
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 42
% # Generated clauses : 767
% # ...of the previous two non-trivial : 650
% # Contextual simplify-reflections : 34
% # Paramodulations : 676
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 198
% # Positive orientable unit clauses: 23
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 172
% # Current number of unprocessed clauses: 442
% # ...number of literals in the above : 3171
% # Clause-clause subsumption calls (NU) : 1035
% # Rec. Clause-clause subsumption calls : 305
% # Unit Clause-clause subsumption calls : 15
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 234 leaves, 1.35+/-1.134 terms/leaf
% # Paramod-from index: 107 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 199 leaves, 1.24+/-0.977 terms/leaf
% # -------------------------------------------------
% # User time : 0.079 s
% # System time : 0.004 s
% # Total time : 0.083 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.21 CPU 0.29 WC
% FINAL PrfWatch: 0.21 CPU 0.29 WC
% SZS output end Solution for /tmp/SystemOnTPTP4875/SWC256+1.tptp
%
%------------------------------------------------------------------------------