TSTP Solution File: SWC387+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC387+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 08:01:19 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/SystemOnTPTP30878/SWC387+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30878/SWC387+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30878/SWC387+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 30974
% 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(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(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((((~(X2=X4)|~(X1=X3))|?[X5]:((ssItem(X5)&cons(X5,nil)=X1)&memberP(X2,X5)))|(~(nil=X3)&nil=X4))|(nil=X2&nil=X1))|(![X6]:(ssItem(X6)=>(~(cons(X6,nil)=X3)|~(memberP(X4,X6))))&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))|?[X5]:((ssItem(X5)&cons(X5,nil)=X1)&memberP(X2,X5)))|(~(nil=X3)&nil=X4))|(nil=X2&nil=X1))|(![X6]:(ssItem(X6)=>(~(cons(X6,nil)=X3)|~(memberP(X4,X6))))&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))|?[X5]:((ssItem(X5)&cons(X5,nil)=X1)&memberP(X2,X5)))|(~(nil=X3)&nil=X4))|(nil=X2&nil=X1))|(![X6]:(ssItem(X6)=>(~(cons(X6,nil)=X3)|~(memberP(X4,X6))))&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(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((((X2=X4&X1=X3)&![X5]:((~(ssItem(X5))|~(cons(X5,nil)=X1))|~(memberP(X2,X5))))&(nil=X3|~(nil=X4)))&(~(nil=X2)|~(nil=X1)))&(?[X6]:(ssItem(X6)&(cons(X6,nil)=X3&memberP(X4,X6)))|~(neq(X4,nil)))))))),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)&![X11]:((~(ssItem(X11))|~(cons(X11,nil)=X7))|~(memberP(X8,X11))))&(nil=X9|~(nil=X10)))&(~(nil=X8)|~(nil=X7)))&(?[X12]:(ssItem(X12)&(cons(X12,nil)=X9&memberP(X10,X12)))|~(neq(X10,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)&![X11]:((~(ssItem(X11))|~(cons(X11,nil)=esk48_0))|~(memberP(esk49_0,X11))))&(nil=esk50_0|~(nil=esk51_0)))&(~(nil=esk49_0)|~(nil=esk48_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,![X11]:((((((((((~(ssItem(X11))|~(cons(X11,nil)=esk48_0))|~(memberP(esk49_0,X11)))&(esk49_0=esk51_0&esk48_0=esk50_0))&(nil=esk50_0|~(nil=esk51_0)))&(~(nil=esk49_0)|~(nil=esk48_0)))&((ssItem(esk52_0)&(cons(esk52_0,nil)=esk50_0&memberP(esk51_0,esk52_0)))|~(neq(esk51_0,nil))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X11]:((((((((((~(ssItem(X11))|~(cons(X11,nil)=esk48_0))|~(memberP(esk49_0,X11)))&(esk49_0=esk51_0&esk48_0=esk50_0))&(nil=esk50_0|~(nil=esk51_0)))&(~(nil=esk49_0)|~(nil=esk48_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))))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(574,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(577,negated_conjecture,(memberP(esk51_0,esk52_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(cons(esk52_0,nil)=esk50_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(ssItem(esk52_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(nil!=esk48_0|nil!=esk49_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(nil=esk50_0|nil!=esk51_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,(~memberP(esk49_0,X1)|cons(X1,nil)!=esk48_0|~ssItem(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(esk48_0!=nil|esk51_0!=nil),inference(rw,[status(thm)],[580,583,theory(equality)])).
% cnf(586,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[574,583,theory(equality)])).
% cnf(589,negated_conjecture,(esk48_0=nil|esk51_0!=nil),inference(rw,[status(thm)],[581,582,theory(equality)])).
% cnf(590,negated_conjecture,(esk51_0!=nil),inference(csr,[status(thm)],[589,585])).
% cnf(591,negated_conjecture,(cons(esk52_0,nil)=esk48_0|~neq(esk51_0,nil)),inference(rw,[status(thm)],[578,582,theory(equality)])).
% cnf(592,negated_conjecture,(cons(X1,nil)!=esk48_0|~ssItem(X1)|~memberP(esk51_0,X1)),inference(rw,[status(thm)],[584,583,theory(equality)])).
% cnf(660,negated_conjecture,(ssItem(esk52_0)|esk51_0=nil|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[579,119,theory(equality)])).
% cnf(661,negated_conjecture,(cons(esk52_0,nil)=esk48_0|esk51_0=nil|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[591,119,theory(equality)])).
% cnf(662,negated_conjecture,(memberP(esk51_0,esk52_0)|esk51_0=nil|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[577,119,theory(equality)])).
% cnf(663,negated_conjecture,(ssItem(esk52_0)|esk51_0=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[660,125,theory(equality)])).
% cnf(664,negated_conjecture,(ssItem(esk52_0)|esk51_0=nil|$false|$false),inference(rw,[status(thm)],[663,586,theory(equality)])).
% cnf(665,negated_conjecture,(ssItem(esk52_0)|esk51_0=nil),inference(cn,[status(thm)],[664,theory(equality)])).
% cnf(666,negated_conjecture,(ssItem(esk52_0)),inference(sr,[status(thm)],[665,590,theory(equality)])).
% cnf(667,negated_conjecture,(cons(esk52_0,nil)=esk48_0|esk51_0=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[661,125,theory(equality)])).
% cnf(668,negated_conjecture,(cons(esk52_0,nil)=esk48_0|esk51_0=nil|$false|$false),inference(rw,[status(thm)],[667,586,theory(equality)])).
% cnf(669,negated_conjecture,(cons(esk52_0,nil)=esk48_0|esk51_0=nil),inference(cn,[status(thm)],[668,theory(equality)])).
% cnf(670,negated_conjecture,(cons(esk52_0,nil)=esk48_0),inference(sr,[status(thm)],[669,590,theory(equality)])).
% cnf(671,negated_conjecture,(memberP(esk51_0,esk52_0)|esk51_0=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[662,125,theory(equality)])).
% cnf(672,negated_conjecture,(memberP(esk51_0,esk52_0)|esk51_0=nil|$false|$false),inference(rw,[status(thm)],[671,586,theory(equality)])).
% cnf(673,negated_conjecture,(memberP(esk51_0,esk52_0)|esk51_0=nil),inference(cn,[status(thm)],[672,theory(equality)])).
% cnf(674,negated_conjecture,(memberP(esk51_0,esk52_0)),inference(sr,[status(thm)],[673,590,theory(equality)])).
% cnf(1357,negated_conjecture,(~memberP(esk51_0,esk52_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[592,670,theory(equality)])).
% cnf(1457,negated_conjecture,(~memberP(esk51_0,esk52_0)|$false),inference(rw,[status(thm)],[1357,666,theory(equality)])).
% cnf(1458,negated_conjecture,(~memberP(esk51_0,esk52_0)),inference(cn,[status(thm)],[1457,theory(equality)])).
% cnf(1488,negated_conjecture,($false),inference(rw,[status(thm)],[1458,674,theory(equality)])).
% cnf(1489,negated_conjecture,($false),inference(cn,[status(thm)],[1488,theory(equality)])).
% cnf(1490,negated_conjecture,($false),1489,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 206
% # ...of these trivial : 2
% # ...subsumed : 2
% # ...remaining for further processing: 202
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 3
% # Generated clauses : 589
% # ...of the previous two non-trivial : 487
% # Contextual simplify-reflections : 3
% # Paramodulations : 498
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 192
% # Positive orientable unit clauses: 17
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 171
% # Current number of unprocessed clauses: 478
% # ...number of literals in the above : 3307
% # Clause-clause subsumption calls (NU) : 845
% # Rec. Clause-clause subsumption calls : 158
% # Unit Clause-clause subsumption calls : 23
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 228 leaves, 1.35+/-1.147 terms/leaf
% # Paramod-from index: 100 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 192 leaves, 1.24+/-0.992 terms/leaf
% # -------------------------------------------------
% # User time : 0.065 s
% # System time : 0.006 s
% # Total time : 0.071 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.20 CPU 0.27 WC
% FINAL PrfWatch: 0.20 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP30878/SWC387+1.tptp
%
%------------------------------------------------------------------------------