TSTP Solution File: SWW473+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWW473+3 : TPTP v5.3.0. Released v5.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art03.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:30 EST 2011
% Result : Theorem 225.16s
% Output : Solution 225.16s
% 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/SystemOnTPTP4691/SWW473+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% WARNING: TreeLimitedRun lost 0.59s, total lost is 0.59s
% found
% SZS status THM for /tmp/SystemOnTPTP4691/SWW473+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4691/SWW473+3.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 5269
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.90 CPU 2.03 WC
% # Garbage collection reclaimed 985 unused term cells.
% # Garbage collection reclaimed 7267 unused term cells.
% # Garbage collection reclaimed 6411 unused term cells.
% # Garbage collection reclaimed 5909 unused term cells.
% # Garbage collection reclaimed 5311 unused term cells.
% # Garbage collection reclaimed 4865 unused term cells.
% # Garbage collection reclaimed 4423 unused term cells.
% # Garbage collection reclaimed 4142 unused term cells.
% # Garbage collection reclaimed 3977 unused term cells.
% # Garbage collection reclaimed 3366 unused term cells.
% # Garbage collection reclaimed 1545 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 4137 unused term cells.
% # Garbage collection reclaimed 256 unused term cells.
% # Garbage collection reclaimed 268 unused term cells.
% # Garbage collection reclaimed 257 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 255 unused term cells.
% # Garbage collection reclaimed 263 unused term cells.
% # Garbage collection reclaimed 259 unused term cells.
% # Garbage collection reclaimed 256 unused term cells.
% # Garbage collection reclaimed 260 unused term cells.
% # Garbage collection reclaimed 255 unused term cells.
% # Garbage collection reclaimed 255 unused term cells.
% # Garbage collection reclaimed 261 unused term cells.
% # Garbage collection reclaimed 255 unused term cells.
% # Garbage collection reclaimed 256 unused term cells.
% # Garbage collection reclaimed 256 unused term cells.
% # Garbage collection reclaimed 258 unused term cells.
% # Garbage collection reclaimed 259 unused term cells.
% # Garbage collection reclaimed 259 unused term cells.
% # Garbage collection reclaimed 256 unused term cells.
% # Garbage collection reclaimed 260 unused term cells.
% # Garbage collection reclaimed 275 unused term cells.
% # Garbage collection reclaimed 257 unused term cells.
% # Garbage collection reclaimed 257 unused term cells.
% # Garbage collection reclaimed 260 unused term cells.
% # Garbage collection reclaimed 260 unused term cells.
% # Garbage collection reclaimed 262 unused term cells.
% # Garbage collection reclaimed 260 unused term cells.
% # Garbage collection reclaimed 260 unused term cells.
% # Garbage collection reclaimed 259 unused term cells.
% # Garbage collection reclaimed 258 unused term cells.
% # Garbage collection reclaimed 256 unused term cells.
% # Garbage collection reclaimed 266 unused term cells.
% # Garbage collection reclaimed 266 unused term cells.
% # Garbage collection reclaimed 264 unused term cells.
% # Garbage collection reclaimed 272 unused term cells.
% # Garbage collection reclaimed 270 unused term cells.
% # Proof found!
% # SZS status Theorem
% # Parsed axioms : 1415
% # Removed by relevancy pruning : 0
% # Initial clauses : 2193
% # Removed in clause preprocessing : 106
% # Initial clauses in saturation : 2087
% # Processed clauses : 2104
% # ...of these trivial : 41
% # ...subsumed : 334
% # ...remaining for further processing: 1729
% # Other redundant clauses eliminated : 167
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 6
% # Backward-rewritten : 8
% # Generated clauses : 19335
% # ...of the previous two non-trivial : 17172
% # Contextual simplify-reflections : 36
% # Paramodulations : 19118
% # Factorizations : 10
% # Equation resolutions : 210
% # Current number of processed clauses: 1643
% # Positive orientable unit clauses: 286
% # Positive unorientable unit clauses: 7
% # Negative unit clauses : 26
% # Non-unit-clauses : 1324
% # Current number of unprocessed clauses: 16983
% # ...number of literals in the above : 59060
% # Clause-clause subsumption calls (NU) : 363212
% # Rec. Clause-clause subsumption calls : 204754
% # Unit Clause-clause subsumption calls : 5338
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 400
% # Indexed BW rewrite successes : 73
% # Backwards rewriting index : 3046 leaves, 1.67+/-2.661 terms/leaf
% # Paramod-from index : 662 leaves, 1.46+/-2.185 terms/leaf
% # Paramod-into index : 2595 leaves, 1.51+/-2.060 terms/leaf
% # SZS output start CNFRefutation.
% fof(79, axiom,![X15]:![X19]:![X17]:(hBOOL(hAPP_f1664156314l_bool(hAPP_p338031245l_bool(member_pname,X19),X17))=>hBOOL(hAPP_fun_a_bool_bool(hAPP_a85458249l_bool(member_a,hAPP_pname_a(X15,X19)),image_pname_a(X15,X17)))),file('/tmp/SRASS.s.p', fact_434_imageI)).
% fof(82, axiom,![X19]:![X17]:![X20]:(hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,hAPP_f2050579477a_bool(hAPP_a1206381875a_bool(insert_a,X19),X17)),X20))<=>(hBOOL(hAPP_fun_a_bool_bool(hAPP_a85458249l_bool(member_a,X19),X20))&hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,X17),X20)))),file('/tmp/SRASS.s.p', fact_453_insert__subset)).
% fof(104, axiom,hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,g),image_pname_a(mgt_call,u))),file('/tmp/SRASS.s.p', conj_1)).
% fof(107, axiom,hBOOL(hAPP_f1664156314l_bool(hAPP_p338031245l_bool(member_pname,pn),u)),file('/tmp/SRASS.s.p', conj_4)).
% fof(1415, conjecture,hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,hAPP_f2050579477a_bool(hAPP_a1206381875a_bool(insert_a,hAPP_pname_a(mgt_call,pn)),g)),image_pname_a(mgt_call,u))),file('/tmp/SRASS.s.p', conj_6)).
% fof(1416, negated_conjecture,~(hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,hAPP_f2050579477a_bool(hAPP_a1206381875a_bool(insert_a,hAPP_pname_a(mgt_call,pn)),g)),image_pname_a(mgt_call,u)))),inference(assume_negation,[status(cth)],[1415])).
% fof(1599, negated_conjecture,~(hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,hAPP_f2050579477a_bool(hAPP_a1206381875a_bool(insert_a,hAPP_pname_a(mgt_call,pn)),g)),image_pname_a(mgt_call,u)))),inference(fof_simplification,[status(thm)],[1416,theory(equality)])).
% fof(1861, plain,![X15]:![X19]:![X17]:(~(hBOOL(hAPP_f1664156314l_bool(hAPP_p338031245l_bool(member_pname,X19),X17)))|hBOOL(hAPP_fun_a_bool_bool(hAPP_a85458249l_bool(member_a,hAPP_pname_a(X15,X19)),image_pname_a(X15,X17)))),inference(fof_nnf,[status(thm)],[79])).
% fof(1862, plain,![X20]:![X21]:![X22]:(~(hBOOL(hAPP_f1664156314l_bool(hAPP_p338031245l_bool(member_pname,X21),X22)))|hBOOL(hAPP_fun_a_bool_bool(hAPP_a85458249l_bool(member_a,hAPP_pname_a(X20,X21)),image_pname_a(X20,X22)))),inference(variable_rename,[status(thm)],[1861])).
% cnf(1863,plain,(hBOOL(hAPP_fun_a_bool_bool(hAPP_a85458249l_bool(member_a,hAPP_pname_a(X1,X2)),image_pname_a(X1,X3)))|~hBOOL(hAPP_f1664156314l_bool(hAPP_p338031245l_bool(member_pname,X2),X3))),inference(split_conjunct,[status(thm)],[1862])).
% fof(1869, plain,![X19]:![X17]:![X20]:((~(hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,hAPP_f2050579477a_bool(hAPP_a1206381875a_bool(insert_a,X19),X17)),X20)))|(hBOOL(hAPP_fun_a_bool_bool(hAPP_a85458249l_bool(member_a,X19),X20))&hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,X17),X20))))&((~(hBOOL(hAPP_fun_a_bool_bool(hAPP_a85458249l_bool(member_a,X19),X20)))|~(hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,X17),X20))))|hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,hAPP_f2050579477a_bool(hAPP_a1206381875a_bool(insert_a,X19),X17)),X20)))),inference(fof_nnf,[status(thm)],[82])).
% fof(1870, plain,![X21]:![X22]:![X23]:((~(hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,hAPP_f2050579477a_bool(hAPP_a1206381875a_bool(insert_a,X21),X22)),X23)))|(hBOOL(hAPP_fun_a_bool_bool(hAPP_a85458249l_bool(member_a,X21),X23))&hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,X22),X23))))&((~(hBOOL(hAPP_fun_a_bool_bool(hAPP_a85458249l_bool(member_a,X21),X23)))|~(hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,X22),X23))))|hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,hAPP_f2050579477a_bool(hAPP_a1206381875a_bool(insert_a,X21),X22)),X23)))),inference(variable_rename,[status(thm)],[1869])).
% fof(1871, plain,![X21]:![X22]:![X23]:(((hBOOL(hAPP_fun_a_bool_bool(hAPP_a85458249l_bool(member_a,X21),X23))|~(hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,hAPP_f2050579477a_bool(hAPP_a1206381875a_bool(insert_a,X21),X22)),X23))))&(hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,X22),X23))|~(hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,hAPP_f2050579477a_bool(hAPP_a1206381875a_bool(insert_a,X21),X22)),X23)))))&((~(hBOOL(hAPP_fun_a_bool_bool(hAPP_a85458249l_bool(member_a,X21),X23)))|~(hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,X22),X23))))|hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,hAPP_f2050579477a_bool(hAPP_a1206381875a_bool(insert_a,X21),X22)),X23)))),inference(distribute,[status(thm)],[1870])).
% cnf(1872,plain,(hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,hAPP_f2050579477a_bool(hAPP_a1206381875a_bool(insert_a,X1),X2)),X3))|~hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,X2),X3))|~hBOOL(hAPP_fun_a_bool_bool(hAPP_a85458249l_bool(member_a,X1),X3))),inference(split_conjunct,[status(thm)],[1871])).
% cnf(1941,plain,(hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,g),image_pname_a(mgt_call,u)))),inference(split_conjunct,[status(thm)],[104])).
% cnf(1944,plain,(hBOOL(hAPP_f1664156314l_bool(hAPP_p338031245l_bool(member_pname,pn),u))),inference(split_conjunct,[status(thm)],[107])).
% cnf(6656,negated_conjecture,(~hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,hAPP_f2050579477a_bool(hAPP_a1206381875a_bool(insert_a,hAPP_pname_a(mgt_call,pn)),g)),image_pname_a(mgt_call,u)))),inference(split_conjunct,[status(thm)],[1599])).
% cnf(7414,negated_conjecture,(~hBOOL(hAPP_fun_a_bool_bool(hAPP_a85458249l_bool(member_a,hAPP_pname_a(mgt_call,pn)),image_pname_a(mgt_call,u)))|~hBOOL(hAPP_fun_a_bool_bool(hAPP_f1631501043l_bool(ord_le1311769555a_bool,g),image_pname_a(mgt_call,u)))),inference(spm,[status(thm)],[6656,1872,theory(equality)])).
% cnf(7422,negated_conjecture,(~hBOOL(hAPP_fun_a_bool_bool(hAPP_a85458249l_bool(member_a,hAPP_pname_a(mgt_call,pn)),image_pname_a(mgt_call,u)))|$false),inference(rw,[status(thm)],[7414,1941,theory(equality)])).
% cnf(7423,negated_conjecture,(~hBOOL(hAPP_fun_a_bool_bool(hAPP_a85458249l_bool(member_a,hAPP_pname_a(mgt_call,pn)),image_pname_a(mgt_call,u)))),inference(cn,[status(thm)],[7422,theory(equality)])).
% cnf(32374,negated_conjecture,(~hBOOL(hAPP_f1664156314l_bool(hAPP_p338031245l_bool(member_pname,pn),u))),inference(spm,[status(thm)],[7423,1863,theory(equality)])).
% cnf(32377,negated_conjecture,($false),inference(rw,[status(thm)],[32374,1944,theory(equality)])).
% cnf(32378,negated_conjecture,($false),inference(cn,[status(thm)],[32377,theory(equality)])).
% cnf(32379,negated_conjecture,($false),32378,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 3.06 CPU 3.20 WC
% FINAL PrfWatch: 3.06 CPU 3.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP4691/SWW473+3.tptp
%
%------------------------------------------------------------------------------