TSTP Solution File: SWC254+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC254+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:32 EST 2010
% Result : Theorem 1.30s
% Output : Solution 1.30s
% 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/SystemOnTPTP4616/SWC254+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP4616/SWC254+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4616/SWC254+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 4712
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 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)=>(singletonP(X1)<=>?[X2]:(ssItem(X2)&cons(X2,nil)=X1))),file('/tmp/SRASS.s.p', ax4)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((~(X2=X4)|~(X1=X3))|(((~(neq(X2,nil))|![X5]:(ssItem(X5)=>![X6]:(ssList(X6)=>(~(cons(X5,nil)=X3)|~(app(X6,cons(X5,nil))=X4)))))|singletonP(X1))&(~(neq(X2,nil))|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))|![X5]:(ssItem(X5)=>![X6]:(ssList(X6)=>(~(cons(X5,nil)=X3)|~(app(X6,cons(X5,nil))=X4)))))|singletonP(X1))&(~(neq(X2,nil))|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))|![X5]:(ssItem(X5)=>![X6]:(ssList(X6)=>(~(cons(X5,nil)=X3)|~(app(X6,cons(X5,nil))=X4)))))|singletonP(X1))&(~(neq(X2,nil))|neq(X4,nil))))))))),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(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((X2=X4&X1=X3)&(((neq(X2,nil)&?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&(cons(X5,nil)=X3&app(X6,cons(X5,nil))=X4))))&~(singletonP(X1)))|(neq(X2,nil)&~(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)&(((neq(X8,nil)&?[X11]:(ssItem(X11)&?[X12]:(ssList(X12)&(cons(X11,nil)=X9&app(X12,cons(X11,nil))=X10))))&~(singletonP(X7)))|(neq(X8,nil)&~(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)&(((neq(esk49_0,nil)&(ssItem(esk52_0)&(ssList(esk53_0)&(cons(esk52_0,nil)=esk50_0&app(esk53_0,cons(esk52_0,nil))=esk51_0))))&~(singletonP(esk48_0)))|(neq(esk49_0,nil)&~(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(esk49_0,nil))&(~(neq(esk51_0,nil))|neq(esk49_0,nil)))&(((neq(esk49_0,nil)|ssItem(esk52_0))&(~(neq(esk51_0,nil))|ssItem(esk52_0)))&(((neq(esk49_0,nil)|ssList(esk53_0))&(~(neq(esk51_0,nil))|ssList(esk53_0)))&(((neq(esk49_0,nil)|cons(esk52_0,nil)=esk50_0)&(~(neq(esk51_0,nil))|cons(esk52_0,nil)=esk50_0))&((neq(esk49_0,nil)|app(esk53_0,cons(esk52_0,nil))=esk51_0)&(~(neq(esk51_0,nil))|app(esk53_0,cons(esk52_0,nil))=esk51_0))))))&((neq(esk49_0,nil)|~(singletonP(esk48_0)))&(~(neq(esk51_0,nil))|~(singletonP(esk48_0)))))))))),inference(distribute,[status(thm)],[570])).
% cnf(572,negated_conjecture,(~singletonP(esk48_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(576,negated_conjecture,(cons(esk52_0,nil)=esk50_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(ssItem(esk52_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(583,negated_conjecture,(neq(esk49_0,nil)|neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(584,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(585,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(589,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(593,negated_conjecture,(neq(esk51_0,nil)),inference(rw,[status(thm)],[583,585,theory(equality)])).
% cnf(594,negated_conjecture,(~singletonP(esk48_0)|$false),inference(rw,[status(thm)],[572,593,theory(equality)])).
% cnf(595,negated_conjecture,(~singletonP(esk48_0)),inference(cn,[status(thm)],[594,theory(equality)])).
% cnf(596,negated_conjecture,(ssItem(esk52_0)|$false),inference(rw,[status(thm)],[580,593,theory(equality)])).
% cnf(597,negated_conjecture,(ssItem(esk52_0)),inference(cn,[status(thm)],[596,theory(equality)])).
% cnf(601,negated_conjecture,(cons(esk52_0,nil)=esk48_0|~neq(esk51_0,nil)),inference(rw,[status(thm)],[576,584,theory(equality)])).
% cnf(602,negated_conjecture,(cons(esk52_0,nil)=esk48_0|$false),inference(rw,[status(thm)],[601,593,theory(equality)])).
% cnf(603,negated_conjecture,(cons(esk52_0,nil)=esk48_0),inference(cn,[status(thm)],[602,theory(equality)])).
% cnf(691,plain,(singletonP(cons(X1,nil))|~ssList(cons(X1,nil))|~ssItem(X1)),inference(er,[status(thm)],[122,theory(equality)])).
% cnf(1958,negated_conjecture,(singletonP(esk48_0)|~ssList(esk48_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[691,603,theory(equality)])).
% cnf(1961,negated_conjecture,(singletonP(esk48_0)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1958,589,theory(equality)])).
% cnf(1962,negated_conjecture,(singletonP(esk48_0)|$false|$false),inference(rw,[status(thm)],[1961,597,theory(equality)])).
% cnf(1963,negated_conjecture,(singletonP(esk48_0)),inference(cn,[status(thm)],[1962,theory(equality)])).
% cnf(1964,negated_conjecture,($false),inference(sr,[status(thm)],[1963,595,theory(equality)])).
% cnf(1965,negated_conjecture,($false),1964,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 253
% # ...of these trivial : 9
% # ...subsumed : 7
% # ...remaining for further processing: 237
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 10
% # Generated clauses : 715
% # ...of the previous two non-trivial : 591
% # Contextual simplify-reflections : 2
% # Paramodulations : 624
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 221
% # Positive orientable unit clauses: 36
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 179
% # Current number of unprocessed clauses: 483
% # ...number of literals in the above : 3375
% # Clause-clause subsumption calls (NU) : 840
% # Rec. Clause-clause subsumption calls : 162
% # Unit Clause-clause subsumption calls : 52
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 255 leaves, 1.32+/-1.091 terms/leaf
% # Paramod-from index: 121 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 219 leaves, 1.21+/-0.934 terms/leaf
% # -------------------------------------------------
% # User time : 0.074 s
% # System time : 0.005 s
% # Total time : 0.079 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.20 CPU 0.28 WC
% FINAL PrfWatch: 0.20 CPU 0.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP4616/SWC254+1.tptp
%
%------------------------------------------------------------------------------