TSTP Solution File: SWC293+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC293+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 : art06.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:41:57 EST 2010
% Result : Theorem 1.28s
% Output : Solution 1.28s
% 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/SystemOnTPTP6273/SWC293+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6273/SWC293+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6273/SWC293+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 6369
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.030 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(10, axiom,![X1]:(ssItem(X1)=>strictorderedP(cons(X1,nil))),file('/tmp/SRASS.s.p', ax68)).
% fof(11, axiom,strictorderedP(nil),file('/tmp/SRASS.s.p', ax69)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:((((~(ssList(X4))|~(X2=X4))|~(X1=X3))|strictorderedP(X1))|(![X5]:((~(ssItem(X5))|~(cons(X5,nil)=X3))|~(memberP(X4,X5)))&(~(nil=X4)|~(nil=X3))))))),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))|strictorderedP(X1))|(![X5]:((~(ssItem(X5))|~(cons(X5,nil)=X3))|~(memberP(X4,X5)))&(~(nil=X4)|~(nil=X3)))))))),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))|strictorderedP(X1))|(![X5]:((~(ssItem(X5))|~(cons(X5,nil)=X3))|~(memberP(X4,X5)))&(~(nil=X4)|~(nil=X3)))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(145, plain,![X1]:(~(ssItem(X1))|strictorderedP(cons(X1,nil))),inference(fof_nnf,[status(thm)],[10])).
% fof(146, plain,![X2]:(~(ssItem(X2))|strictorderedP(cons(X2,nil))),inference(variable_rename,[status(thm)],[145])).
% cnf(147,plain,(strictorderedP(cons(X1,nil))|~ssItem(X1)),inference(split_conjunct,[status(thm)],[146])).
% cnf(148,plain,(strictorderedP(nil)),inference(split_conjunct,[status(thm)],[11])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:((((ssList(X4)&X2=X4)&X1=X3)&~(strictorderedP(X1)))&(?[X5]:((ssItem(X5)&cons(X5,nil)=X3)&memberP(X4,X5))|(nil=X4&nil=X3)))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X6]:(ssList(X6)&?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&?[X9]:((((ssList(X9)&X7=X9)&X6=X8)&~(strictorderedP(X6)))&(?[X10]:((ssItem(X10)&cons(X10,nil)=X8)&memberP(X9,X10))|(nil=X9&nil=X8)))))),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)&~(strictorderedP(esk48_0)))&(((ssItem(esk52_0)&cons(esk52_0,nil)=esk50_0)&memberP(esk51_0,esk52_0))|(nil=esk51_0&nil=esk50_0)))))),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)&~(strictorderedP(esk48_0)))&((((nil=esk51_0|ssItem(esk52_0))&(nil=esk50_0|ssItem(esk52_0)))&((nil=esk51_0|cons(esk52_0,nil)=esk50_0)&(nil=esk50_0|cons(esk52_0,nil)=esk50_0)))&((nil=esk51_0|memberP(esk51_0,esk52_0))&(nil=esk50_0|memberP(esk51_0,esk52_0)))))))),inference(distribute,[status(thm)],[570])).
% cnf(574,negated_conjecture,(cons(esk52_0,nil)=esk50_0|nil=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(576,negated_conjecture,(ssItem(esk52_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(~strictorderedP(esk48_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(585,negated_conjecture,(~strictorderedP(esk50_0)),inference(rw,[status(thm)],[578,579,theory(equality)])).
% cnf(590,negated_conjecture,(strictorderedP(esk50_0)|esk50_0=nil|~ssItem(esk52_0)),inference(spm,[status(thm)],[147,574,theory(equality)])).
% cnf(592,negated_conjecture,(esk50_0=nil|~ssItem(esk52_0)),inference(sr,[status(thm)],[590,585,theory(equality)])).
% cnf(1517,negated_conjecture,(esk50_0=nil),inference(csr,[status(thm)],[592,576])).
% cnf(1522,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[585,1517,theory(equality)]),148,theory(equality)])).
% cnf(1523,negated_conjecture,($false),inference(cn,[status(thm)],[1522,theory(equality)])).
% cnf(1524,negated_conjecture,($false),1523,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 202
% # ...of these trivial : 2
% # ...subsumed : 1
% # ...remaining for further processing: 199
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 7
% # Generated clauses : 623
% # ...of the previous two non-trivial : 519
% # Contextual simplify-reflections : 3
% # Paramodulations : 532
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 186
% # Positive orientable unit clauses: 13
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 171
% # Current number of unprocessed clauses: 445
% # ...number of literals in the above : 3178
% # Clause-clause subsumption calls (NU) : 832
% # Rec. Clause-clause subsumption calls : 156
% # Unit Clause-clause subsumption calls : 9
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 224 leaves, 1.36+/-1.156 terms/leaf
% # Paramod-from index: 98 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 189 leaves, 1.24+/-0.999 terms/leaf
% # -------------------------------------------------
% # User time : 0.065 s
% # System time : 0.007 s
% # Total time : 0.072 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.18 CPU 0.27 WC
% FINAL PrfWatch: 0.18 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP6273/SWC293+1.tptp
%
%------------------------------------------------------------------------------