%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM925+6 : TPTP v5.3.0. Released v5.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art08.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2005MB
% OS : Linux 2.6.32.26-175.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 4 00:29:50 EST 2011
% Result : Theorem 26.07s
% Output : Solution 26.07s
% 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/SystemOnTPTP32132/NUM925+6.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% WARNING: TreeLimitedRun lost 0.01s, total lost is 0.01s
% found
% SZS status THM for /tmp/SystemOnTPTP32132/NUM925+6.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32132/NUM925+6.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 32362
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Garbage collection reclaimed 250 unused term cells.
% # Garbage collection reclaimed 3044 unused term cells.
% # Garbage collection reclaimed 2591 unused term cells.
% # Garbage collection reclaimed 2386 unused term cells.
% # Garbage collection reclaimed 2110 unused term cells.
% # Garbage collection reclaimed 1876 unused term cells.
% # Garbage collection reclaimed 1662 unused term cells.
% # Garbage collection reclaimed 1541 unused term cells.
% # Garbage collection reclaimed 1386 unused term cells.
% # Garbage collection reclaimed 1323 unused term cells.
% # Garbage collection reclaimed 1031 unused term cells.
% # Auto-Ordering is analysing problem.
% # Problem is type GHSMNFSLM33LD
% # 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 GHSMNFSLM33LD
% # Auto-Mode selected heuristic G_E___012_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y
% # and selection function SelectMaxLComplexAvoidPosPred.
% #
% # Initializing proof state
% # Scanning for AC axioms
% # Garbage collection reclaimed 1219 unused term cells.
% # Garbage collection reclaimed 265 unused term cells.
% # Garbage collection reclaimed 257 unused term cells.
% # Garbage collection reclaimed 258 unused term cells.
% # Garbage collection reclaimed 255 unused term cells.
% # Garbage collection reclaimed 255 unused term cells.
% # Garbage collection reclaimed 257 unused term cells.
% # Garbage collection reclaimed 260 unused term cells.
% # Presaturation interreduction done
% # Garbage collection reclaimed 255 unused term cells.
% # Garbage collection reclaimed 259 unused term cells.
% # Garbage collection reclaimed 260 unused term cells.
% # Garbage collection reclaimed 263 unused term cells.
% # Proof found!
% # SZS status Theorem
% # Parsed axioms : 660
% # Removed by relevancy pruning : 0
% # Initial clauses : 904
% # Removed in clause preprocessing : 51
% # Initial clauses in saturation : 853
% # Processed clauses : 1393
% # ...of these trivial : 18
% # ...subsumed : 142
% # ...remaining for further processing: 1233
% # Other redundant clauses eliminated : 22
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 4
% # Generated clauses : 5844
% # ...of the previous two non-trivial : 5029
% # Contextual simplify-reflections : 9
% # Paramodulations : 5804
% # Factorizations : 11
% # Equation resolutions : 29
% # Current number of processed clauses: 529
% # Positive orientable unit clauses: 192
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 11
% # Non-unit-clauses : 322
% # Current number of unprocessed clauses: 5175
% # ...number of literals in the above : 12543
% # Clause-clause subsumption calls (NU) : 5815
% # Rec. Clause-clause subsumption calls : 2915
% # Unit Clause-clause subsumption calls : 77
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2839
% # Indexed BW rewrite successes : 55
% # Backwards rewriting index : 323 leaves, 3.27+/-9.810 terms/leaf
% # Paramod-from index : 157 leaves, 2.18+/-5.469 terms/leaf
% # Paramod-into index : 299 leaves, 2.92+/-7.936 terms/leaf
% # SZS output start CNFRefutation.
% fof(20, axiom,one_one(int)=number_number_of(int,hAPP(int,int,bit1,pls)),file('/tmp/SRASS.s.p', fact_37_one__is__num__one)).
% fof(36, axiom,pls=zero_zero(int),file('/tmp/SRASS.s.p', fact_73_Pls__def)).
% fof(50, axiom,![X18]:number_number_of(int,X18)=X18,file('/tmp/SRASS.s.p', fact_119_number__of__is__id)).
% fof(96, axiom,hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),zero_zero(int)),hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n)))),file('/tmp/SRASS.s.p', fact_0_n1pos)).
% fof(264, axiom,~(hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),pls),pls))),file('/tmp/SRASS.s.p', fact_32_rel__simps_I2_J)).
% fof(338, axiom,![X1]:(linordered_semidom(X1)=>![X8]:![X25]:(hBOOL(hAPP(X1,bool,hAPP(X1,fun(X1,bool),ord_less(X1),zero_zero(X1)),X25))=>hBOOL(hAPP(X1,bool,hAPP(X1,fun(X1,bool),ord_less(X1),zero_zero(X1)),hAPP(nat,X1,power_power(X1,X25),X8))))),file('/tmp/SRASS.s.p', fact_178_zero__less__power)).
% fof(362, axiom,linordered_semidom(int),file('/tmp/SRASS.s.p', arity_Int_Oint___Rings_Olinordered__semidom)).
% fof(660, conjecture,~(hAPP(nat,int,power_power(int,hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))=zero_zero(int)),file('/tmp/SRASS.s.p', conj_0)).
% fof(661, negated_conjecture,~(~(hAPP(nat,int,power_power(int,hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))=zero_zero(int))),inference(assume_negation,[status(cth)],[660])).
% fof(673, plain,~(hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),pls),pls))),inference(fof_simplification,[status(thm)],[264,theory(equality)])).
% fof(712, negated_conjecture,hAPP(nat,int,power_power(int,hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))=zero_zero(int),inference(fof_simplification,[status(thm)],[661,theory(equality)])).
% cnf(747,plain,(one_one(int)=number_number_of(int,hAPP(int,int,bit1,pls))),inference(split_conjunct,[status(thm)],[20])).
% cnf(785,plain,(pls=zero_zero(int)),inference(split_conjunct,[status(thm)],[36])).
% fof(809, plain,![X19]:number_number_of(int,X19)=X19,inference(variable_rename,[status(thm)],[50])).
% cnf(810,plain,(number_number_of(int,X1)=X1),inference(split_conjunct,[status(thm)],[809])).
% cnf(950,plain,(hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),zero_zero(int)),hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n))))),inference(split_conjunct,[status(thm)],[96])).
% cnf(1598,plain,(~hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),pls),pls))),inference(split_conjunct,[status(thm)],[673])).
% fof(1898, plain,![X1]:(~(linordered_semidom(X1))|![X8]:![X25]:(~(hBOOL(hAPP(X1,bool,hAPP(X1,fun(X1,bool),ord_less(X1),zero_zero(X1)),X25)))|hBOOL(hAPP(X1,bool,hAPP(X1,fun(X1,bool),ord_less(X1),zero_zero(X1)),hAPP(nat,X1,power_power(X1,X25),X8))))),inference(fof_nnf,[status(thm)],[338])).
% fof(1899, plain,![X26]:(~(linordered_semidom(X26))|![X27]:![X28]:(~(hBOOL(hAPP(X26,bool,hAPP(X26,fun(X26,bool),ord_less(X26),zero_zero(X26)),X28)))|hBOOL(hAPP(X26,bool,hAPP(X26,fun(X26,bool),ord_less(X26),zero_zero(X26)),hAPP(nat,X26,power_power(X26,X28),X27))))),inference(variable_rename,[status(thm)],[1898])).
% fof(1900, plain,![X26]:![X27]:![X28]:(~(linordered_semidom(X26))|(~(hBOOL(hAPP(X26,bool,hAPP(X26,fun(X26,bool),ord_less(X26),zero_zero(X26)),X28)))|hBOOL(hAPP(X26,bool,hAPP(X26,fun(X26,bool),ord_less(X26),zero_zero(X26)),hAPP(nat,X26,power_power(X26,X28),X27))))),inference(shift_quantors,[status(thm)],[1899])).
% cnf(1901,plain,(hBOOL(hAPP(X1,bool,hAPP(X1,fun(X1,bool),ord_less(X1),zero_zero(X1)),hAPP(nat,X1,power_power(X1,X2),X3)))|~hBOOL(hAPP(X1,bool,hAPP(X1,fun(X1,bool),ord_less(X1),zero_zero(X1)),X2))|~linordered_semidom(X1)),inference(split_conjunct,[status(thm)],[1900])).
% cnf(1971,plain,(linordered_semidom(int)),inference(split_conjunct,[status(thm)],[362])).
% cnf(2939,negated_conjecture,(hAPP(nat,int,power_power(int,hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))=zero_zero(int)),inference(split_conjunct,[status(thm)],[712])).
% cnf(2945,plain,(one_one(int)=hAPP(int,int,bit1,pls)),inference(rw,[status(thm)],[747,810,theory(equality)])).
% cnf(3017,negated_conjecture,(hAPP(nat,int,power_power(int,hAPP(int,int,plus_plus(int,hAPP(int,int,bit1,pls)),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))=zero_zero(int)),inference(rw,[status(thm)],[2939,2945,theory(equality)])).
% cnf(3018,negated_conjecture,(hAPP(nat,int,power_power(int,hAPP(int,int,plus_plus(int,hAPP(int,int,bit1,pls)),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))=pls),inference(rw,[status(thm)],[3017,785,theory(equality)])).
% cnf(3028,plain,(hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),pls),hAPP(int,int,plus_plus(int,hAPP(int,int,bit1,pls)),hAPP(nat,int,semiring_1_of_nat(int),n))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[950,785,theory(equality)]),2945,theory(equality)])).
% cnf(16783,negated_conjecture,(hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),zero_zero(int)),pls))|~linordered_semidom(int)|~hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),zero_zero(int)),hAPP(int,int,plus_plus(int,hAPP(int,int,bit1,pls)),hAPP(nat,int,semiring_1_of_nat(int),n))))),inference(spm,[status(thm)],[1901,3018,theory(equality)])).
% cnf(16818,negated_conjecture,(hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),pls),pls))|~linordered_semidom(int)|~hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),zero_zero(int)),hAPP(int,int,plus_plus(int,hAPP(int,int,bit1,pls)),hAPP(nat,int,semiring_1_of_nat(int),n))))),inference(rw,[status(thm)],[16783,785,theory(equality)])).
% cnf(16819,negated_conjecture,(hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),pls),pls))|$false|~hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),zero_zero(int)),hAPP(int,int,plus_plus(int,hAPP(int,int,bit1,pls)),hAPP(nat,int,semiring_1_of_nat(int),n))))),inference(rw,[status(thm)],[16818,1971,theory(equality)])).
% cnf(16820,negated_conjecture,(hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),pls),pls))|$false|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[16819,785,theory(equality)]),3028,theory(equality)])).
% cnf(16821,negated_conjecture,(hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),pls),pls))),inference(cn,[status(thm)],[16820,theory(equality)])).
% cnf(16822,negated_conjecture,($false),inference(sr,[status(thm)],[16821,1598,theory(equality)])).
% cnf(16823,negated_conjecture,($false),16822,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.94 CPU 1.06 WC
% FINAL PrfWatch: 0.94 CPU 1.06 WC
% SZS output end Solution for /tmp/SystemOnTPTP32132/NUM925+6.tptp
%
%------------------------------------------------------------------------------