TSTP Solution File: SWW473+5 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWW473+5 : TPTP v5.3.0. Released v5.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art04.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:09:45 EST 2011
% Result : Theorem 1.78s
% Output : Solution 1.78s
% 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/SystemOnTPTP31760/SWW473+5.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31760/SWW473+5.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31760/SWW473+5.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 31874
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Garbage collection reclaimed 114 unused term cells.
% # Garbage collection reclaimed 892 unused term cells.
% # Garbage collection reclaimed 831 unused term cells.
% # Garbage collection reclaimed 711 unused term cells.
% # Garbage collection reclaimed 575 unused term cells.
% # Garbage collection reclaimed 554 unused term cells.
% # Garbage collection reclaimed 639 unused term cells.
% # Garbage collection reclaimed 261 unused term cells.
% # Auto-Ordering is analysing problem.
% # Problem is type GHSMNFFLM32LD
% # Auto-mode selected ordering type KBO6
% # Auto-mode selected ordering precedence scheme <invfreq>
% # Auto-mode selected weight ordering scheme <precrank20>
% #
% # Auto-Heuristic is analysing problem.
% # Problem is type GHSMNFFLM32LD
% # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y
% # and selection function SelectMaxLComplexAvoidPosPred.
% #
% # Initializing proof state
% # Scanning for AC axioms
% # Garbage collection reclaimed 430 unused term cells.
% # Garbage collection reclaimed 256 unused term cells.
% # Presaturation interreduction done
% # Garbage collection reclaimed 255 unused term cells.
% # Garbage collection reclaimed 257 unused term cells.
% # Garbage collection reclaimed 256 unused term cells.
% # Garbage collection reclaimed 258 unused term cells.
% # Proof found!
% # SZS status Theorem
% # Parsed axioms : 161
% # Removed by relevancy pruning : 0
% # Initial clauses : 200
% # Removed in clause preprocessing : 3
% # Initial clauses in saturation : 197
% # Processed clauses : 832
% # ...of these trivial : 12
% # ...subsumed : 354
% # ...remaining for further processing: 466
% # Other redundant clauses eliminated : 6
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 8
% # Generated clauses : 2533
% # ...of the previous two non-trivial : 2171
% # Contextual simplify-reflections : 41
% # Paramodulations : 2510
% # Factorizations : 4
% # Equation resolutions : 19
% # Current number of processed clauses: 285
% # Positive orientable unit clauses: 69
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 12
% # Non-unit-clauses : 199
% # Current number of unprocessed clauses: 1612
% # ...number of literals in the above : 3912
% # Clause-clause subsumption calls (NU) : 4814
% # Rec. Clause-clause subsumption calls : 4589
% # Unit Clause-clause subsumption calls : 47
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3445
% # Indexed BW rewrite successes : 11
% # Backwards rewriting index : 217 leaves, 3.85+/-9.515 terms/leaf
% # Paramod-from index : 33 leaves, 4.30+/-8.126 terms/leaf
% # Paramod-into index : 200 leaves, 3.44+/-7.385 terms/leaf
% # SZS output start CNFRefutation.
% fof(74, 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_78_imageI)).
% fof(77, 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_84_insert__subset)).
% fof(101, 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(104, 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(161, 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(162, 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)],[161])).
% fof(185, 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)],[162,theory(equality)])).
% fof(423, 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)],[74])).
% fof(424, 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)],[423])).
% cnf(425,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)],[424])).
% fof(431, 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)],[77])).
% fof(432, 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)],[431])).
% fof(433, 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)],[432])).
% cnf(434,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)],[433])).
% cnf(514,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)],[101])).
% cnf(517,plain,(hBOOL(hAPP(fun(pname,bool),bool,hAPP(pname,fun(fun(pname,bool),bool),member(pname),pn),u))),inference(split_conjunct,[status(thm)],[104])).
% cnf(645,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)],[185])).
% cnf(1954,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)],[645,434,theory(equality)])).
% cnf(1967,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)],[1954,514,theory(equality)])).
% cnf(1968,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)],[1967,theory(equality)])).
% cnf(4435,negated_conjecture,(~hBOOL(hAPP(fun(pname,bool),bool,hAPP(pname,fun(fun(pname,bool),bool),member(pname),pn),u))),inference(spm,[status(thm)],[1968,425,theory(equality)])).
% cnf(4436,negated_conjecture,($false),inference(rw,[status(thm)],[4435,517,theory(equality)])).
% cnf(4437,negated_conjecture,($false),inference(cn,[status(thm)],[4436,theory(equality)])).
% cnf(4438,negated_conjecture,($false),4437,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.44 CPU 0.56 WC
% FINAL PrfWatch: 0.44 CPU 0.56 WC
% SZS output end Solution for /tmp/SystemOnTPTP31760/SWW473+5.tptp
%
%------------------------------------------------------------------------------