TSTP Solution File: SWW473+7 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWW473+7 : TPTP v5.3.0. Released v5.3.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 @ 2800MHz
% Memory : 2005MB
% OS : Linux 2.6.32.26-175.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 4 01:10:09 EST 2011
% Result : Theorem 154.46s
% Output : Solution 154.46s
% 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/SystemOnTPTP27263/SWW473+7.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% WARNING: TreeLimitedRun lost 0.67s, total lost is 0.67s
% found
% SZS status THM for /tmp/SystemOnTPTP27263/SWW473+7.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27263/SWW473+7.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.4/eproof_ram --print-statistics -xAuto -tAuto --cpu-limit=60 --memory-limit=Auto --tstp-format /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 27552
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 WC
% PrfWatch: 1.90 CPU 2.04 WC
% PrfWatch: 3.91 CPU 4.06 WC
% PrfWatch: 5.90 CPU 6.08 WC
% PrfWatch: 7.90 CPU 8.09 WC
% PrfWatch: 9.91 CPU 10.11 WC
% # Garbage collection reclaimed 650 unused term cells.
% # Garbage collection reclaimed 5943 unused term cells.
% # Garbage collection reclaimed 5460 unused term cells.
% # Garbage collection reclaimed 5135 unused term cells.
% # Garbage collection reclaimed 4673 unused term cells.
% # Garbage collection reclaimed 4222 unused term cells.
% # Garbage collection reclaimed 4115 unused term cells.
% # Garbage collection reclaimed 3840 unused term cells.
% # Garbage collection reclaimed 3539 unused term cells.
% # Garbage collection reclaimed 3304 unused term cells.
% # Garbage collection reclaimed 1153 unused term cells.
% # Auto-Ordering is analysing problem.
% # Problem is type GHSMNSMLM32LD
% # Auto-mode selected ordering type KBO6
% # Auto-mode selected ordering precedence scheme <invfreq>
% # Auto-mode selected weight ordering scheme <invfreqrank>
% #
% # Auto-Heuristic is analysing problem.
% # Problem is type GHSMNSMLM32LD
% # Auto-Mode selected heuristic G_E___042_C18_F1_PI_AE_Q4_CS_SP_S0Y
% # and selection function SelectMaxLComplexAvoidPosPred.
% #
% # Initializing proof state
% # Scanning for AC axioms
% # Garbage collection reclaimed 3366 unused term cells.
% # Garbage collection reclaimed 259 unused term cells.
% # Garbage collection reclaimed 257 unused term cells.
% # Garbage collection reclaimed 261 unused term cells.
% # Garbage collection reclaimed 259 unused term cells.
% # Garbage collection reclaimed 256 unused term cells.
% # Garbage collection reclaimed 257 unused term cells.
% # Garbage collection reclaimed 259 unused term cells.
% # Garbage collection reclaimed 269 unused term cells.
% # Garbage collection reclaimed 282 unused term cells.
% # Garbage collection reclaimed 264 unused term cells.
% # Garbage collection reclaimed 260 unused term cells.
% # Garbage collection reclaimed 259 unused term cells.
% # Garbage collection reclaimed 259 unused term cells.
% # Garbage collection reclaimed 261 unused term cells.
% # Garbage collection reclaimed 262 unused term cells.
% # Garbage collection reclaimed 262 unused term cells.
% # Garbage collection reclaimed 278 unused term cells.
% # Garbage collection reclaimed 255 unused term cells.
% # Garbage collection reclaimed 256 unused term cells.
% # Garbage collection reclaimed 255 unused term cells.
% # Garbage collection reclaimed 261 unused term cells.
% # Garbage collection reclaimed 267 unused term cells.
% # Garbage collection reclaimed 258 unused term cells.
% # Garbage collection reclaimed 262 unused term cells.
% # Garbage collection reclaimed 257 unused term cells.
% # Garbage collection reclaimed 258 unused term cells.
% # Garbage collection reclaimed 260 unused term cells.
% # Garbage collection reclaimed 267 unused term cells.
% # Garbage collection reclaimed 265 unused term cells.
% # Garbage collection reclaimed 260 unused term cells.
% # Garbage collection reclaimed 257 unused term cells.
% # Garbage collection reclaimed 272 unused term cells.
% # Garbage collection reclaimed 266 unused term cells.
% # Proof found!
% # SZS status Theorem
% # Parsed axioms : 1201
% # Removed by relevancy pruning : 0
% # Initial clauses : 1739
% # Removed in clause preprocessing : 68
% # Initial clauses in saturation : 1671
% # Processed clauses : 1822
% # ...of these trivial : 34
% # ...subsumed : 370
% # ...remaining for further processing: 1418
% # Other redundant clauses eliminated : 85
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 24
% # Generated clauses : 66324
% # ...of the previous two non-trivial : 61299
% # Contextual simplify-reflections : 34
% # Paramodulations : 66194
% # Factorizations : 13
% # Equation resolutions : 117
% # Current number of processed clauses: 1379
% # Positive orientable unit clauses: 284
% # Positive unorientable unit clauses: 10
% # Negative unit clauses : 24
% # Non-unit-clauses : 1061
% # Current number of unprocessed clauses: 60352
% # ...number of literals in the above : 230367
% # Clause-clause subsumption calls (NU) : 33922
% # Rec. Clause-clause subsumption calls : 13273
% # Unit Clause-clause subsumption calls : 967
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 17309
% # Indexed BW rewrite successes : 102
% # Backwards rewriting index : 698 leaves, 5.98+/-25.994 terms/leaf
% # Paramod-from index : 159 leaves, 4.53+/-14.031 terms/leaf
% # Paramod-into index : 648 leaves, 4.87+/-19.101 terms/leaf
% # SZS output start CNFRefutation.
% fof(76, axiom,![X1]:![X2]:![X10]:![X12]:![X9]:(hBOOL(hAPP(fun(X2,bool),bool,hAPP(X2,fun(fun(X2,bool),bool),member(X2),X12),X9))=>hBOOL(hAPP(fun(X1,bool),bool,hAPP(X1,fun(fun(X1,bool),bool),member(X1),hAPP(X2,X1,X10,X12)),hAPP(fun(X2,bool),fun(X1,bool),hAPP(fun(X2,X1),fun(fun(X2,bool),fun(X1,bool)),image(X2,X1),X10),X9)))),file('/tmp/SRASS.s.p', fact_94_imageI)).
% fof(79, axiom,![X2]:![X12]:![X9]:![X11]:(hBOOL(hAPP(fun(X2,bool),bool,hAPP(fun(X2,bool),fun(fun(X2,bool),bool),ord_less_eq(fun(X2,bool)),hAPP(fun(X2,bool),fun(X2,bool),hAPP(X2,fun(fun(X2,bool),fun(X2,bool)),insert(X2),X12),X9)),X11))<=>(hBOOL(hAPP(fun(X2,bool),bool,hAPP(X2,fun(fun(X2,bool),bool),member(X2),X12),X11))&hBOOL(hAPP(fun(X2,bool),bool,hAPP(fun(X2,bool),fun(fun(X2,bool),bool),ord_less_eq(fun(X2,bool)),X9),X11)))),file('/tmp/SRASS.s.p', fact_103_insert__subset)).
% fof(120, axiom,hBOOL(hAPP(fun(x_a,bool),bool,hAPP(fun(x_a,bool),fun(fun(x_a,bool),bool),ord_less_eq(fun(x_a,bool)),g),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u))),file('/tmp/SRASS.s.p', conj_1)).
% fof(123, axiom,hBOOL(hAPP(fun(pname,bool),bool,hAPP(pname,fun(fun(pname,bool),bool),member(pname),pn),u)),file('/tmp/SRASS.s.p', conj_4)).
% fof(1201, conjecture,hBOOL(hAPP(fun(x_a,bool),bool,hAPP(fun(x_a,bool),fun(fun(x_a,bool),bool),ord_less_eq(fun(x_a,bool)),hAPP(fun(x_a,bool),fun(x_a,bool),hAPP(x_a,fun(fun(x_a,bool),fun(x_a,bool)),insert(x_a),hAPP(pname,x_a,mgt_call,pn)),g)),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u))),file('/tmp/SRASS.s.p', conj_6)).
% fof(1202, negated_conjecture,~(hBOOL(hAPP(fun(x_a,bool),bool,hAPP(fun(x_a,bool),fun(fun(x_a,bool),bool),ord_less_eq(fun(x_a,bool)),hAPP(fun(x_a,bool),fun(x_a,bool),hAPP(x_a,fun(fun(x_a,bool),fun(x_a,bool)),insert(x_a),hAPP(pname,x_a,mgt_call,pn)),g)),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u)))),inference(assume_negation,[status(cth)],[1201])).
% fof(1326, negated_conjecture,~(hBOOL(hAPP(fun(x_a,bool),bool,hAPP(fun(x_a,bool),fun(fun(x_a,bool),bool),ord_less_eq(fun(x_a,bool)),hAPP(fun(x_a,bool),fun(x_a,bool),hAPP(x_a,fun(fun(x_a,bool),fun(x_a,bool)),insert(x_a),hAPP(pname,x_a,mgt_call,pn)),g)),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u)))),inference(fof_simplification,[status(thm)],[1202,theory(equality)])).
% fof(1574, plain,![X1]:![X2]:![X10]:![X12]:![X9]:(~(hBOOL(hAPP(fun(X2,bool),bool,hAPP(X2,fun(fun(X2,bool),bool),member(X2),X12),X9)))|hBOOL(hAPP(fun(X1,bool),bool,hAPP(X1,fun(fun(X1,bool),bool),member(X1),hAPP(X2,X1,X10,X12)),hAPP(fun(X2,bool),fun(X1,bool),hAPP(fun(X2,X1),fun(fun(X2,bool),fun(X1,bool)),image(X2,X1),X10),X9)))),inference(fof_nnf,[status(thm)],[76])).
% fof(1575, plain,![X13]:![X14]:![X15]:![X16]:![X17]:(~(hBOOL(hAPP(fun(X14,bool),bool,hAPP(X14,fun(fun(X14,bool),bool),member(X14),X16),X17)))|hBOOL(hAPP(fun(X13,bool),bool,hAPP(X13,fun(fun(X13,bool),bool),member(X13),hAPP(X14,X13,X15,X16)),hAPP(fun(X14,bool),fun(X13,bool),hAPP(fun(X14,X13),fun(fun(X14,bool),fun(X13,bool)),image(X14,X13),X15),X17)))),inference(variable_rename,[status(thm)],[1574])).
% cnf(1576,plain,(hBOOL(hAPP(fun(X1,bool),bool,hAPP(X1,fun(fun(X1,bool),bool),member(X1),hAPP(X2,X1,X3,X4)),hAPP(fun(X2,bool),fun(X1,bool),hAPP(fun(X2,X1),fun(fun(X2,bool),fun(X1,bool)),image(X2,X1),X3),X5)))|~hBOOL(hAPP(fun(X2,bool),bool,hAPP(X2,fun(fun(X2,bool),bool),member(X2),X4),X5))),inference(split_conjunct,[status(thm)],[1575])).
% fof(1582, plain,![X2]:![X12]:![X9]:![X11]:((~(hBOOL(hAPP(fun(X2,bool),bool,hAPP(fun(X2,bool),fun(fun(X2,bool),bool),ord_less_eq(fun(X2,bool)),hAPP(fun(X2,bool),fun(X2,bool),hAPP(X2,fun(fun(X2,bool),fun(X2,bool)),insert(X2),X12),X9)),X11)))|(hBOOL(hAPP(fun(X2,bool),bool,hAPP(X2,fun(fun(X2,bool),bool),member(X2),X12),X11))&hBOOL(hAPP(fun(X2,bool),bool,hAPP(fun(X2,bool),fun(fun(X2,bool),bool),ord_less_eq(fun(X2,bool)),X9),X11))))&((~(hBOOL(hAPP(fun(X2,bool),bool,hAPP(X2,fun(fun(X2,bool),bool),member(X2),X12),X11)))|~(hBOOL(hAPP(fun(X2,bool),bool,hAPP(fun(X2,bool),fun(fun(X2,bool),bool),ord_less_eq(fun(X2,bool)),X9),X11))))|hBOOL(hAPP(fun(X2,bool),bool,hAPP(fun(X2,bool),fun(fun(X2,bool),bool),ord_less_eq(fun(X2,bool)),hAPP(fun(X2,bool),fun(X2,bool),hAPP(X2,fun(fun(X2,bool),fun(X2,bool)),insert(X2),X12),X9)),X11)))),inference(fof_nnf,[status(thm)],[79])).
% fof(1583, plain,![X13]:![X14]:![X15]:![X16]:((~(hBOOL(hAPP(fun(X13,bool),bool,hAPP(fun(X13,bool),fun(fun(X13,bool),bool),ord_less_eq(fun(X13,bool)),hAPP(fun(X13,bool),fun(X13,bool),hAPP(X13,fun(fun(X13,bool),fun(X13,bool)),insert(X13),X14),X15)),X16)))|(hBOOL(hAPP(fun(X13,bool),bool,hAPP(X13,fun(fun(X13,bool),bool),member(X13),X14),X16))&hBOOL(hAPP(fun(X13,bool),bool,hAPP(fun(X13,bool),fun(fun(X13,bool),bool),ord_less_eq(fun(X13,bool)),X15),X16))))&((~(hBOOL(hAPP(fun(X13,bool),bool,hAPP(X13,fun(fun(X13,bool),bool),member(X13),X14),X16)))|~(hBOOL(hAPP(fun(X13,bool),bool,hAPP(fun(X13,bool),fun(fun(X13,bool),bool),ord_less_eq(fun(X13,bool)),X15),X16))))|hBOOL(hAPP(fun(X13,bool),bool,hAPP(fun(X13,bool),fun(fun(X13,bool),bool),ord_less_eq(fun(X13,bool)),hAPP(fun(X13,bool),fun(X13,bool),hAPP(X13,fun(fun(X13,bool),fun(X13,bool)),insert(X13),X14),X15)),X16)))),inference(variable_rename,[status(thm)],[1582])).
% fof(1584, plain,![X13]:![X14]:![X15]:![X16]:(((hBOOL(hAPP(fun(X13,bool),bool,hAPP(X13,fun(fun(X13,bool),bool),member(X13),X14),X16))|~(hBOOL(hAPP(fun(X13,bool),bool,hAPP(fun(X13,bool),fun(fun(X13,bool),bool),ord_less_eq(fun(X13,bool)),hAPP(fun(X13,bool),fun(X13,bool),hAPP(X13,fun(fun(X13,bool),fun(X13,bool)),insert(X13),X14),X15)),X16))))&(hBOOL(hAPP(fun(X13,bool),bool,hAPP(fun(X13,bool),fun(fun(X13,bool),bool),ord_less_eq(fun(X13,bool)),X15),X16))|~(hBOOL(hAPP(fun(X13,bool),bool,hAPP(fun(X13,bool),fun(fun(X13,bool),bool),ord_less_eq(fun(X13,bool)),hAPP(fun(X13,bool),fun(X13,bool),hAPP(X13,fun(fun(X13,bool),fun(X13,bool)),insert(X13),X14),X15)),X16)))))&((~(hBOOL(hAPP(fun(X13,bool),bool,hAPP(X13,fun(fun(X13,bool),bool),member(X13),X14),X16)))|~(hBOOL(hAPP(fun(X13,bool),bool,hAPP(fun(X13,bool),fun(fun(X13,bool),bool),ord_less_eq(fun(X13,bool)),X15),X16))))|hBOOL(hAPP(fun(X13,bool),bool,hAPP(fun(X13,bool),fun(fun(X13,bool),bool),ord_less_eq(fun(X13,bool)),hAPP(fun(X13,bool),fun(X13,bool),hAPP(X13,fun(fun(X13,bool),fun(X13,bool)),insert(X13),X14),X15)),X16)))),inference(distribute,[status(thm)],[1583])).
% cnf(1585,plain,(hBOOL(hAPP(fun(X1,bool),bool,hAPP(fun(X1,bool),fun(fun(X1,bool),bool),ord_less_eq(fun(X1,bool)),hAPP(fun(X1,bool),fun(X1,bool),hAPP(X1,fun(fun(X1,bool),fun(X1,bool)),insert(X1),X2),X3)),X4))|~hBOOL(hAPP(fun(X1,bool),bool,hAPP(fun(X1,bool),fun(fun(X1,bool),bool),ord_less_eq(fun(X1,bool)),X3),X4))|~hBOOL(hAPP(fun(X1,bool),bool,hAPP(X1,fun(fun(X1,bool),bool),member(X1),X2),X4))),inference(split_conjunct,[status(thm)],[1584])).
% cnf(1723,plain,(hBOOL(hAPP(fun(x_a,bool),bool,hAPP(fun(x_a,bool),fun(fun(x_a,bool),bool),ord_less_eq(fun(x_a,bool)),g),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u)))),inference(split_conjunct,[status(thm)],[120])).
% cnf(1726,plain,(hBOOL(hAPP(fun(pname,bool),bool,hAPP(pname,fun(fun(pname,bool),bool),member(pname),pn),u))),inference(split_conjunct,[status(thm)],[123])).
% cnf(5649,negated_conjecture,(~hBOOL(hAPP(fun(x_a,bool),bool,hAPP(fun(x_a,bool),fun(fun(x_a,bool),bool),ord_less_eq(fun(x_a,bool)),hAPP(fun(x_a,bool),fun(x_a,bool),hAPP(x_a,fun(fun(x_a,bool),fun(x_a,bool)),insert(x_a),hAPP(pname,x_a,mgt_call,pn)),g)),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u)))),inference(split_conjunct,[status(thm)],[1326])).
% cnf(29555,negated_conjecture,(~hBOOL(hAPP(fun(x_a,bool),bool,hAPP(fun(x_a,bool),fun(fun(x_a,bool),bool),ord_less_eq(fun(x_a,bool)),g),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u)))|~hBOOL(hAPP(fun(x_a,bool),bool,hAPP(x_a,fun(fun(x_a,bool),bool),member(x_a),hAPP(pname,x_a,mgt_call,pn)),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u)))),inference(spm,[status(thm)],[5649,1585,theory(equality)])).
% cnf(29575,negated_conjecture,($false|~hBOOL(hAPP(fun(x_a,bool),bool,hAPP(x_a,fun(fun(x_a,bool),bool),member(x_a),hAPP(pname,x_a,mgt_call,pn)),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u)))),inference(rw,[status(thm)],[29555,1723,theory(equality)])).
% cnf(29576,negated_conjecture,(~hBOOL(hAPP(fun(x_a,bool),bool,hAPP(x_a,fun(fun(x_a,bool),bool),member(x_a),hAPP(pname,x_a,mgt_call,pn)),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u)))),inference(cn,[status(thm)],[29575,theory(equality)])).
% cnf(150875,negated_conjecture,(~hBOOL(hAPP(fun(pname,bool),bool,hAPP(pname,fun(fun(pname,bool),bool),member(pname),pn),u))),inference(spm,[status(thm)],[29576,1576,theory(equality)])).
% cnf(150877,negated_conjecture,($false),inference(rw,[status(thm)],[150875,1726,theory(equality)])).
% cnf(150878,negated_conjecture,($false),inference(cn,[status(thm)],[150877,theory(equality)])).
% cnf(150879,negated_conjecture,($false),150878,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 10.42 CPU 10.63 WC
% FINAL PrfWatch: 10.42 CPU 10.63 WC
% SZS output end Solution for /tmp/SystemOnTPTP27263/SWW473+7.tptp
%
%------------------------------------------------------------------------------