TSTP Solution File: SWC030+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC030+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 06:52:31 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/SystemOnTPTP13540/SWC030+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13540/SWC030+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13540/SWC030+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 13636
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(ssList(X1)=>app(nil,X1)=X1),file('/tmp/SRASS.s.p', ax28)).
% fof(7, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(nil=app(X1,X2)<=>(nil=X2&nil=X1)))),file('/tmp/SRASS.s.p', ax83)).
% fof(8, axiom,![X1]:(ssList(X1)=>app(X1,nil)=X1),file('/tmp/SRASS.s.p', ax84)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(X2=X4)|~(X1=X3))|![X5]:(ssList(X5)=>![X6]:(ssList(X6)=>(~(app(X5,X6)=X4)|~(app(X6,X5)=X3)))))|((~(nil=X2)|nil=X1)&(~(nil=X1)|nil=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))|![X5]:(ssList(X5)=>![X6]:(ssList(X6)=>(~(app(X5,X6)=X4)|~(app(X6,X5)=X3)))))|((~(nil=X2)|nil=X1)&(~(nil=X1)|nil=X2)))))))),inference(assume_negation,[status(cth)],[96])).
% fof(108, plain,![X1]:(~(ssList(X1))|app(nil,X1)=X1),inference(fof_nnf,[status(thm)],[3])).
% fof(109, plain,![X2]:(~(ssList(X2))|app(nil,X2)=X2),inference(variable_rename,[status(thm)],[108])).
% cnf(110,plain,(app(nil,X1)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[109])).
% fof(123, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(nil=app(X1,X2))|(nil=X2&nil=X1))&((~(nil=X2)|~(nil=X1))|nil=app(X1,X2))))),inference(fof_nnf,[status(thm)],[7])).
% fof(124, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(nil=app(X3,X4))|(nil=X4&nil=X3))&((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))))),inference(variable_rename,[status(thm)],[123])).
% fof(125, plain,![X3]:![X4]:((~(ssList(X4))|((~(nil=app(X3,X4))|(nil=X4&nil=X3))&((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[124])).
% fof(126, plain,![X3]:![X4]:(((((nil=X4|~(nil=app(X3,X4)))|~(ssList(X4)))|~(ssList(X3)))&(((nil=X3|~(nil=app(X3,X4)))|~(ssList(X4)))|~(ssList(X3))))&((((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))|~(ssList(X4)))|~(ssList(X3)))),inference(distribute,[status(thm)],[125])).
% cnf(128,plain,(nil=X1|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[126])).
% cnf(129,plain,(nil=X2|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[126])).
% fof(130, plain,![X1]:(~(ssList(X1))|app(X1,nil)=X1),inference(fof_nnf,[status(thm)],[8])).
% fof(131, plain,![X2]:(~(ssList(X2))|app(X2,nil)=X2),inference(variable_rename,[status(thm)],[130])).
% cnf(132,plain,(app(X1,nil)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[131])).
% fof(567, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((X2=X4&X1=X3)&?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&(app(X5,X6)=X4&app(X6,X5)=X3))))&((nil=X2&~(nil=X1))|(nil=X1&~(nil=X2)))))))),inference(fof_nnf,[status(thm)],[97])).
% fof(568, negated_conjecture,?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&(((X8=X10&X7=X9)&?[X11]:(ssList(X11)&?[X12]:(ssList(X12)&(app(X11,X12)=X10&app(X12,X11)=X9))))&((nil=X8&~(nil=X7))|(nil=X7&~(nil=X8)))))))),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)&(ssList(esk52_0)&(ssList(esk53_0)&(app(esk52_0,esk53_0)=esk51_0&app(esk53_0,esk52_0)=esk50_0))))&((nil=esk49_0&~(nil=esk48_0))|(nil=esk48_0&~(nil=esk49_0)))))))),inference(skolemize,[status(esa)],[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)&(ssList(esk52_0)&(ssList(esk53_0)&(app(esk52_0,esk53_0)=esk51_0&app(esk53_0,esk52_0)=esk50_0))))&(((nil=esk48_0|nil=esk49_0)&(~(nil=esk49_0)|nil=esk49_0))&((nil=esk48_0|~(nil=esk48_0))&(~(nil=esk49_0)|~(nil=esk48_0))))))))),inference(distribute,[status(thm)],[569])).
% cnf(571,negated_conjecture,(nil!=esk48_0|nil!=esk49_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(574,negated_conjecture,(nil=esk49_0|nil=esk48_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(575,negated_conjecture,(app(esk53_0,esk52_0)=esk50_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(576,negated_conjecture,(app(esk52_0,esk53_0)=esk51_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(577,negated_conjecture,(ssList(esk53_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(578,negated_conjecture,(ssList(esk52_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(579,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(580,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(584,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(589,negated_conjecture,(app(esk52_0,esk53_0)=esk49_0),inference(rw,[status(thm)],[576,580,theory(equality)])).
% cnf(590,negated_conjecture,(app(esk53_0,esk52_0)=esk48_0),inference(rw,[status(thm)],[575,579,theory(equality)])).
% cnf(618,negated_conjecture,(nil=esk53_0|esk49_0!=nil|~ssList(esk53_0)|~ssList(esk52_0)),inference(spm,[status(thm)],[129,589,theory(equality)])).
% cnf(623,negated_conjecture,(nil=esk53_0|esk49_0!=nil|$false|~ssList(esk52_0)),inference(rw,[status(thm)],[618,577,theory(equality)])).
% cnf(624,negated_conjecture,(nil=esk53_0|esk49_0!=nil|$false|$false),inference(rw,[status(thm)],[623,578,theory(equality)])).
% cnf(625,negated_conjecture,(nil=esk53_0|esk49_0!=nil),inference(cn,[status(thm)],[624,theory(equality)])).
% cnf(628,negated_conjecture,(nil=esk53_0|esk48_0!=nil|~ssList(esk52_0)|~ssList(esk53_0)),inference(spm,[status(thm)],[128,590,theory(equality)])).
% cnf(631,negated_conjecture,(nil=esk53_0|esk48_0!=nil|$false|~ssList(esk53_0)),inference(rw,[status(thm)],[628,578,theory(equality)])).
% cnf(632,negated_conjecture,(nil=esk53_0|esk48_0!=nil|$false|$false),inference(rw,[status(thm)],[631,577,theory(equality)])).
% cnf(633,negated_conjecture,(nil=esk53_0|esk48_0!=nil),inference(cn,[status(thm)],[632,theory(equality)])).
% cnf(1412,negated_conjecture,(esk53_0=nil|esk48_0=nil),inference(spm,[status(thm)],[625,574,theory(equality)])).
% cnf(1417,negated_conjecture,(esk53_0=nil),inference(csr,[status(thm)],[633,1412])).
% cnf(1419,negated_conjecture,(app(nil,esk52_0)=esk48_0),inference(rw,[status(thm)],[590,1417,theory(equality)])).
% cnf(1420,negated_conjecture,(app(esk52_0,nil)=esk49_0),inference(rw,[status(thm)],[589,1417,theory(equality)])).
% cnf(1433,negated_conjecture,(esk48_0=esk52_0|~ssList(esk52_0)),inference(spm,[status(thm)],[110,1419,theory(equality)])).
% cnf(1468,negated_conjecture,(esk48_0=esk52_0|$false),inference(rw,[status(thm)],[1433,578,theory(equality)])).
% cnf(1469,negated_conjecture,(esk48_0=esk52_0),inference(cn,[status(thm)],[1468,theory(equality)])).
% cnf(1473,negated_conjecture,(app(esk48_0,nil)=esk49_0),inference(rw,[status(thm)],[1420,1469,theory(equality)])).
% cnf(1487,negated_conjecture,(esk49_0=esk48_0|~ssList(esk48_0)),inference(spm,[status(thm)],[132,1473,theory(equality)])).
% cnf(1528,negated_conjecture,(esk49_0=esk48_0|$false),inference(rw,[status(thm)],[1487,584,theory(equality)])).
% cnf(1529,negated_conjecture,(esk49_0=esk48_0),inference(cn,[status(thm)],[1528,theory(equality)])).
% cnf(1533,negated_conjecture,(esk48_0!=nil|esk48_0!=nil),inference(rw,[status(thm)],[571,1529,theory(equality)])).
% cnf(1534,negated_conjecture,(esk48_0!=nil),inference(cn,[status(thm)],[1533,theory(equality)])).
% cnf(1548,negated_conjecture,(esk49_0=nil),inference(sr,[status(thm)],[574,1534,theory(equality)])).
% cnf(1549,negated_conjecture,(esk48_0=nil),inference(rw,[status(thm)],[1548,1529,theory(equality)])).
% cnf(1550,negated_conjecture,($false),inference(sr,[status(thm)],[1549,1534,theory(equality)])).
% cnf(1551,negated_conjecture,($false),1550,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 210
% # ...of these trivial : 2
% # ...subsumed : 1
% # ...remaining for further processing: 207
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 11
% # Generated clauses : 604
% # ...of the previous two non-trivial : 501
% # Contextual simplify-reflections : 3
% # Paramodulations : 512
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 188
% # Positive orientable unit clauses: 16
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 169
% # Current number of unprocessed clauses: 443
% # ...number of literals in the above : 3161
% # Clause-clause subsumption calls (NU) : 886
% # Rec. Clause-clause subsumption calls : 179
% # Unit Clause-clause subsumption calls : 29
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 224 leaves, 1.36+/-1.156 terms/leaf
% # Paramod-from index: 99 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 189 leaves, 1.24+/-0.999 terms/leaf
% # -------------------------------------------------
% # User time : 0.063 s
% # System time : 0.010 s
% # Total time : 0.073 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.20 CPU 0.27 WC
% FINAL PrfWatch: 0.20 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP13540/SWC030+1.tptp
%
%------------------------------------------------------------------------------