TSTP Solution File: SWC381+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC381+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 08:04:59 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/SystemOnTPTP8820/SWC381+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP8820/SWC381+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8820/SWC381+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 8999
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 WC
% # Preprocessing time : 0.030 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% 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)&cons(X5,nil)=X1)&memberP(X2,X5)))|![X6]:(ssItem(X6)=>(~(cons(X6,nil)=X3)|~(memberP(X4,X6)))))&(~(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)&cons(X5,nil)=X1)&memberP(X2,X5)))|![X6]:(ssItem(X6)=>(~(cons(X6,nil)=X3)|~(memberP(X4,X6)))))&(~(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)&cons(X5,nil)=X1)&memberP(X2,X5)))|![X6]:(ssItem(X6)=>(~(cons(X6,nil)=X3)|~(memberP(X4,X6)))))&(~(neq(X2,nil))|neq(X4,nil))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% 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))|~(cons(X5,nil)=X1))|~(memberP(X2,X5))))&?[X6]:(ssItem(X6)&(cons(X6,nil)=X3&memberP(X4,X6))))|(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))|~(cons(X11,nil)=X7))|~(memberP(X8,X11))))&?[X12]:(ssItem(X12)&(cons(X12,nil)=X9&memberP(X10,X12))))|(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)&![X11]:((~(ssItem(X11))|~(cons(X11,nil)=esk48_0))|~(memberP(esk49_0,X11))))&(ssItem(esk52_0)&(cons(esk52_0,nil)=esk50_0&memberP(esk51_0,esk52_0))))|(neq(esk49_0,nil)&~(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)))&neq(esk49_0,nil))&(ssItem(esk52_0)&(cons(esk52_0,nil)=esk50_0&memberP(esk51_0,esk52_0))))|(neq(esk49_0,nil)&~(neq(esk51_0,nil))))&(esk49_0=esk51_0&esk48_0=esk50_0))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X11]:(((((((((neq(esk49_0,nil)|((~(ssItem(X11))|~(cons(X11,nil)=esk48_0))|~(memberP(esk49_0,X11))))&(~(neq(esk51_0,nil))|((~(ssItem(X11))|~(cons(X11,nil)=esk48_0))|~(memberP(esk49_0,X11)))))&((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)|cons(esk52_0,nil)=esk50_0)&(~(neq(esk51_0,nil))|cons(esk52_0,nil)=esk50_0))&((neq(esk49_0,nil)|memberP(esk51_0,esk52_0))&(~(neq(esk51_0,nil))|memberP(esk51_0,esk52_0))))))&(esk49_0=esk51_0&esk48_0=esk50_0))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(577,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(memberP(esk51_0,esk52_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(cons(esk52_0,nil)=esk50_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(ssItem(esk52_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(586,negated_conjecture,(neq(esk49_0,nil)|neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(587,negated_conjecture,(~memberP(esk49_0,X1)|cons(X1,nil)!=esk48_0|~ssItem(X1)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(591,negated_conjecture,(ssItem(esk52_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[583,578,theory(equality)]),586,theory(equality)])).
% cnf(592,negated_conjecture,(ssItem(esk52_0)),inference(cn,[status(thm)],[591,theory(equality)])).
% cnf(593,negated_conjecture,(cons(esk52_0,nil)=esk48_0|~neq(esk51_0,nil)),inference(rw,[status(thm)],[581,577,theory(equality)])).
% cnf(594,negated_conjecture,(cons(esk52_0,nil)=esk48_0|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[593,578,theory(equality)]),586,theory(equality)])).
% cnf(595,negated_conjecture,(cons(esk52_0,nil)=esk48_0),inference(cn,[status(thm)],[594,theory(equality)])).
% cnf(599,negated_conjecture,(memberP(esk49_0,esk52_0)|~neq(esk51_0,nil)),inference(rw,[status(thm)],[579,578,theory(equality)])).
% cnf(600,negated_conjecture,(memberP(esk49_0,esk52_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[599,578,theory(equality)]),586,theory(equality)])).
% cnf(601,negated_conjecture,(memberP(esk49_0,esk52_0)),inference(cn,[status(thm)],[600,theory(equality)])).
% cnf(611,negated_conjecture,(cons(X1,nil)!=esk48_0|~ssItem(X1)|~memberP(esk49_0,X1)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[587,578,theory(equality)]),586,theory(equality)])).
% cnf(612,negated_conjecture,(cons(X1,nil)!=esk48_0|~ssItem(X1)|~memberP(esk49_0,X1)),inference(cn,[status(thm)],[611,theory(equality)])).
% cnf(613,negated_conjecture,(~memberP(esk49_0,esk52_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[612,595,theory(equality)])).
% cnf(614,negated_conjecture,($false|~ssItem(esk52_0)),inference(rw,[status(thm)],[613,601,theory(equality)])).
% cnf(615,negated_conjecture,($false|$false),inference(rw,[status(thm)],[614,592,theory(equality)])).
% cnf(616,negated_conjecture,($false),inference(cn,[status(thm)],[615,theory(equality)])).
% cnf(617,negated_conjecture,($false),616,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 28
% # ...of these trivial : 6
% # ...subsumed : 0
% # ...remaining for further processing: 22
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 1
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 1
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 22
% # Positive orientable unit clauses: 18
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 2
% # Current number of unprocessed clauses: 176
% # ...number of literals in the above : 695
% # Clause-clause subsumption calls (NU) : 1
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 30 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 18 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 27 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.028 s
% # System time : 0.004 s
% # Total time : 0.032 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.33 WC
% FINAL PrfWatch: 0.14 CPU 0.33 WC
% SZS output end Solution for /tmp/SystemOnTPTP8820/SWC381+1.tptp
%
%------------------------------------------------------------------------------