↑ Up

SRASS---0.1.THM-Sol.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SWC189+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 : art02.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:18:43 EST 2010

% Result   : Theorem 1.25s
% Output   : Solution 1.25s
% 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/SystemOnTPTP29119/SWC189+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP29119/SWC189+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29119/SWC189+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 29215
% 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(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(X2=X4)|~(X1=X3))|?[X5]:(ssItem(X5)&?[X6]:(ssItem(X6)&?[X7]:(ssList(X7)&?[X8]:((ssList(X8)&~(X5=X6))&app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8)=X3)))))|![X9]:(ssItem(X9)=>![X10]:(ssItem(X10)=>![X11]:(ssList(X11)=>![X12]:(ssList(X12)=>(~(app(app(app(X11,cons(X9,nil)),cons(X10,nil)),X12)=X1)|X9=X10)))))))))),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)&?[X6]:(ssItem(X6)&?[X7]:(ssList(X7)&?[X8]:((ssList(X8)&~(X5=X6))&app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8)=X3)))))|![X9]:(ssItem(X9)=>![X10]:(ssItem(X10)=>![X11]:(ssList(X11)=>![X12]:(ssList(X12)=>(~(app(app(app(X11,cons(X9,nil)),cons(X10,nil)),X12)=X1)|X9=X10))))))))))),inference(assume_negation,[status(cth)],[96])).
% fof(567, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((X2=X4&X1=X3)&![X5]:(~(ssItem(X5))|![X6]:(~(ssItem(X6))|![X7]:(~(ssList(X7))|![X8]:((~(ssList(X8))|X5=X6)|~(app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8)=X3))))))&?[X9]:(ssItem(X9)&?[X10]:(ssItem(X10)&?[X11]:(ssList(X11)&?[X12]:(ssList(X12)&(app(app(app(X11,cons(X9,nil)),cons(X10,nil)),X12)=X1&~(X9=X10))))))))))),inference(fof_nnf,[status(thm)],[97])).
% fof(568, negated_conjecture,?[X13]:(ssList(X13)&?[X14]:(ssList(X14)&?[X15]:(ssList(X15)&?[X16]:(ssList(X16)&(((X14=X16&X13=X15)&![X17]:(~(ssItem(X17))|![X18]:(~(ssItem(X18))|![X19]:(~(ssList(X19))|![X20]:((~(ssList(X20))|X17=X18)|~(app(app(app(X19,cons(X17,nil)),cons(X18,nil)),X20)=X15))))))&?[X21]:(ssItem(X21)&?[X22]:(ssItem(X22)&?[X23]:(ssList(X23)&?[X24]:(ssList(X24)&(app(app(app(X23,cons(X21,nil)),cons(X22,nil)),X24)=X13&~(X21=X22))))))))))),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)&![X17]:(~(ssItem(X17))|![X18]:(~(ssItem(X18))|![X19]:(~(ssList(X19))|![X20]:((~(ssList(X20))|X17=X18)|~(app(app(app(X19,cons(X17,nil)),cons(X18,nil)),X20)=esk50_0))))))&(ssItem(esk52_0)&(ssItem(esk53_0)&(ssList(esk54_0)&(ssList(esk55_0)&(app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0)=esk48_0&~(esk52_0=esk53_0))))))))))),inference(skolemize,[status(esa)],[568])).
% fof(570, negated_conjecture,![X17]:![X18]:![X19]:![X20]:(((((((((((~(ssList(X20))|X17=X18)|~(app(app(app(X19,cons(X17,nil)),cons(X18,nil)),X20)=esk50_0))|~(ssList(X19)))|~(ssItem(X18)))|~(ssItem(X17)))&(esk49_0=esk51_0&esk48_0=esk50_0))&(ssItem(esk52_0)&(ssItem(esk53_0)&(ssList(esk54_0)&(ssList(esk55_0)&(app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0)=esk48_0&~(esk52_0=esk53_0)))))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[569])).
% cnf(575,negated_conjecture,(esk52_0!=esk53_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(576,negated_conjecture,(app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0)=esk48_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(577,negated_conjecture,(ssList(esk55_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(578,negated_conjecture,(ssList(esk54_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(579,negated_conjecture,(ssItem(esk53_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(580,negated_conjecture,(ssItem(esk52_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(581,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(583,negated_conjecture,(X1=X2|~ssItem(X1)|~ssItem(X2)|~ssList(X3)|app(app(app(X3,cons(X1,nil)),cons(X2,nil)),X4)!=esk50_0|~ssList(X4)),inference(split_conjunct,[status(thm)],[570])).
% cnf(806,negated_conjecture,(X1=X2|app(app(app(X3,cons(X1,nil)),cons(X2,nil)),X4)!=esk48_0|~ssItem(X2)|~ssItem(X1)|~ssList(X4)|~ssList(X3)),inference(rw,[status(thm)],[583,581,theory(equality)])).
% cnf(812,negated_conjecture,(esk52_0=esk53_0|~ssList(esk55_0)|~ssList(esk54_0)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[806,576,theory(equality)])).
% cnf(817,negated_conjecture,(esk52_0=esk53_0|$false|~ssList(esk54_0)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(rw,[status(thm)],[812,577,theory(equality)])).
% cnf(818,negated_conjecture,(esk52_0=esk53_0|$false|$false|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(rw,[status(thm)],[817,578,theory(equality)])).
% cnf(819,negated_conjecture,(esk52_0=esk53_0|$false|$false|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[818,579,theory(equality)])).
% cnf(820,negated_conjecture,(esk52_0=esk53_0|$false|$false|$false|$false),inference(rw,[status(thm)],[819,580,theory(equality)])).
% cnf(821,negated_conjecture,(esk52_0=esk53_0),inference(cn,[status(thm)],[820,theory(equality)])).
% cnf(822,negated_conjecture,($false),inference(sr,[status(thm)],[821,575,theory(equality)])).
% cnf(823,negated_conjecture,($false),822,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 152
% # ...of these trivial                : 2
% # ...subsumed                        : 0
% # ...remaining for further processing: 150
% # Other redundant clauses eliminated : 9
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 128
% # ...of the previous two non-trivial : 105
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 106
% # Factorizations                     : 0
% # Equation resolutions               : 22
% # Current number of processed clauses: 146
% #    Positive orientable unit clauses: 19
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 3
% #    Non-unit-clauses                : 124
% # Current number of unprocessed clauses: 154
% # ...number of literals in the above : 740
% # Clause-clause subsumption calls (NU) : 240
% # Rec. Clause-clause subsumption calls : 116
% # 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:   188 leaves,   1.17+/-0.694 terms/leaf
% # Paramod-from index:           92 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:          165 leaves,   1.13+/-0.638 terms/leaf
% # -------------------------------------------------
% # User time              : 0.044 s
% # System time            : 0.001 s
% # Total time             : 0.045 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.23 WC
% FINAL PrfWatch: 0.15 CPU 0.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP29119/SWC189+1.tptp
% 
%------------------------------------------------------------------------------