TSTP Solution File: SWC094+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC094+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 : art01.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:02:50 EST 2010
% Result : Theorem 1.48s
% Output : Solution 1.48s
% 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/SystemOnTPTP31605/SWC094+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31605/SWC094+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31605/SWC094+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 31701
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.030 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,![X1]:(ssList(X1)=>app(nil,X1)=X1),file('/tmp/SRASS.s.p', ax28)).
% fof(7, axiom,![X1]:(ssList(X1)=>app(X1,nil)=X1),file('/tmp/SRASS.s.p', ax84)).
% fof(19, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(X2=X4)|~(X1=X3))|~(X4=X3))|?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X5,X6),X7)=X1)&app(X5,X7)=X2)))))))),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))|~(X4=X3))|?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X5,X6),X7)=X1)&app(X5,X7)=X2))))))))),inference(assume_negation,[status(cth)],[96])).
% fof(119, plain,![X1]:(~(ssList(X1))|app(nil,X1)=X1),inference(fof_nnf,[status(thm)],[5])).
% fof(120, plain,![X2]:(~(ssList(X2))|app(nil,X2)=X2),inference(variable_rename,[status(thm)],[119])).
% cnf(121,plain,(app(nil,X1)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[120])).
% fof(129, plain,![X1]:(~(ssList(X1))|app(X1,nil)=X1),inference(fof_nnf,[status(thm)],[7])).
% fof(130, plain,![X2]:(~(ssList(X2))|app(X2,nil)=X2),inference(variable_rename,[status(thm)],[129])).
% cnf(131,plain,(app(X1,nil)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[130])).
% cnf(190,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[19])).
% fof(567, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((X2=X4&X1=X3)&X4=X3)&![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|![X7]:((~(ssList(X7))|~(app(app(X5,X6),X7)=X1))|~(app(X5,X7)=X2))))))))),inference(fof_nnf,[status(thm)],[97])).
% fof(568, negated_conjecture,?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&(((X9=X11&X8=X10)&X11=X10)&![X12]:(~(ssList(X12))|![X13]:(~(ssList(X13))|![X14]:((~(ssList(X14))|~(app(app(X12,X13),X14)=X8))|~(app(X12,X14)=X9))))))))),inference(variable_rename,[status(thm)],[567])).
% fof(569, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&(((esk49_0=esk51_0&esk48_0=esk50_0)&esk51_0=esk50_0)&![X12]:(~(ssList(X12))|![X13]:(~(ssList(X13))|![X14]:((~(ssList(X14))|~(app(app(X12,X13),X14)=esk48_0))|~(app(X12,X14)=esk49_0))))))))),inference(skolemize,[status(esa)],[568])).
% fof(570, negated_conjecture,![X12]:![X13]:![X14]:(((((((((~(ssList(X14))|~(app(app(X12,X13),X14)=esk48_0))|~(app(X12,X14)=esk49_0))|~(ssList(X13)))|~(ssList(X12)))&((esk49_0=esk51_0&esk48_0=esk50_0)&esk51_0=esk50_0))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[569])).
% cnf(571,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(575,negated_conjecture,(esk51_0=esk50_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(576,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(577,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(578,negated_conjecture,(~ssList(X1)|~ssList(X2)|app(X1,X3)!=esk49_0|app(app(X1,X2),X3)!=esk48_0|~ssList(X3)),inference(split_conjunct,[status(thm)],[570])).
% cnf(579,negated_conjecture,(esk51_0=esk48_0),inference(rw,[status(thm)],[575,576,theory(equality)])).
% cnf(580,negated_conjecture,(esk49_0=esk48_0),inference(rw,[status(thm)],[577,579,theory(equality)])).
% cnf(1306,negated_conjecture,(app(app(X1,X2),X3)!=esk48_0|app(X1,X3)!=esk48_0|~ssList(X3)|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[578,580,theory(equality)])).
% cnf(1643,negated_conjecture,(app(app(nil,X1),X2)!=esk48_0|X2!=esk48_0|~ssList(X2)|~ssList(X1)|~ssList(nil)),inference(spm,[status(thm)],[1306,121,theory(equality)])).
% cnf(1654,negated_conjecture,(app(app(nil,X1),X2)!=esk48_0|X2!=esk48_0|~ssList(X2)|~ssList(X1)|$false),inference(rw,[status(thm)],[1643,190,theory(equality)])).
% cnf(1655,negated_conjecture,(app(app(nil,X1),X2)!=esk48_0|X2!=esk48_0|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[1654,theory(equality)])).
% cnf(1658,negated_conjecture,(app(app(nil,X1),esk48_0)!=esk48_0|~ssList(esk48_0)|~ssList(X1)),inference(er,[status(thm)],[1655,theory(equality)])).
% cnf(1659,negated_conjecture,(app(app(nil,X1),esk48_0)!=esk48_0|$false|~ssList(X1)),inference(rw,[status(thm)],[1658,571,theory(equality)])).
% cnf(1660,negated_conjecture,(app(app(nil,X1),esk48_0)!=esk48_0|~ssList(X1)),inference(cn,[status(thm)],[1659,theory(equality)])).
% cnf(1661,negated_conjecture,(app(nil,esk48_0)!=esk48_0|~ssList(nil)),inference(spm,[status(thm)],[1660,131,theory(equality)])).
% cnf(1665,negated_conjecture,(app(nil,esk48_0)!=esk48_0|$false),inference(rw,[status(thm)],[1661,190,theory(equality)])).
% cnf(1666,negated_conjecture,(app(nil,esk48_0)!=esk48_0),inference(cn,[status(thm)],[1665,theory(equality)])).
% cnf(1672,negated_conjecture,(~ssList(esk48_0)),inference(spm,[status(thm)],[1666,121,theory(equality)])).
% cnf(1673,negated_conjecture,($false),inference(rw,[status(thm)],[1672,571,theory(equality)])).
% cnf(1674,negated_conjecture,($false),inference(cn,[status(thm)],[1673,theory(equality)])).
% cnf(1675,negated_conjecture,($false),1674,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 263
% # ...of these trivial : 2
% # ...subsumed : 28
% # ...remaining for further processing: 233
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 7
% # Generated clauses : 684
% # ...of the previous two non-trivial : 554
% # Contextual simplify-reflections : 9
% # Paramodulations : 588
% # Factorizations : 0
% # Equation resolutions : 96
% # Current number of processed clauses: 220
% # Positive orientable unit clauses: 22
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 195
% # Current number of unprocessed clauses: 455
% # ...number of literals in the above : 3329
% # Clause-clause subsumption calls (NU) : 1258
% # Rec. Clause-clause subsumption calls : 511
% # Unit Clause-clause subsumption calls : 13
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 248 leaves, 1.37+/-1.181 terms/leaf
% # Paramod-from index: 115 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 219 leaves, 1.22+/-1.025 terms/leaf
% # -------------------------------------------------
% # User time : 0.072 s
% # System time : 0.006 s
% # Total time : 0.078 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.22 CPU 0.27 WC
% FINAL PrfWatch: 0.22 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP31605/SWC094+1.tptp
%
%------------------------------------------------------------------------------