TSTP Solution File: SWC406+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC406+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:09:05 EST 2010
% Result : Theorem 1.45s
% Output : Solution 1.45s
% 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/SystemOnTPTP14066/SWC406+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14066/SWC406+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14066/SWC406+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 14198
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.029 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))|?[X5]:(ssItem(X5)&(((~(memberP(X3,X5))&![X6]:(ssItem(X6)=>((~(memberP(X4,X6))|~(leq(X6,X5)))|X5=X6)))&memberP(X4,X5))|(memberP(X3,X5)&(~(memberP(X4,X5))|?[X6]:(((ssItem(X6)&~(X5=X6))&memberP(X4,X6))&leq(X6,X5)))))))|![X7]:(ssItem(X7)=>(~(memberP(X1,X7))|memberP(X2,X7)))))))),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)&(((~(memberP(X3,X5))&![X6]:(ssItem(X6)=>((~(memberP(X4,X6))|~(leq(X6,X5)))|X5=X6)))&memberP(X4,X5))|(memberP(X3,X5)&(~(memberP(X4,X5))|?[X6]:(((ssItem(X6)&~(X5=X6))&memberP(X4,X6))&leq(X6,X5)))))))|![X7]:(ssItem(X7)=>(~(memberP(X1,X7))|memberP(X2,X7))))))))),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)&(((~(memberP(X3,X5))&![X6]:(ssItem(X6)=>((~(memberP(X4,X6))|~(leq(X6,X5)))|X5=X6)))&memberP(X4,X5))|(memberP(X3,X5)&(~(memberP(X4,X5))|?[X6]:(((ssItem(X6)&~(X5=X6))&memberP(X4,X6))&leq(X6,X5)))))))|![X7]:(ssItem(X7)=>(~(memberP(X1,X7))|memberP(X2,X7))))))))),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)&![X5]:(~(ssItem(X5))|(((memberP(X3,X5)|?[X6]:(ssItem(X6)&((memberP(X4,X6)&leq(X6,X5))&~(X5=X6))))|~(memberP(X4,X5)))&(~(memberP(X3,X5))|(memberP(X4,X5)&![X6]:(((~(ssItem(X6))|X5=X6)|~(memberP(X4,X6)))|~(leq(X6,X5))))))))&?[X7]:(ssItem(X7)&(memberP(X1,X7)&~(memberP(X2,X7))))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&(((X9=X11&X8=X10)&![X12]:(~(ssItem(X12))|(((memberP(X10,X12)|?[X13]:(ssItem(X13)&((memberP(X11,X13)&leq(X13,X12))&~(X12=X13))))|~(memberP(X11,X12)))&(~(memberP(X10,X12))|(memberP(X11,X12)&![X14]:(((~(ssItem(X14))|X12=X14)|~(memberP(X11,X14)))|~(leq(X14,X12))))))))&?[X15]:(ssItem(X15)&(memberP(X8,X15)&~(memberP(X9,X15))))))))),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)&![X12]:(~(ssItem(X12))|(((memberP(esk50_0,X12)|(ssItem(esk52_1(X12))&((memberP(esk51_0,esk52_1(X12))&leq(esk52_1(X12),X12))&~(X12=esk52_1(X12)))))|~(memberP(esk51_0,X12)))&(~(memberP(esk50_0,X12))|(memberP(esk51_0,X12)&![X14]:(((~(ssItem(X14))|X12=X14)|~(memberP(esk51_0,X14)))|~(leq(X14,X12))))))))&(ssItem(esk53_0)&(memberP(esk48_0,esk53_0)&~(memberP(esk49_0,esk53_0))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X12]:![X14]:(((((((((((((~(ssItem(X14))|X12=X14)|~(memberP(esk51_0,X14)))|~(leq(X14,X12)))&memberP(esk51_0,X12))|~(memberP(esk50_0,X12)))&((memberP(esk50_0,X12)|(ssItem(esk52_1(X12))&((memberP(esk51_0,esk52_1(X12))&leq(esk52_1(X12),X12))&~(X12=esk52_1(X12)))))|~(memberP(esk51_0,X12))))|~(ssItem(X12)))&(esk49_0=esk51_0&esk48_0=esk50_0))&(ssItem(esk53_0)&(memberP(esk48_0,esk53_0)&~(memberP(esk49_0,esk53_0)))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X12]:![X14]:(((((((((((((~(ssItem(X14))|X12=X14)|~(memberP(esk51_0,X14)))|~(leq(X14,X12)))|~(memberP(esk50_0,X12)))|~(ssItem(X12)))&((memberP(esk51_0,X12)|~(memberP(esk50_0,X12)))|~(ssItem(X12))))&((((ssItem(esk52_1(X12))|memberP(esk50_0,X12))|~(memberP(esk51_0,X12)))|~(ssItem(X12)))&(((((memberP(esk51_0,esk52_1(X12))|memberP(esk50_0,X12))|~(memberP(esk51_0,X12)))|~(ssItem(X12)))&(((leq(esk52_1(X12),X12)|memberP(esk50_0,X12))|~(memberP(esk51_0,X12)))|~(ssItem(X12))))&(((~(X12=esk52_1(X12))|memberP(esk50_0,X12))|~(memberP(esk51_0,X12)))|~(ssItem(X12))))))&(esk49_0=esk51_0&esk48_0=esk50_0))&(ssItem(esk53_0)&(memberP(esk48_0,esk53_0)&~(memberP(esk49_0,esk53_0)))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(577,negated_conjecture,(~memberP(esk49_0,esk53_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(memberP(esk48_0,esk53_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(ssItem(esk53_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(586,negated_conjecture,(memberP(esk51_0,X1)|~ssItem(X1)|~memberP(esk50_0,X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(588,negated_conjecture,(~memberP(esk51_0,esk53_0)),inference(rw,[status(thm)],[577,581,theory(equality)])).
% cnf(593,negated_conjecture,(memberP(esk50_0,esk53_0)),inference(rw,[status(thm)],[578,580,theory(equality)])).
% cnf(594,negated_conjecture,(memberP(esk51_0,esk53_0)|~ssItem(esk53_0)),inference(spm,[status(thm)],[586,593,theory(equality)])).
% cnf(595,negated_conjecture,(memberP(esk51_0,esk53_0)|$false),inference(rw,[status(thm)],[594,579,theory(equality)])).
% cnf(596,negated_conjecture,(memberP(esk51_0,esk53_0)),inference(cn,[status(thm)],[595,theory(equality)])).
% cnf(597,negated_conjecture,($false),inference(sr,[status(thm)],[596,588,theory(equality)])).
% cnf(598,negated_conjecture,($false),597,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 25
% # ...of these trivial : 2
% # ...subsumed : 0
% # ...remaining for further processing: 23
% # 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: 23
% # Positive orientable unit clauses: 16
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 4
% # Current number of unprocessed clauses: 178
% # ...number of literals in the above : 708
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 33 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 17 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 28 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.025 s
% # System time : 0.005 s
% # Total time : 0.030 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.20 WC
% FINAL PrfWatch: 0.15 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP14066/SWC406+1.tptp
%
%------------------------------------------------------------------------------