TSTP Solution File: SWC411+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC411+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 : art09.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:05:03 EST 2010
% Result : Theorem 1.22s
% Output : Solution 1.22s
% 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/SystemOnTPTP26188/SWC411+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP26188/SWC411+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26188/SWC411+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 26284
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.031 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)))&memberP(X4,X5)))|![X6]:(ssItem(X6)=>(~(memberP(X2,X6))|memberP(X1,X6)))))))),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)))&memberP(X4,X5)))|![X6]:(ssItem(X6)=>(~(memberP(X2,X6))|memberP(X1,X6))))))))),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)))&memberP(X4,X5)))|![X6]:(ssItem(X6)=>(~(memberP(X2,X6))|memberP(X1,X6))))))))),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))|~(memberP(X4,X5))))&?[X6]:(ssItem(X6)&(memberP(X2,X6)&~(memberP(X1,X6))))))))),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))|memberP(X9,X11))|~(memberP(X10,X11))))&?[X12]:(ssItem(X12)&(memberP(X8,X12)&~(memberP(X7,X12))))))))),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))|memberP(esk50_0,X11))|~(memberP(esk51_0,X11))))&(ssItem(esk52_0)&(memberP(esk49_0,esk52_0)&~(memberP(esk48_0,esk52_0))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X11]:((((((((~(ssItem(X11))|memberP(esk50_0,X11))|~(memberP(esk51_0,X11)))&(esk49_0=esk51_0&esk48_0=esk50_0))&(ssItem(esk52_0)&(memberP(esk49_0,esk52_0)&~(memberP(esk48_0,esk52_0)))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% cnf(576,negated_conjecture,(~memberP(esk48_0,esk52_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(memberP(esk49_0,esk52_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(ssItem(esk52_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(581,negated_conjecture,(memberP(esk50_0,X1)|~memberP(esk51_0,X1)|~ssItem(X1)),inference(split_conjunct,[status(thm)],[571])).
% cnf(585,negated_conjecture,(memberP(esk51_0,esk52_0)),inference(rw,[status(thm)],[577,580,theory(equality)])).
% cnf(586,negated_conjecture,(memberP(esk48_0,X1)|~ssItem(X1)|~memberP(esk51_0,X1)),inference(rw,[status(thm)],[581,579,theory(equality)])).
% cnf(587,negated_conjecture,(memberP(esk48_0,esk52_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[586,585,theory(equality)])).
% cnf(588,negated_conjecture,(memberP(esk48_0,esk52_0)|$false),inference(rw,[status(thm)],[587,578,theory(equality)])).
% cnf(589,negated_conjecture,(memberP(esk48_0,esk52_0)),inference(cn,[status(thm)],[588,theory(equality)])).
% cnf(590,negated_conjecture,($false),inference(sr,[status(thm)],[589,576,theory(equality)])).
% cnf(591,negated_conjecture,($false),590,['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: 173
% # ...number of literals in the above : 686
% # 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.029 s
% # System time : 0.003 s
% # Total time : 0.032 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.20 WC
% FINAL PrfWatch: 0.13 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP26188/SWC411+1.tptp
%
%------------------------------------------------------------------------------